About the Execution of LTSMin+red for EisenbergMcGuire-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1513.296 | 2491538.00 | 4494968.00 | 5825.20 | FFFFFTTFTFTFFFFF | 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.r492-smll-171636266300164.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 ltsminxred
Input is EisenbergMcGuire-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 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 460K 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 EisenbergMcGuire-PT-05-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717222840123
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:20:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:20:43] [INFO ] Load time of PNML (sax parser for PT used): 391 ms
[2024-06-01 06:20:43] [INFO ] Transformed 295 places.
[2024-06-01 06:20:43] [INFO ] Transformed 800 transitions.
[2024-06-01 06:20:43] [INFO ] Found NUPN structural information;
[2024-06-01 06:20:43] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 280 transition count 725
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 280 transition count 725
Applied a total of 30 rules in 201 ms. Remains 280 /295 variables (removed 15) and now considering 725/800 (removed 75) transitions.
[2024-06-01 06:20:44] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
// Phase 1: matrix 390 rows 280 cols
[2024-06-01 06:20:44] [INFO ] Computed 16 invariants in 40 ms
[2024-06-01 06:20:44] [INFO ] Implicit Places using invariants in 765 ms returned []
[2024-06-01 06:20:44] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-06-01 06:20:44] [INFO ] Invariant cache hit.
[2024-06-01 06:20:45] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-01 06:20:45] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
Running 720 sub problems to find dead transitions.
[2024-06-01 06:20:45] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-06-01 06:20:45] [INFO ] Invariant cache hit.
[2024-06-01 06:20:45] [INFO ] State equation strengthened by 136 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 37 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 5 ms to minimize.
[2024-06-01 06:20:55] [INFO ] Deduced a trap composed of 50 places in 270 ms of which 14 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 5 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 5 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 4 ms to minimize.
[2024-06-01 06:20:56] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 5 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:20:57] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 4 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 4 ms to minimize.
[2024-06-01 06:20:58] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 4 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 4 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 99 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:20:59] [INFO ] Deduced a trap composed of 80 places in 256 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 06:21:00] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:21:00] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:21:00] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:21:01] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:21:02] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:21:02] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 5 ms to minimize.
[2024-06-01 06:21:02] [INFO ] Deduced a trap composed of 73 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:21:02] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:21:03] [INFO ] Deduced a trap composed of 81 places in 253 ms of which 5 ms to minimize.
[2024-06-01 06:21:03] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:21:03] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 4 ms to minimize.
[2024-06-01 06:21:03] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:21:04] [INFO ] Deduced a trap composed of 61 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:21:04] [INFO ] Deduced a trap composed of 84 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:21:04] [INFO ] Deduced a trap composed of 76 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:21:05] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:21:05] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:21:05] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:21:06] [INFO ] Deduced a trap composed of 77 places in 224 ms of which 5 ms to minimize.
[2024-06-01 06:21:06] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 4 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 5 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 280/670 variables, and 64 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/280 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 720/720 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 720 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 720 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 06:21:18] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:21:19] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 4 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 5 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 88 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:21:20] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 5 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 101 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:21:21] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:21:22] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:21:22] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 3 ms to minimize.
[2024-06-01 06:21:22] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:21:23] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:21:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:21:23] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
[2024-06-01 06:21:23] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 98 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:21:24] [INFO ] Deduced a trap composed of 50 places in 323 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 06:21:26] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:21:27] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 7 ms to minimize.
[2024-06-01 06:21:27] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:21:27] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 4 ms to minimize.
[2024-06-01 06:21:28] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:21:29] [INFO ] Deduced a trap composed of 71 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:21:30] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 5 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 65 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:21:31] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:21:32] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 5 ms to minimize.
[2024-06-01 06:21:33] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:21:34] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:21:34] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:21:35] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:21:35] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 5 ms to minimize.
[2024-06-01 06:21:39] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 720 unsolved
[2024-06-01 06:21:41] [INFO ] Deduced a trap composed of 74 places in 238 ms of which 5 ms to minimize.
[2024-06-01 06:21:41] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:21:42] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 4 ms to minimize.
[2024-06-01 06:21:43] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/670 variables, and 108 constraints, problems are : Problem set: 0 solved, 720 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/280 constraints, ReadFeed: 0/136 constraints, PredecessorRefiner: 0/720 constraints, Known Traps: 92/92 constraints]
After SMT, in 60867ms problems are : Problem set: 0 solved, 720 unsolved
Search for dead transitions found 0 dead transitions in 60924ms
Starting structural reductions in LTL mode, iteration 1 : 280/295 places, 725/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63119 ms. Remains : 280/295 places, 725/800 transitions.
Support contains 40 out of 280 places after structural reductions.
[2024-06-01 06:21:47] [INFO ] Flatten gal took : 172 ms
[2024-06-01 06:21:47] [INFO ] Flatten gal took : 102 ms
[2024-06-01 06:21:47] [INFO ] Input system was already deterministic with 725 transitions.
Support contains 39 out of 280 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2712 ms. (14 steps per ms) remains 17/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
[2024-06-01 06:21:48] [INFO ] Flow matrix only has 390 transitions (discarded 335 similar events)
[2024-06-01 06:21:48] [INFO ] Invariant cache hit.
[2024-06-01 06:21:48] [INFO ] State equation strengthened by 136 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 246/276 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 4 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:21:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 63 places in 310 ms of which 5 ms to minimize.
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 06:21:51] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 06:21:51] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:21:52] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 5 ms to minimize.
[2024-06-01 06:21:52] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:21:52] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/280 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:21:53] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
SMT process timed out in 5163ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 280 transition count 721
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 276 transition count 721
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 8 place count 276 transition count 649
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 152 place count 204 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 203 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 203 transition count 644
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 194 place count 183 transition count 624
Applied a total of 194 rules in 184 ms. Remains 183 /280 variables (removed 97) and now considering 624/725 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 183/280 places, 624/725 transitions.
RANDOM walk for 40000 steps (8 resets) in 650 ms. (61 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
[2024-06-01 06:21:54] [INFO ] Flow matrix only has 289 transitions (discarded 335 similar events)
// Phase 1: matrix 289 rows 183 cols
[2024-06-01 06:21:54] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 06:21:54] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 121/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:21:54] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 27/175 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:21:55] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:21:56] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:21:56] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:21:56] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:21:56] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 8/183 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:21:57] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:21:58] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 289/472 variables, 183/220 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 132/352 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/472 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 352 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4683 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 121/148 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 27/175 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:21:59] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 8/183 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:22:00] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:22:01] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:22:03] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 289/472 variables, 183/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 132/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 14/383 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 0/472 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 386 constraints, problems are : Problem set: 0 solved, 14 unsolved in 7001 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 41/41 constraints]
After SMT, in 11721ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 7 properties in 9210 ms.
Support contains 16 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 624/624 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 183 transition count 619
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 178 transition count 619
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 174 transition count 599
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 174 transition count 599
Applied a total of 18 rules in 37 ms. Remains 174 /183 variables (removed 9) and now considering 599/624 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 174/183 places, 599/624 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/7 properties
[2024-06-01 06:22:15] [INFO ] Flow matrix only has 264 transitions (discarded 335 similar events)
// Phase 1: matrix 264 rows 174 cols
[2024-06-01 06:22:15] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 06:22:15] [INFO ] State equation strengthened by 116 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 124/139 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 28/167 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 7/174 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 264/438 variables, 174/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 116/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/438 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/438 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 320 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 124/139 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 28/167 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 7/174 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 264/438 variables, 174/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 116/321 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/438 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 328 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 16/16 constraints]
After SMT, in 3324ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2451 ms.
Support contains 15 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 599/599 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 174 transition count 598
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 173 transition count 598
Applied a total of 2 rules in 32 ms. Remains 173 /174 variables (removed 1) and now considering 598/599 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 173/174 places, 598/599 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 411024 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :2 out of 6
Probabilistic random walk after 411024 steps, saw 85984 distinct states, run finished after 3007 ms. (steps per millisecond=136 ) properties seen :2
[2024-06-01 06:22:24] [INFO ] Flow matrix only has 263 transitions (discarded 335 similar events)
// Phase 1: matrix 263 rows 173 cols
[2024-06-01 06:22:24] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:22:24] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 125/136 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 30/166 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 7/173 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 263/436 variables, 173/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 116/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/436 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 305 constraints, problems are : Problem set: 0 solved, 4 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 125/136 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 30/166 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:22:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/173 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 263/436 variables, 173/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 116/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:22:26] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/436 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/436 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 318 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 2102ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 673 ms.
Support contains 8 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 598/598 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 173 transition count 596
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 171 transition count 596
Applied a total of 4 rules in 39 ms. Remains 171 /173 variables (removed 2) and now considering 596/598 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 171/173 places, 596/598 transitions.
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 378120 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 3
Probabilistic random walk after 378120 steps, saw 80173 distinct states, run finished after 3002 ms. (steps per millisecond=125 ) properties seen :0
[2024-06-01 06:22:30] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:22:30] [INFO ] Computed 16 invariants in 7 ms
[2024-06-01 06:22:30] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/131 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:22:31] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:22:31] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:22:31] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/138 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:22:31] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 217/355 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 70/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 16/371 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 24/395 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/397 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/397 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 35/432 variables, 26/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 39/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/432 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 307 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/131 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/138 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 217/355 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 70/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 16/371 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 7/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 24/395 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/397 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/397 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:22:32] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:22:32] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/397 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/397 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 35/432 variables, 26/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 39/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/432 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/432 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 312 constraints, problems are : Problem set: 0 solved, 3 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 1881ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 970 ms.
Support contains 8 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 16 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 15 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-06-01 06:22:33] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:22:33] [INFO ] Invariant cache hit.
[2024-06-01 06:22:34] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 06:22:34] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:22:34] [INFO ] Invariant cache hit.
[2024-06-01 06:22:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:22:34] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2024-06-01 06:22:34] [INFO ] Redundant transitions in 61 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:22:34] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:22:34] [INFO ] Invariant cache hit.
[2024-06-01 06:22:34] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:22:40] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:22:40] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:22:40] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:22:40] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:22:40] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:22:41] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:22:42] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:22:43] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:22:43] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:22:43] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:22:44] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:22:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:22:44] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:22:44] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:22:44] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:22:45] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:22:45] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:22:45] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:22:45] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:22:46] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 4 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:22:47] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:22:53] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:22:54] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:22:54] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:22:54] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:22:54] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:22:55] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:22:56] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:22:56] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:22:56] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:22:57] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:22:57] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:22:57] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:22:57] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:22:58] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:23:02] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:23:03] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 82 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:23:07] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:23:08] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:23:11] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:23:11] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 6 ms to minimize.
[2024-06-01 06:23:11] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:23:12] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 8 ms to minimize.
[2024-06-01 06:23:12] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:23:12] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:23:12] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:23:12] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:23:13] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:23:13] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:23:14] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:23:14] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:23:20] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:23:20] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:23:20] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:23:21] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:23:26] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:23:27] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:23:27] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:23:27] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:23:28] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:23:28] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:23:30] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:23:30] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:23:30] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:23:34] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:23:34] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:23:35] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 115 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 99/99 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61638 ms. Remains : 171/171 places, 596/596 transitions.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(X(p0)||X(F(p1)))) U p2)))'
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 276 transition count 705
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 276 transition count 705
Applied a total of 8 rules in 22 ms. Remains 276 /280 variables (removed 4) and now considering 705/725 (removed 20) transitions.
[2024-06-01 06:23:35] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-06-01 06:23:35] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 06:23:36] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-01 06:23:36] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-06-01 06:23:36] [INFO ] Invariant cache hit.
[2024-06-01 06:23:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 06:23:37] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-06-01 06:23:37] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-06-01 06:23:37] [INFO ] Invariant cache hit.
[2024-06-01 06:23:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:23:44] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:23:44] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:23:45] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2024-06-01 06:23:45] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:23:45] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-06-01 06:23:45] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:23:46] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:23:46] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:23:46] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:23:46] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:23:46] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:23:47] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:23:47] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:23:47] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:23:47] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:23:47] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:23:48] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:23:49] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:23:50] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-06-01 06:23:51] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:23:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:23:57] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:23:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:23:59] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-06-01 06:24:00] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:24:01] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 4 ms to minimize.
[2024-06-01 06:24:01] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:24:01] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:24:02] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:24:02] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:24:03] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:24:03] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 4 ms to minimize.
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:24:04] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:24:05] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 4 ms to minimize.
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:24:07] [INFO ] Deduced a trap composed of 79 places in 296 ms of which 4 ms to minimize.
[2024-06-01 06:24:08] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 4 ms to minimize.
SMT process timed out in 30550ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 30568ms
Starting structural reductions in LTL mode, iteration 1 : 276/280 places, 705/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32080 ms. Remains : 276/280 places, 705/725 transitions.
Stuttering acceptance computed with spot in 681 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 550 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-00 finished in 33446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 100 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-06-01 06:24:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:24:09] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:24:09] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 06:24:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:24:09] [INFO ] Invariant cache hit.
[2024-06-01 06:24:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:24:10] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-06-01 06:24:10] [INFO ] Redundant transitions in 12 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:24:10] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:24:10] [INFO ] Invariant cache hit.
[2024-06-01 06:24:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:24:15] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:24:16] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:24:16] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:24:16] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:24:16] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:24:17] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:24:17] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:24:17] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:24:18] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 6 ms to minimize.
[2024-06-01 06:24:19] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:20] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:24:20] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:24:21] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:24:21] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:24:21] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:24:22] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:24:22] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:24:22] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:24:23] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:24:23] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:24:23] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:24:23] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:24:23] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 4 ms to minimize.
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 52 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:24:25] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:24:25] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:31] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:24:32] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:24:32] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:24:32] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:24:32] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:24:34] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:39] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:24:39] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:24:39] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:24:40] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:24:40] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 79 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:45] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:24:45] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-06-01 06:24:46] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:24:46] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:51] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:24:52] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:24:52] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:24:52] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:24:54] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:24:54] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:24:55] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:24:57] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:24:58] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:08] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:25:08] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:25:09] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:25:09] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:25:09] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:25:09] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:25:10] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:25:10] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:25:10] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:25:10] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 60573ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60585ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61604 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 392 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-01 finished in 62074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 21 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-06-01 06:25:11] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-06-01 06:25:11] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:25:11] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-06-01 06:25:11] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:25:11] [INFO ] Invariant cache hit.
[2024-06-01 06:25:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:25:12] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:25:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:25:12] [INFO ] Invariant cache hit.
[2024-06-01 06:25:12] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:25:20] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:25:20] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:25:20] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:25:21] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:25:21] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:25:21] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:25:21] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:25:22] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:25:22] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:25:22] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:25:22] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 3 ms to minimize.
[2024-06-01 06:25:23] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:25:23] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 4 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 4 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 72 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:25:25] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:25:25] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:25:25] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:25:25] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:25:26] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 3 ms to minimize.
[2024-06-01 06:25:26] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:25:27] [INFO ] Deduced a trap composed of 57 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:25:27] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 5 ms to minimize.
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:25:28] [INFO ] Deduced a trap composed of 80 places in 267 ms of which 3 ms to minimize.
[2024-06-01 06:25:29] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:25:29] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:25:29] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 4 ms to minimize.
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 64 places in 300 ms of which 5 ms to minimize.
[2024-06-01 06:25:32] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:25:40] [INFO ] Deduced a trap composed of 77 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:25:40] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:25:40] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:25:40] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 4 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 56 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 61 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:25:43] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:25:43] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 4 ms to minimize.
SMT process timed out in 30551ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30565ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32004 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-04 finished in 32278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 20 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-06-01 06:25:43] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:25:43] [INFO ] Invariant cache hit.
[2024-06-01 06:25:44] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 06:25:44] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:25:44] [INFO ] Invariant cache hit.
[2024-06-01 06:25:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:25:45] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:25:45] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:25:45] [INFO ] Invariant cache hit.
[2024-06-01 06:25:45] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:25:53] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:25:53] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:25:53] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 4 ms to minimize.
[2024-06-01 06:25:54] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:25:54] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 3 ms to minimize.
[2024-06-01 06:25:54] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 4 ms to minimize.
[2024-06-01 06:25:54] [INFO ] Deduced a trap composed of 72 places in 234 ms of which 3 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:25:55] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:25:56] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 60 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:25:57] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 5 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:25:59] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:25:59] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:26:00] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 4 ms to minimize.
[2024-06-01 06:26:00] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:26:00] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 5 ms to minimize.
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 5 ms to minimize.
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 80 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:26:01] [INFO ] Deduced a trap composed of 72 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:26:02] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:26:02] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:26:02] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:26:02] [INFO ] Deduced a trap composed of 63 places in 171 ms of which 4 ms to minimize.
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 4 ms to minimize.
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:26:04] [INFO ] Deduced a trap composed of 64 places in 328 ms of which 4 ms to minimize.
[2024-06-01 06:26:04] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:26:12] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 5 ms to minimize.
[2024-06-01 06:26:12] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 4 ms to minimize.
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 71 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:26:13] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:26:14] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:26:14] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:26:14] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 3 ms to minimize.
[2024-06-01 06:26:15] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:26:15] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:26:15] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 4 ms to minimize.
SMT process timed out in 30530ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30544ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32207 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 259 ms.
Product exploration explored 100000 steps with 0 reset in 330 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 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 150 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 709908 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 1
Probabilistic random walk after 709908 steps, saw 245908 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
[2024-06-01 06:26:20] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:26:20] [INFO ] Invariant cache hit.
[2024-06-01 06:26:20] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/283 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/331 variables, 21/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 135/466 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/472 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 168/640 variables, 141/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 82/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/640 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 275/275 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:26:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/113 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:26:20] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/283 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 24/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/331 variables, 21/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 135/466 variables, 6/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/472 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/472 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:26:21] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:26:21] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 168/640 variables, 141/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/640 variables, 82/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/640 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/640 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 275/275 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1402ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 270 transition count 615
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 170 transition count 595
Applied a total of 210 rules in 59 ms. Remains 170 /275 variables (removed 105) and now considering 595/700 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 170/275 places, 595/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 808026 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 808026 steps, saw 155424 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2024-06-01 06:26:24] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:26:24] [INFO ] Computed 16 invariants in 5 ms
[2024-06-01 06:26:24] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:26:26] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 26 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 21 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 06:26:26] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:26:26] [INFO ] Invariant cache hit.
[2024-06-01 06:26:26] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-01 06:26:26] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:26:26] [INFO ] Invariant cache hit.
[2024-06-01 06:26:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:26:27] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2024-06-01 06:26:27] [INFO ] Redundant transitions in 8 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:26:27] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:26:27] [INFO ] Invariant cache hit.
[2024-06-01 06:26:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:26:34] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:26:34] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:26:34] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:26:34] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:26:34] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:26:35] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:26:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:26:36] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:26:37] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:26:38] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:26:39] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:26:39] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:26:39] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:26:39] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:26:39] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:26:40] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:26:48] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:26:48] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:26:48] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:26:48] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:26:48] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 63 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:26:49] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:26:50] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:26:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 96 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:27:03] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:27:05] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-06-01 06:27:07] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:27:10] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:27:10] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:27:11] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 13/116 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:27:15] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:27:15] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2024-06-01 06:27:15] [INFO ] Deduced a trap composed of 57 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:27:15] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:27:15] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:27:16] [INFO ] Deduced a trap composed of 56 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:27:17] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:27:18] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:27:19] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:27:25] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:27:26] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/430 variables, and 136 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/590 constraints, Known Traps: 120/120 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61720 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 6 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 70 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-06-01 06:27:28] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 06:27:28] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:27:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:27:28] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:27:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:27:28] [INFO ] After 18ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 1
[2024-06-01 06:27:28] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 2
[2024-06-01 06:27:28] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:27:28] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 455 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p2)]
Support contains 3 out of 275 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 171 transition count 596
Applied a total of 208 rules in 60 ms. Remains 171 /275 variables (removed 104) and now considering 596/700 (removed 104) transitions.
[2024-06-01 06:27:28] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:27:28] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:27:29] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 06:27:29] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:27:29] [INFO ] Invariant cache hit.
[2024-06-01 06:27:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:27:29] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2024-06-01 06:27:29] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:27:29] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:27:29] [INFO ] Invariant cache hit.
[2024-06-01 06:27:29] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 4 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:27:40] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:27:41] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:27:42] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:27:43] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:27:44] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:27:51] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:27:51] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:27:51] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:27:52] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:27:53] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:27:54] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 67 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:28:06] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:28:07] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:28:09] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:28:11] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 2 ms to minimize.
[2024-06-01 06:28:20] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 2 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:28:22] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:28:23] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 5 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:28:24] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 105 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 89/89 constraints]
After SMT, in 60393ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61339 ms. Remains : 171/275 places, 596/700 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 724344 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 1
Probabilistic random walk after 724344 steps, saw 140971 distinct states, run finished after 3003 ms. (steps per millisecond=241 ) properties seen :0
[2024-06-01 06:28:33] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:28:33] [INFO ] Invariant cache hit.
[2024-06-01 06:28:33] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:28:33] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:28:34] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:28:34] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:28:34] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:28:34] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/432 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
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 170 transition count 595
Applied a total of 2 rules in 26 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 792990 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 792990 steps, saw 152803 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-01 06:28:37] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:28:37] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 06:28:37] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:28:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:28:38] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:28:38] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:28:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:28:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/430 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1081ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 06:28:38] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:28:38] [INFO ] Invariant cache hit.
[2024-06-01 06:28:39] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-06-01 06:28:39] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:28:39] [INFO ] Invariant cache hit.
[2024-06-01 06:28:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:28:40] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2024-06-01 06:28:40] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:28:40] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:28:40] [INFO ] Invariant cache hit.
[2024-06-01 06:28:40] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:28:46] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:28:47] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:28:48] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:28:49] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:28:51] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:28:54] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:28:55] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:28:55] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:28:55] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:28:55] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:29:03] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 6 ms to minimize.
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:29:04] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:29:05] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:29:05] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:29:05] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:29:05] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:29:06] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:29:06] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:09] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:29:09] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:29:09] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/430 variables, and 79 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:29:14] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:29:15] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:29:16] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:29:17] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:29:18] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:29:22] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:29:23] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:29:23] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:28] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:29:28] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 2 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:29:34] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:29:35] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:29:35] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 18/116 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:37] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:29:38] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:29:38] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:29:39] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:29:39] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:29:39] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:29:40] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 60579ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60591ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61824 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 27 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-06-01 06:29:40] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 06:29:40] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:29:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 06:29:40] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:29:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:29:40] [INFO ] After 17ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2024-06-01 06:29:41] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 2
[2024-06-01 06:29:41] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:29:41] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 373 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
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 170 transition count 595
Applied a total of 2 rules in 12 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-06-01 06:29:41] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:29:41] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:29:42] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 06:29:42] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:29:42] [INFO ] Invariant cache hit.
[2024-06-01 06:29:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:29:42] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1045 ms to find 0 implicit places.
[2024-06-01 06:29:42] [INFO ] Redundant transitions in 8 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:29:42] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:29:42] [INFO ] Invariant cache hit.
[2024-06-01 06:29:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:29:47] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:29:48] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:29:54] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:29:55] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:30:04] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:30:06] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:30:06] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:30:06] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:30:06] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:30:07] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:30:07] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:30:08] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:30:09] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:30:11] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:30:12] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2024-06-01 06:30:13] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
SMT process timed out in 30547ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31633 ms. Remains : 170/171 places, 595/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 270087 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((X(p0)||(!F(X(p1)) U p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 277 transition count 710
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 277 transition count 710
Applied a total of 6 rules in 11 ms. Remains 277 /280 variables (removed 3) and now considering 710/725 (removed 15) transitions.
[2024-06-01 06:30:13] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-06-01 06:30:13] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:30:14] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 06:30:14] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:30:14] [INFO ] Invariant cache hit.
[2024-06-01 06:30:14] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:30:15] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-06-01 06:30:15] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:30:15] [INFO ] Invariant cache hit.
[2024-06-01 06:30:15] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:30:22] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:30:23] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:30:24] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 88 places in 188 ms of which 4 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 2 ms to minimize.
[2024-06-01 06:30:25] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 76 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:30:26] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:30:27] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 4 ms to minimize.
[2024-06-01 06:30:27] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:30:27] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 4 ms to minimize.
[2024-06-01 06:30:27] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 4 ms to minimize.
[2024-06-01 06:30:28] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:30:29] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:30:29] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:30:30] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:30:30] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 4 ms to minimize.
[2024-06-01 06:30:30] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:30:30] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:30:31] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:30:32] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:30:33] [INFO ] Deduced a trap composed of 76 places in 238 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:30:38] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:30:39] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 4 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:30:40] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:30:41] [INFO ] Deduced a trap composed of 60 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:30:42] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:30:44] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:30:45] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:30:45] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 68 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:30:47] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:30:48] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:30:49] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 4 ms to minimize.
[2024-06-01 06:30:50] [INFO ] Deduced a trap composed of 60 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:30:50] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:30:50] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:30:52] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:30:53] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 72 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 4 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 57 places in 278 ms of which 5 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 72 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 4 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 56 places in 268 ms of which 3 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:31:05] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 4 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:31:06] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 80 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:31:07] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 113 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:31:08] [INFO ] Deduced a trap composed of 78 places in 242 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 4 ms to minimize.
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:31:10] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 49 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 4 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 4 ms to minimize.
[2024-06-01 06:31:13] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/652 variables, and 122 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 106/106 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 710/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61747 ms. Remains : 277/280 places, 710/725 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 33403 reset in 521 ms.
Product exploration explored 100000 steps with 33272 reset in 524 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 211 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 697 ms. (57 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 793 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 2/2 properties
[2024-06-01 06:31:18] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:31:18] [INFO ] Invariant cache hit.
[2024-06-01 06:31:18] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/536 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/540 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 112/652 variables, 94/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 63/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 90/536 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/540 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 112/652 variables, 94/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:31:19] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1357ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 575 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 42 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 173/277 places, 606/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 732 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 825 ms. (steps per millisecond=169 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 839 ms. (steps per millisecond=166 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 622 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-06-01 06:31:22] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:31:22] [INFO ] Invariant cache hit.
[2024-06-01 06:31:22] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 06:31:22] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:31:22] [INFO ] Invariant cache hit.
[2024-06-01 06:31:23] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:31:24] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-06-01 06:31:24] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:31:24] [INFO ] Invariant cache hit.
[2024-06-01 06:31:24] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:31:32] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:31:32] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:31:32] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:31:32] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:31:32] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:31:33] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 4 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 52 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 88 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:31:34] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 5 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 4 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 4 ms to minimize.
[2024-06-01 06:31:36] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 5 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 4 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 76 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 3 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 70 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 3 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 5 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:31:51] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:31:52] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:31:53] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:31:53] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 4 ms to minimize.
[2024-06-01 06:31:53] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:31:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 65 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:31:56] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:31:56] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:31:56] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 4 ms to minimize.
[2024-06-01 06:31:56] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 4 ms to minimize.
[2024-06-01 06:31:57] [INFO ] Deduced a trap composed of 82 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:31:58] [INFO ] Deduced a trap composed of 68 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:31:58] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:31:58] [INFO ] Deduced a trap composed of 50 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:31:58] [INFO ] Deduced a trap composed of 36 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:31:59] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:31:59] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:31:59] [INFO ] Deduced a trap composed of 59 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:31:59] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:32:00] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 4 ms to minimize.
[2024-06-01 06:32:00] [INFO ] Deduced a trap composed of 63 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:32:00] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 4 ms to minimize.
[2024-06-01 06:32:01] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 60 places in 263 ms of which 3 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:32:02] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:32:05] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 4 ms to minimize.
[2024-06-01 06:32:05] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:32:05] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:32:07] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 5 ms to minimize.
[2024-06-01 06:32:08] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:32:08] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:32:08] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:32:08] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 5 ms to minimize.
[2024-06-01 06:32:09] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:32:09] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:32:09] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 5 ms to minimize.
[2024-06-01 06:32:10] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:32:10] [INFO ] Deduced a trap composed of 75 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:32:10] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:32:10] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:32:10] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:32:11] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:32:11] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 2 ms to minimize.
[2024-06-01 06:32:11] [INFO ] Deduced a trap composed of 94 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:32:12] [INFO ] Deduced a trap composed of 97 places in 285 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:32:15] [INFO ] Deduced a trap composed of 61 places in 296 ms of which 5 ms to minimize.
[2024-06-01 06:32:15] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 4 ms to minimize.
[2024-06-01 06:32:17] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:32:21] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:32:23] [INFO ] Deduced a trap composed of 57 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:32:23] [INFO ] Deduced a trap composed of 70 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:32:24] [INFO ] Deduced a trap composed of 57 places in 316 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/652 variables, and 112 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 96/96 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in LTL mode , in 1 iterations and 61874 ms. Remains : 277/277 places, 710/710 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 1682 ms. (23 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
[2024-06-01 06:32:25] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:32:25] [INFO ] Invariant cache hit.
[2024-06-01 06:32:25] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/536 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/540 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 112/652 variables, 94/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/652 variables, 63/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/652 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/163 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/414 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 51/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/446 variables, 14/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 10/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 90/536 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/540 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 112/652 variables, 94/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/652 variables, 63/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:32:26] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/652 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/652 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 652/652 variables, and 420 constraints, problems are : Problem set: 0 solved, 2 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 277/277 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1575ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 804 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 710/710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 705
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 272 transition count 705
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 272 transition count 626
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 173 transition count 606
Applied a total of 208 rules in 40 ms. Remains 173 /277 variables (removed 104) and now considering 606/710 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 173/277 places, 606/710 transitions.
RANDOM walk for 40000 steps (8 resets) in 728 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 139660 steps, run visited all 2 properties in 725 ms. (steps per millisecond=192 )
Probabilistic random walk after 139660 steps, saw 37640 distinct states, run finished after 725 ms. (steps per millisecond=192 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 620 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 33213 reset in 277 ms.
Product exploration explored 100000 steps with 33247 reset in 431 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 277 transition count 710
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 277 transition count 818
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 277 transition count 818
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 277 transition count 818
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 272 transition count 813
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 114 rules in 88 ms. Remains 272 /277 variables (removed 5) and now considering 813/710 (removed -103) transitions.
[2024-06-01 06:32:31] [INFO ] Redundant transitions in 14 ms returned []
Running 808 sub problems to find dead transitions.
[2024-06-01 06:32:31] [INFO ] Flow matrix only has 424 transitions (discarded 389 similar events)
// Phase 1: matrix 424 rows 272 cols
[2024-06-01 06:32:31] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 06:32:31] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-01 06:32:40] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:32:40] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:32:40] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-06-01 06:32:41] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 4 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
[2024-06-01 06:32:42] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 5 ms to minimize.
[2024-06-01 06:32:43] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:32:43] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 5 ms to minimize.
[2024-06-01 06:32:43] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 4 ms to minimize.
[2024-06-01 06:32:44] [INFO ] Deduced a trap composed of 49 places in 319 ms of which 4 ms to minimize.
[2024-06-01 06:32:44] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/36 constraints. Problems are: Problem set: 207 solved, 601 unsolved
[2024-06-01 06:32:45] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 5 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:32:46] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:32:47] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:32:47] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 4 ms to minimize.
[2024-06-01 06:32:47] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 5 ms to minimize.
[2024-06-01 06:32:48] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 4 ms to minimize.
[2024-06-01 06:32:49] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 4 ms to minimize.
[2024-06-01 06:32:49] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:32:49] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 4 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:32:50] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:32:51] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 20/56 constraints. Problems are: Problem set: 207 solved, 601 unsolved
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 47 places in 309 ms of which 4 ms to minimize.
[2024-06-01 06:32:59] [INFO ] Deduced a trap composed of 47 places in 308 ms of which 4 ms to minimize.
[2024-06-01 06:33:00] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 4 ms to minimize.
[2024-06-01 06:33:00] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:33:00] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:33:01] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:33:01] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 5 ms to minimize.
[2024-06-01 06:33:01] [INFO ] Deduced a trap composed of 55 places in 317 ms of which 5 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 4 ms to minimize.
[2024-06-01 06:33:02] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 5 ms to minimize.
SMT process timed out in 30652ms, After SMT, problems are : Problem set: 207 solved, 601 unsolved
Search for dead transitions found 207 dead transitions in 30671ms
Found 207 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 207 transitions
Dead transitions reduction (with SMT) removed 207 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 272/277 places, 606/710 transitions.
Graph (complete) has 1446 edges and 272 vertex of which 173 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.6 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 173 /272 variables (removed 99) and now considering 606/606 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/277 places, 606/710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30823 ms. Remains : 173/277 places, 606/710 transitions.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 710/710 transitions.
Applied a total of 0 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2024-06-01 06:33:02] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-06-01 06:33:02] [INFO ] Computed 16 invariants in 4 ms
[2024-06-01 06:33:03] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-01 06:33:03] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:33:03] [INFO ] Invariant cache hit.
[2024-06-01 06:33:03] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:33:03] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-06-01 06:33:03] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-06-01 06:33:03] [INFO ] Invariant cache hit.
[2024-06-01 06:33:03] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-06-01 06:33:11] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 4 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:33:12] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:33:13] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 52 places in 277 ms of which 5 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 88 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:33:14] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 3 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 3 ms to minimize.
[2024-06-01 06:33:15] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:33:16] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:33:17] [INFO ] Deduced a trap composed of 68 places in 222 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:33:17] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:33:17] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:33:17] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:33:18] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:33:19] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:33:19] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:33:19] [INFO ] Deduced a trap composed of 83 places in 236 ms of which 4 ms to minimize.
[2024-06-01 06:33:19] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 4 ms to minimize.
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:33:20] [INFO ] Deduced a trap composed of 70 places in 238 ms of which 3 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:33:21] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:33:22] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 5 ms to minimize.
[2024-06-01 06:33:22] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 5 ms to minimize.
[2024-06-01 06:33:23] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 3 ms to minimize.
[2024-06-01 06:33:23] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:33:30] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:33:30] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:33:31] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:33:31] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:33:32] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:33:32] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:33:32] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:33:32] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:33:33] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/652 variables, and 65 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:33:35] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 4 ms to minimize.
[2024-06-01 06:33:36] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 82 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 68 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:33:37] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:33:38] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:33:39] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 4 ms to minimize.
[2024-06-01 06:33:40] [INFO ] Deduced a trap composed of 60 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:33:41] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:33:43] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:33:44] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:33:46] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 5 ms to minimize.
[2024-06-01 06:33:46] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 5 ms to minimize.
[2024-06-01 06:33:46] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 4 ms to minimize.
[2024-06-01 06:33:47] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:33:47] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:33:47] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:33:47] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:33:48] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:33:48] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 5 ms to minimize.
[2024-06-01 06:33:48] [INFO ] Deduced a trap composed of 75 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:33:48] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 4 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:33:49] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 5 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 94 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:33:50] [INFO ] Deduced a trap composed of 97 places in 268 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-06-01 06:33:53] [INFO ] Deduced a trap composed of 61 places in 316 ms of which 4 ms to minimize.
[2024-06-01 06:33:54] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 5 ms to minimize.
[2024-06-01 06:33:55] [INFO ] Deduced a trap composed of 56 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:33:59] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:34:01] [INFO ] Deduced a trap composed of 57 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:34:01] [INFO ] Deduced a trap composed of 70 places in 233 ms of which 4 ms to minimize.
[2024-06-01 06:34:02] [INFO ] Deduced a trap composed of 57 places in 294 ms of which 4 ms to minimize.
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:34:03] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:34:04] [INFO ] Deduced a trap composed of 60 places in 283 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/652 variables, and 115 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/277 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/705 constraints, Known Traps: 99/99 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Finished structural reductions in LTL mode , in 1 iterations and 61658 ms. Remains : 277/277 places, 710/710 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 230620 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 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 52 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-06-01 06:34:04] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:34:04] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:34:04] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-06-01 06:34:04] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:34:04] [INFO ] Invariant cache hit.
[2024-06-01 06:34:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:34:05] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2024-06-01 06:34:05] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:34:05] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:34:05] [INFO ] Invariant cache hit.
[2024-06-01 06:34:05] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:34:10] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:34:11] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:34:12] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:34:14] [INFO ] Deduced a trap composed of 60 places in 204 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:34:14] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:34:17] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:34:17] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:34:27] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:34:28] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 2 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:34:29] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:34:30] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:34:31] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:34:34] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:34:35] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 3 ms to minimize.
SMT process timed out in 30417ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30428ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31597 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 244 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-09 finished in 31929 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(p1)||p0))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 58 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-06-01 06:34:36] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-06-01 06:34:36] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:34:36] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-06-01 06:34:36] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-06-01 06:34:36] [INFO ] Invariant cache hit.
[2024-06-01 06:34:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 06:34:37] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2024-06-01 06:34:37] [INFO ] Redundant transitions in 8 ms returned []
Running 595 sub problems to find dead transitions.
[2024-06-01 06:34:37] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-06-01 06:34:37] [INFO ] Invariant cache hit.
[2024-06-01 06:34:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:34:42] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:34:43] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:34:44] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:34:45] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:34:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:34:47] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:34:48] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:34:49] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:34:50] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:34:51] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:34:56] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:34:57] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:34:57] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:34:57] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:34:58] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:34:58] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:34:58] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:34:59] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:35:00] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/436 variables, and 92 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:35:13] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:20] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:35:21] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:35:21] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:35:27] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:35:28] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:35:28] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:35:28] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:35:32] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:35:36] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:35:36] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:35:36] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/436 variables, and 146 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/595 constraints, Known Traps: 130/130 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61673 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 201 ms.
Product exploration explored 100000 steps with 0 reset in 302 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 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 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 346 ms. (115 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2024-06-01 06:35:39] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-06-01 06:35:39] [INFO ] Invariant cache hit.
[2024-06-01 06:35:39] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/68 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/98 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/105 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 177/282 variables, 105/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 47/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/314 variables, 14/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 12/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/362 variables, 4/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/366 variables, 2/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 70/436 variables, 52/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/436 variables, 61/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/436 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 307 constraints, problems are : Problem set: 1 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 22/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 15/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 73/320 variables, 6/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/326 variables, 3/146 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/326 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:35:39] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:35:40] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/326 variables, 6/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/436 variables, 79/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 83/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/436 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 315 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1667ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 22 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-10 finished in 64522 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 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 275 transition count 640
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 195 transition count 640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 174 place count 191 transition count 620
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 600
Applied a total of 218 rules in 55 ms. Remains 171 /280 variables (removed 109) and now considering 600/725 (removed 125) transitions.
[2024-06-01 06:35:40] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
// Phase 1: matrix 265 rows 171 cols
[2024-06-01 06:35:40] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:35:41] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-06-01 06:35:41] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-06-01 06:35:41] [INFO ] Invariant cache hit.
[2024-06-01 06:35:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 06:35:42] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2024-06-01 06:35:42] [INFO ] Redundant transitions in 8 ms returned []
Running 595 sub problems to find dead transitions.
[2024-06-01 06:35:42] [INFO ] Flow matrix only has 265 transitions (discarded 335 similar events)
[2024-06-01 06:35:42] [INFO ] Invariant cache hit.
[2024-06-01 06:35:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:46] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:35:47] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:35:47] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:35:47] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:35:47] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:35:47] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:35:48] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:35:54] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:35:55] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:35:56] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:36:04] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:36:04] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2024-06-01 06:36:05] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:36:06] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:36:06] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:36:06] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2024-06-01 06:36:08] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:36:08] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:36:08] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:36:08] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:36:09] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
SMT process timed out in 30478ms, After SMT, problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 30490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 600/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31777 ms. Remains : 171/280 places, 600/725 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 10 reset in 252 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-11 finished in 32111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 50 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-06-01 06:36:12] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:36:12] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 06:36:13] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 06:36:13] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:36:13] [INFO ] Invariant cache hit.
[2024-06-01 06:36:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:36:14] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2024-06-01 06:36:14] [INFO ] Redundant transitions in 7 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:36:14] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:36:14] [INFO ] Invariant cache hit.
[2024-06-01 06:36:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:36:19] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:36:19] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:36:19] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:36:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:36:19] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:36:21] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:36:22] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:36:22] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:36:22] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:36:22] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:36:24] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:36:24] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:36:24] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:36:25] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:36:27] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:36:27] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:36:28] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:36:35] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 4 ms to minimize.
[2024-06-01 06:36:36] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:36:43] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:36:43] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 76 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:36:46] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:36:47] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:36:47] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:36:47] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:36:48] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:36:48] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 3 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:36:56] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:36:58] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:37:05] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 3 ms to minimize.
[2024-06-01 06:37:05] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:37:05] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:37:06] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:37:06] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
SMT process timed out in 60535ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61731 ms. Remains : 171/280 places, 596/725 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 301 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-12 finished in 62119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (G(p1)||!p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 11 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-06-01 06:37:15] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-06-01 06:37:15] [INFO ] Computed 16 invariants in 9 ms
[2024-06-01 06:37:15] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-01 06:37:15] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:37:15] [INFO ] Invariant cache hit.
[2024-06-01 06:37:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:37:16] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:37:16] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:37:16] [INFO ] Invariant cache hit.
[2024-06-01 06:37:16] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 49 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 72 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 4 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 4 ms to minimize.
[2024-06-01 06:37:26] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 5 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:37:27] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:37:28] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 4 ms to minimize.
[2024-06-01 06:37:28] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 3 ms to minimize.
[2024-06-01 06:37:28] [INFO ] Deduced a trap composed of 54 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:37:29] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:37:29] [INFO ] Deduced a trap composed of 66 places in 289 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 57 places in 291 ms of which 5 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 4 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 4 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 80 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:37:32] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 3 ms to minimize.
[2024-06-01 06:37:33] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:37:33] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 4 ms to minimize.
[2024-06-01 06:37:33] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 4 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:37:34] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:37:35] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:37:43] [INFO ] Deduced a trap composed of 77 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:37:44] [INFO ] Deduced a trap composed of 86 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:37:44] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:37:44] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 4 ms to minimize.
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 56 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 61 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 5 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 3 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 36 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 30481ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30495ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32094 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-13 finished in 32331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 275 transition count 700
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 275 transition count 700
Applied a total of 10 rules in 16 ms. Remains 275 /280 variables (removed 5) and now considering 700/725 (removed 25) transitions.
[2024-06-01 06:37:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:37:47] [INFO ] Invariant cache hit.
[2024-06-01 06:37:47] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 06:37:47] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:37:47] [INFO ] Invariant cache hit.
[2024-06-01 06:37:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:37:49] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:37:49] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:37:49] [INFO ] Invariant cache hit.
[2024-06-01 06:37:49] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:37:56] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:37:56] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:37:57] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:37:57] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 5 ms to minimize.
[2024-06-01 06:37:57] [INFO ] Deduced a trap composed of 49 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:37:57] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:37:58] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:37:58] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:37:58] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:37:58] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:37:58] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 5 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 4 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:38:02] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:38:02] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:38:02] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 67 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:38:04] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:38:04] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:38:04] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:38:04] [INFO ] Deduced a trap composed of 63 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:38:05] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 77 places in 275 ms of which 5 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 86 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 71 places in 237 ms of which 4 ms to minimize.
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 56 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:38:14] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:38:14] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:38:14] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:38:14] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 4 ms to minimize.
[2024-06-01 06:38:15] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:38:16] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:38:16] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:38:17] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 4 ms to minimize.
[2024-06-01 06:38:18] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 4 ms to minimize.
[2024-06-01 06:38:18] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 4 ms to minimize.
[2024-06-01 06:38:18] [INFO ] Deduced a trap composed of 59 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:38:19] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 76 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:38:21] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:38:22] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:38:22] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:38:22] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:38:22] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:38:23] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:38:23] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:38:23] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:38:23] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 4 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 3 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 63 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 71 places in 302 ms of which 5 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 78 places in 301 ms of which 5 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 44 places in 317 ms of which 5 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 61 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:38:27] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 5 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:38:33] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 39 places in 254 ms of which 4 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 98 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 4 ms to minimize.
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 86 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 72 places in 288 ms of which 4 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 57 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 5 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 59 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:38:42] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:38:49] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 3 ms to minimize.
SMT process timed out in 60505ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Starting structural reductions in LTL mode, iteration 1 : 275/280 places, 700/725 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62175 ms. Remains : 275/280 places, 700/725 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 247 ms.
Product exploration explored 100000 steps with 0 reset in 325 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 6 ms. (steps per millisecond=36 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 6 ms. (steps per millisecond=36 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 5 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-06-01 06:38:51] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:38:51] [INFO ] Invariant cache hit.
[2024-06-01 06:38:51] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-01 06:38:51] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:38:51] [INFO ] Invariant cache hit.
[2024-06-01 06:38:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:38:52] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:38:52] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:38:52] [INFO ] Invariant cache hit.
[2024-06-01 06:38:52] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 4 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 4 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:39:02] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:39:02] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 4 ms to minimize.
[2024-06-01 06:39:02] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:39:02] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:39:03] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 5 ms to minimize.
[2024-06-01 06:39:03] [INFO ] Deduced a trap composed of 51 places in 294 ms of which 5 ms to minimize.
[2024-06-01 06:39:04] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:39:04] [INFO ] Deduced a trap composed of 60 places in 294 ms of which 5 ms to minimize.
[2024-06-01 06:39:04] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 3 ms to minimize.
[2024-06-01 06:39:04] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:39:05] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:39:06] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 5 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 80 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 4 ms to minimize.
[2024-06-01 06:39:09] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:39:09] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 4 ms to minimize.
[2024-06-01 06:39:09] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 4 ms to minimize.
[2024-06-01 06:39:09] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:39:10] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:39:11] [INFO ] Deduced a trap composed of 64 places in 319 ms of which 5 ms to minimize.
[2024-06-01 06:39:11] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:39:19] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 4 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 86 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 71 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:39:20] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 4 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 61 places in 265 ms of which 5 ms to minimize.
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 3 ms to minimize.
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:39:22] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
SMT process timed out in 30425ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30438ms
Finished structural reductions in LTL mode , in 1 iterations and 32044 ms. Remains : 275/275 places, 700/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 218 steps, run visited all 1 properties in 8 ms. (steps per millisecond=27 )
Probabilistic random walk after 218 steps, saw 184 distinct states, run finished after 9 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 256 ms.
Product exploration explored 100000 steps with 0 reset in 310 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 700
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 5 place count 275 transition count 808
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 79 place count 275 transition count 808
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 104 place count 275 transition count 808
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 270 transition count 803
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 270 transition count 803
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 114 rules in 62 ms. Remains 270 /275 variables (removed 5) and now considering 803/700 (removed -103) transitions.
[2024-06-01 06:39:25] [INFO ] Redundant transitions in 13 ms returned []
Running 798 sub problems to find dead transitions.
[2024-06-01 06:39:25] [INFO ] Flow matrix only has 414 transitions (discarded 389 similar events)
// Phase 1: matrix 414 rows 270 cols
[2024-06-01 06:39:25] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:39:25] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 798 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 798 unsolved
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 06:39:34] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:39:35] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:39:36] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD801 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/36 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 3 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 4 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 5 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 4 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 4 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 20/56 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-06-01 06:39:48] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 4 ms to minimize.
[2024-06-01 06:39:48] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:39:48] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 4 ms to minimize.
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 3 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 4 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 4 ms to minimize.
[2024-06-01 06:39:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:39:53] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:39:53] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:39:53] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 5 ms to minimize.
[2024-06-01 06:39:54] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:39:55] [INFO ] Deduced a trap composed of 56 places in 338 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/684 variables, and 71 constraints, problems are : Problem set: 207 solved, 591 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/270 constraints, ReadFeed: 0/184 constraints, PredecessorRefiner: 798/798 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 207 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 1/1 constraints. Problems are: Problem set: 207 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 55/56 constraints. Problems are: Problem set: 207 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/56 constraints. Problems are: Problem set: 207 solved, 591 unsolved
At refinement iteration 3 (OVERLAPS) 99/270 variables, 10/66 constraints. Problems are: Problem set: 207 solved, 591 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 5/71 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-06-01 06:40:02] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 4 ms to minimize.
[2024-06-01 06:40:03] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:40:03] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 4 ms to minimize.
[2024-06-01 06:40:04] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 4 ms to minimize.
[2024-06-01 06:40:04] [INFO ] Deduced a trap composed of 53 places in 334 ms of which 4 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 5 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 5 ms to minimize.
[2024-06-01 06:40:05] [INFO ] Deduced a trap composed of 48 places in 353 ms of which 4 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 43 places in 274 ms of which 5 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 4 ms to minimize.
[2024-06-01 06:40:06] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:40:07] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:40:08] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:40:08] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 4 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 4 ms to minimize.
[2024-06-01 06:40:09] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 4 ms to minimize.
[2024-06-01 06:40:10] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 20/91 constraints. Problems are: Problem set: 207 solved, 591 unsolved
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 4 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 4 ms to minimize.
[2024-06-01 06:40:15] [INFO ] Deduced a trap composed of 57 places in 306 ms of which 5 ms to minimize.
[2024-06-01 06:40:16] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 4 ms to minimize.
[2024-06-01 06:40:16] [INFO ] Deduced a trap composed of 43 places in 295 ms of which 5 ms to minimize.
[2024-06-01 06:40:16] [INFO ] Deduced a trap composed of 60 places in 296 ms of which 5 ms to minimize.
[2024-06-01 06:40:17] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 5 ms to minimize.
[2024-06-01 06:40:17] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 5 ms to minimize.
[2024-06-01 06:40:17] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 5 ms to minimize.
[2024-06-01 06:40:18] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:40:19] [INFO ] Deduced a trap composed of 42 places in 257 ms of which 4 ms to minimize.
[2024-06-01 06:40:19] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:40:20] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 3 ms to minimize.
[2024-06-01 06:40:21] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 4 ms to minimize.
[2024-06-01 06:40:21] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 4 ms to minimize.
[2024-06-01 06:40:21] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 4 ms to minimize.
[2024-06-01 06:40:22] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 18/109 constraints. Problems are: Problem set: 207 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/684 variables, and 109 constraints, problems are : Problem set: 207 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/270 constraints, ReadFeed: 0/184 constraints, PredecessorRefiner: 0/798 constraints, Known Traps: 93/93 constraints]
After SMT, in 60512ms problems are : Problem set: 207 solved, 591 unsolved
Search for dead transitions found 207 dead transitions in 60527ms
Found 207 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 207 transitions
Dead transitions reduction (with SMT) removed 207 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 270/275 places, 596/700 transitions.
Graph (complete) has 1426 edges and 270 vertex of which 171 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.2 ms
Discarding 99 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 171 /270 variables (removed 99) and now considering 596/596 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60634 ms. Remains : 171/275 places, 596/700 transitions.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Applied a total of 0 rules in 5 ms. Remains 275 /275 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-06-01 06:40:25] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-06-01 06:40:25] [INFO ] Computed 16 invariants in 3 ms
[2024-06-01 06:40:26] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-01 06:40:26] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:40:26] [INFO ] Invariant cache hit.
[2024-06-01 06:40:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:40:27] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-06-01 06:40:27] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-06-01 06:40:27] [INFO ] Invariant cache hit.
[2024-06-01 06:40:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 4 ms to minimize.
[2024-06-01 06:40:35] [INFO ] Deduced a trap composed of 72 places in 222 ms of which 4 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 3 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:40:36] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-06-01 06:40:37] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:40:37] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 4 ms to minimize.
[2024-06-01 06:40:38] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 4 ms to minimize.
[2024-06-01 06:40:38] [INFO ] Deduced a trap composed of 72 places in 234 ms of which 4 ms to minimize.
[2024-06-01 06:40:38] [INFO ] Deduced a trap composed of 60 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:40:38] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 4 ms to minimize.
[2024-06-01 06:40:39] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 4 ms to minimize.
[2024-06-01 06:40:39] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:40:39] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:40:40] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:40:40] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 5 ms to minimize.
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 4 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 5 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 80 places in 262 ms of which 4 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 4 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 4 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 66 places in 275 ms of which 4 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 65 places in 274 ms of which 4 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 4 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:40:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 64 places in 316 ms of which 5 ms to minimize.
[2024-06-01 06:40:46] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-06-01 06:40:54] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 4 ms to minimize.
[2024-06-01 06:40:54] [INFO ] Deduced a trap composed of 86 places in 278 ms of which 4 ms to minimize.
[2024-06-01 06:40:54] [INFO ] Deduced a trap composed of 71 places in 229 ms of which 3 ms to minimize.
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 56 places in 267 ms of which 4 ms to minimize.
[2024-06-01 06:40:55] [INFO ] Deduced a trap composed of 54 places in 245 ms of which 4 ms to minimize.
[2024-06-01 06:40:56] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 4 ms to minimize.
[2024-06-01 06:40:56] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:40:56] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2024-06-01 06:40:57] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 4 ms to minimize.
[2024-06-01 06:40:57] [INFO ] Deduced a trap composed of 36 places in 264 ms of which 4 ms to minimize.
[2024-06-01 06:40:57] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 4 ms to minimize.
SMT process timed out in 30365ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30378ms
Finished structural reductions in LTL mode , in 1 iterations and 31929 ms. Remains : 275/275 places, 700/700 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 190378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||G(p2)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-06
Stuttering acceptance computed with spot in 248 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 43 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-06-01 06:40:58] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:40:58] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:40:58] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 06:40:58] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:40:58] [INFO ] Invariant cache hit.
[2024-06-01 06:40:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:40:59] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 06:40:59] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:40:59] [INFO ] Invariant cache hit.
[2024-06-01 06:40:59] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:41:03] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:41:03] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:41:03] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:41:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 2 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:41:05] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:41:06] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:41:08] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:41:09] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:41:10] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:41:11] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:41:12] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:41:12] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:41:12] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:41:12] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:41:12] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:41:19] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:41:20] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 3 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:41:22] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:41:26] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2024-06-01 06:41:27] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
SMT process timed out in 30448ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30460ms
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31720 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 278 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 p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 209 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 616686 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 616686 steps, saw 121755 distinct states, run finished after 3003 ms. (steps per millisecond=205 ) properties seen :0
[2024-06-01 06:41:33] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:41:33] [INFO ] Invariant cache hit.
[2024-06-01 06:41:33] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:35] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1375ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
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 170 transition count 595
Applied a total of 2 rules in 23 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 672618 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 672618 steps, saw 131888 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2024-06-01 06:41:38] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:41:38] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 06:41:38] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:41:38] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 06:41:39] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:41:39] [INFO ] Invariant cache hit.
[2024-06-01 06:41:39] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 06:41:39] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:41:39] [INFO ] Invariant cache hit.
[2024-06-01 06:41:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:41:40] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2024-06-01 06:41:40] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:41:40] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:41:40] [INFO ] Invariant cache hit.
[2024-06-01 06:41:40] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:41:47] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:41:50] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:42:10] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 30419ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31603 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 27 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-06-01 06:42:11] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 06:42:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:42:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:42:11] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:42:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:42:11] [INFO ] After 21ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:42:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 114 ms
TRAPS : Iteration 1
[2024-06-01 06:42:11] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:42:11] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 401 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2)]
Support contains 3 out of 171 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 16 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-06-01 06:42:11] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:42:11] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 06:42:12] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 06:42:12] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:42:12] [INFO ] Invariant cache hit.
[2024-06-01 06:42:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:42:13] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2024-06-01 06:42:13] [INFO ] Redundant transitions in 7 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:42:13] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:42:13] [INFO ] Invariant cache hit.
[2024-06-01 06:42:13] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:42:18] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:42:19] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:42:20] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:42:21] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:42:22] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 74 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:42:26] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:42:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:42:34] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:42:35] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:42:36] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:42:36] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:42:36] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:42:36] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:42:37] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:42:37] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:42:37] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:42:38] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:42:38] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
SMT process timed out in 30402ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 30413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31644 ms. Remains : 171/171 places, 596/596 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 780852 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 1
Probabilistic random walk after 780852 steps, saw 150923 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
[2024-06-01 06:42:46] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:42:46] [INFO ] Invariant cache hit.
[2024-06-01 06:42:46] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/201 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/249 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/321 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/327 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/432 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/432 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 129/201 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/249 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/321 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/327 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/432 variables, 78/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 18 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 818148 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 1
Probabilistic random walk after 818148 steps, saw 157251 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-06-01 06:42:50] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:42:50] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 06:42:50] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 128/199 variables, 71/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/247 variables, 21/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/319 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/325 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/430 variables, 78/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 80/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/430 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/430 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/430 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/430 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1331ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 06:42:52] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:42:52] [INFO ] Invariant cache hit.
[2024-06-01 06:42:52] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-06-01 06:42:52] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:42:52] [INFO ] Invariant cache hit.
[2024-06-01 06:42:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:42:53] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2024-06-01 06:42:53] [INFO ] Redundant transitions in 8 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:42:53] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:42:53] [INFO ] Invariant cache hit.
[2024-06-01 06:42:53] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:43:02] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:43:07] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:43:07] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:43:07] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:43:07] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:43:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:43:08] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:43:08] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:12] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:43:16] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:43:18] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:23] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:43:23] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:43:23] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 30370ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31679 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 172 place count 62 transition count 117
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 190 place count 62 transition count 99
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 210 place count 52 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 215 place count 52 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 248 place count 51 transition count 162
Applied a total of 248 rules in 24 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-06-01 06:43:24] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 06:43:24] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:43:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:43:24] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:43:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:43:24] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 108 ms
TRAPS : Iteration 1
[2024-06-01 06:43:24] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:43:24] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 405 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Product exploration explored 100000 steps with 0 reset in 276 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 19 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
[2024-06-01 06:43:25] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:43:25] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:43:25] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-06-01 06:43:25] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:43:25] [INFO ] Invariant cache hit.
[2024-06-01 06:43:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:43:26] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2024-06-01 06:43:26] [INFO ] Redundant transitions in 7 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:43:26] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:43:26] [INFO ] Invariant cache hit.
[2024-06-01 06:43:26] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-06-01 06:43:31] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:43:37] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:43:38] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:43:38] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:43:38] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:43:39] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:43:39] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:43:39] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:43:39] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:43:40] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 2 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:43:56] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:43:57] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 3 ms to minimize.
SMT process timed out in 30586ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30598ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/171 places, 595/596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31915 ms. Remains : 170/171 places, 595/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-06 finished in 179494 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((X(p0)||(!F(X(p1)) U p2))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-07
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 171 place count 193 transition count 626
Iterating global reduction 2 with 3 rules applied. Total rules applied 174 place count 193 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 214 place count 173 transition count 606
Applied a total of 214 rules in 36 ms. Remains 173 /280 variables (removed 107) and now considering 606/725 (removed 119) transitions.
[2024-06-01 06:43:57] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
// Phase 1: matrix 271 rows 173 cols
[2024-06-01 06:43:57] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:43:58] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-06-01 06:43:58] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:43:58] [INFO ] Invariant cache hit.
[2024-06-01 06:43:58] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:43:58] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-06-01 06:43:58] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:43:58] [INFO ] Invariant cache hit.
[2024-06-01 06:43:58] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:44:04] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:44:04] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:44:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:44:04] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 2 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:44:07] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:44:07] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:44:07] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:44:10] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:44:11] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:44:12] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:44:23] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:44:23] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:44:24] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:44:25] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:44:25] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 63 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:33] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:44:34] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:44:35] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:44:35] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:44:35] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:44:35] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:44:35] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:44:37] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:44:37] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:44:37] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:44:37] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:39] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:44:39] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:44:39] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:44:39] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:44:39] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:44:40] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:44:40] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:44:40] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:44:41] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:44:41] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:44:42] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:44:42] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:44:42] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 2 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:44:48] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:44:49] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:44:49] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:44:49] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:44:50] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:44:50] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:44:52] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:44:54] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:44:58] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:44:58] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 125 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 109/109 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Starting structural reductions in LI_LTL mode, iteration 1 : 173/280 places, 606/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61728 ms. Remains : 173/280 places, 606/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 33325 reset in 359 ms.
Product exploration explored 100000 steps with 33456 reset in 372 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 161 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 210 ms. (189 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
[2024-06-01 06:45:00] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:45:00] [INFO ] Invariant cache hit.
[2024-06-01 06:45:00] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 183/290 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 51/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/322 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 48/370 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/374 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 70/444 variables, 52/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 61/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:01] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/290 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 51/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/322 variables, 14/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/370 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/374 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:01] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 70/444 variables, 52/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 61/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:02] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/444 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:45:02] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/444 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 319 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1653ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 574 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 17 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 173/173 places, 606/606 transitions.
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8416 steps, run visited all 1 properties in 55 ms. (steps per millisecond=153 )
Probabilistic random walk after 8416 steps, saw 4945 distinct states, run finished after 55 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 659 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-06-01 06:45:04] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 06:45:04] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:04] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:45:05] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-06-01 06:45:05] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:45:05] [INFO ] Invariant cache hit.
[2024-06-01 06:45:05] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 2 ms to minimize.
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:45:16] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:45:16] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:45:17] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:45:17] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 44 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:45:29] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 63 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 4 ms to minimize.
[2024-06-01 06:45:41] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:45:41] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:45:41] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:45:41] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 4 ms to minimize.
[2024-06-01 06:45:41] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:45:42] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:45:42] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:45:42] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:45:43] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:45:43] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:45:43] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:45:43] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 4 ms to minimize.
[2024-06-01 06:45:43] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 4 ms to minimize.
[2024-06-01 06:45:44] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:45:44] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:45:44] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:45:48] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:45:48] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:45:48] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:45:49] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:45:50] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:45:51] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:45:51] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:45:51] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:45:52] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:45:53] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:45:55] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:45:55] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:45:55] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:45:56] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:45:57] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:45:58] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:45:59] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:46:00] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:46:04] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:46:05] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 125 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 109/109 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Finished structural reductions in LTL mode , in 1 iterations and 61617 ms. Remains : 173/173 places, 606/606 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 p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 206 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
RANDOM walk for 40000 steps (8 resets) in 2994 ms. (13 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2024-06-01 06:46:07] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:46:07] [INFO ] Invariant cache hit.
[2024-06-01 06:46:07] [INFO ] State equation strengthened by 124 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 183/290 variables, 107/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 51/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 32/322 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 48/370 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/374 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 70/444 variables, 52/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/444 variables, 61/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/444 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/290 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 51/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/322 variables, 14/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/370 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/374 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 70/444 variables, 52/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 61/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/444 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/444 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/444 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/444 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 319 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1373ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 645 ms.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 21 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 173/173 places, 606/606 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8416 steps, run visited all 1 properties in 57 ms. (steps per millisecond=147 )
Probabilistic random walk after 8416 steps, saw 4945 distinct states, run finished after 57 ms. (steps per millisecond=147 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0 p1))), (F p1)]
Knowledge based reduction with 11 factoid took 644 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 33289 reset in 267 ms.
Product exploration explored 100000 steps with 33265 reset in 248 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (OR (NOT p2) p1)]
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 17 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-06-01 06:46:11] [INFO ] Redundant transitions in 8 ms returned []
Running 601 sub problems to find dead transitions.
[2024-06-01 06:46:11] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:46:11] [INFO ] Invariant cache hit.
[2024-06-01 06:46:11] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-06-01 06:46:17] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:46:17] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:46:17] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 2 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:46:22] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:46:22] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 2 ms to minimize.
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:46:35] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:46:35] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:46:36] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 63 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-06-01 06:46:48] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:46:49] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:46:50] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:46:52] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:46:53] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:46:53] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:46:53] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:46:55] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:46:55] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:46:55] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:46:56] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:46:57] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 2 ms to minimize.
[2024-06-01 06:46:57] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:46:57] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:46:57] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:46:58] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:47:00] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 4 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 4 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 125 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 109/109 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60427 ms. Remains : 173/173 places, 606/606 transitions.
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 606/606 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-06-01 06:47:12] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:47:12] [INFO ] Invariant cache hit.
[2024-06-01 06:47:12] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 06:47:12] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:47:12] [INFO ] Invariant cache hit.
[2024-06-01 06:47:12] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-06-01 06:47:13] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-06-01 06:47:13] [INFO ] Flow matrix only has 271 transitions (discarded 335 similar events)
[2024-06-01 06:47:13] [INFO ] Invariant cache hit.
[2024-06-01 06:47:13] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:18] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:47:18] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:47:18] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:47:18] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:47:19] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:47:19] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:47:19] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:47:19] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 3 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:47:24] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 4 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:47:28] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:37] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:47:37] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 3 ms to minimize.
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 3 ms to minimize.
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/444 variables, and 63 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:48] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 4 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 2 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2024-06-01 06:47:51] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:47:51] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:47:51] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:47:51] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2024-06-01 06:47:53] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:47:56] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:47:56] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:47:57] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:47:57] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:47:58] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:47:58] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:48:00] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:48:00] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:48:03] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:48:03] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:48:05] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:48:05] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-06-01 06:48:06] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:48:06] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:48:06] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 2 ms to minimize.
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:48:07] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:48:08] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/444 variables, and 125 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/173 constraints, ReadFeed: 0/124 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 109/109 constraints]
After SMT, in 60396ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in LTL mode , in 1 iterations and 61712 ms. Remains : 173/173 places, 606/606 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 256785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-15
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 725/725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 280 transition count 720
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 275 transition count 720
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 275 transition count 641
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 196 transition count 641
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 191 transition count 616
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 171 transition count 596
Applied a total of 218 rules in 30 ms. Remains 171 /280 variables (removed 109) and now considering 596/725 (removed 129) transitions.
[2024-06-01 06:48:14] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:48:14] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:48:14] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 06:48:14] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:48:14] [INFO ] Invariant cache hit.
[2024-06-01 06:48:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:48:15] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 06:48:15] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:48:15] [INFO ] Invariant cache hit.
[2024-06-01 06:48:15] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:48:20] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:48:21] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:48:21] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:48:21] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:48:21] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:48:23] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:48:23] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:48:23] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:48:23] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:48:23] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:48:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:48:25] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:48:25] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:48:26] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:48:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:48:26] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:48:27] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:48:27] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 2 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 2 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:48:39] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:48:44] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:48:44] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 65 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:48:48] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:48:50] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:48:50] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:48:51] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:48:51] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:48:51] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:48:51] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 2 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:48:58] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:48:58] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:48:58] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:48:59] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:48:59] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:48:59] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:49:03] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:49:03] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:49:05] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:49:05] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:49:10] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:49:11] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:49:12] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:49:12] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 108 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 92/92 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in LI_LTL mode, iteration 1 : 171/280 places, 596/725 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61667 ms. Remains : 171/280 places, 596/725 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 5 ms. (steps per millisecond=22 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 5 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-06-01 06:49:17] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:49:17] [INFO ] Invariant cache hit.
[2024-06-01 06:49:17] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 06:49:17] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:49:17] [INFO ] Invariant cache hit.
[2024-06-01 06:49:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:49:18] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 06:49:18] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:49:18] [INFO ] Invariant cache hit.
[2024-06-01 06:49:18] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:49:25] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:49:25] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:49:25] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:49:25] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:49:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:49:25] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 2 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 2 ms to minimize.
[2024-06-01 06:49:26] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:49:30] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:49:30] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:49:32] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:49:32] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:49:32] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:49:32] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 4 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:49:33] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:49:35] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 2 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:49:46] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:49:46] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:49:47] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 65 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:49:51] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 3 ms to minimize.
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:49:55] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:49:56] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:49:57] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:01] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:50:01] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:50:02] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:50:02] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:50:02] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:50:02] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:50:03] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:50:04] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:50:05] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 2 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:12] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:50:13] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 108 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 92/92 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Finished structural reductions in LTL mode , in 1 iterations and 61666 ms. Remains : 171/171 places, 596/596 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 5 ms. (steps per millisecond=22 )
Probabilistic random walk after 110 steps, saw 94 distinct states, run finished after 5 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 0 reset in 288 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 16 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-06-01 06:50:21] [INFO ] Redundant transitions in 7 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:50:21] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:50:21] [INFO ] Invariant cache hit.
[2024-06-01 06:50:21] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 2 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 2 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:50:32] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:50:34] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:50:34] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 65 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:50:53] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:50:55] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:50:56] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 61 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 2 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:03] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:51:03] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 3 ms to minimize.
[2024-06-01 06:51:06] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:51:06] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:51:06] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 55 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:51:08] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:15] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 3 ms to minimize.
[2024-06-01 06:51:15] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:51:15] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:51:15] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:51:16] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:51:18] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 108 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 92/92 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60448 ms. Remains : 171/171 places, 596/596 transitions.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-06-01 06:51:21] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:51:21] [INFO ] Invariant cache hit.
[2024-06-01 06:51:21] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 06:51:21] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:51:21] [INFO ] Invariant cache hit.
[2024-06-01 06:51:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:51:22] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2024-06-01 06:51:22] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:51:22] [INFO ] Invariant cache hit.
[2024-06-01 06:51:22] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:51:32] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2024-06-01 06:51:33] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:51:33] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:51:33] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 2 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:51:39] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:51] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:51:51] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 65 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:51:55] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:51:57] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:51:57] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:51:57] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:52:04] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 2 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 2 ms to minimize.
[2024-06-01 06:52:05] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:52:06] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:52:06] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:52:06] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 2 ms to minimize.
[2024-06-01 06:52:07] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:52:07] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:52:07] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:52:07] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:52:08] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:52:11] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 3 ms to minimize.
[2024-06-01 06:52:12] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:52:16] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 3 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 2 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 108 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 92/92 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in LTL mode , in 1 iterations and 61560 ms. Remains : 171/171 places, 596/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 249114 ms.
[2024-06-01 06:52:23] [INFO ] Flatten gal took : 71 ms
[2024-06-01 06:52:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 06:52:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 725 transitions and 3300 arcs took 15 ms.
Total runtime 1900595 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA EisenbergMcGuire-PT-05-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-05-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-05-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717225331661
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ltl formula name EisenbergMcGuire-PT-05-LTLFireability-06
ltl formula formula --ltl=/tmp/11870/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 280 places, 725 transitions and 3300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.050 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11870/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11870/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11870/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11870/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 923 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1601 levels ~10000 states ~126444 transitions
pnml2lts-mc( 2/ 4): ~3059 levels ~20000 states ~258684 transitions
pnml2lts-mc( 2/ 4): ~6077 levels ~40000 states ~522084 transitions
pnml2lts-mc( 2/ 4): ~11516 levels ~80000 states ~1059744 transitions
pnml2lts-mc( 2/ 4): ~21086 levels ~160000 states ~2146104 transitions
pnml2lts-mc( 2/ 4): ~33915 levels ~320000 states ~4342364 transitions
pnml2lts-mc( 2/ 4): ~57596 levels ~640000 states ~8753844 transitions
pnml2lts-mc( 3/ 4): ~61048 levels ~1280000 states ~17947624 transitions
pnml2lts-mc( 3/ 4): ~69505 levels ~2560000 states ~34191724 transitions
pnml2lts-mc( 3/ 4): ~81660 levels ~5120000 states ~68670604 transitions
pnml2lts-mc( 3/ 4): ~90727 levels ~10240000 states ~135957944 transitions
pnml2lts-mc( 3/ 4): ~97896 levels ~20480000 states ~275156764 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 33550462
pnml2lts-mc( 0/ 4): unique transitions count: 450811980
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 415236733
pnml2lts-mc( 0/ 4): - claim success count: 33566503
pnml2lts-mc( 0/ 4): - cum. max stack depth: 456949
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33595627 states 451431831 transitions, fanout: 13.437
pnml2lts-mc( 0/ 4): Total exploration time 580.410 sec (580.340 sec minimum, 580.375 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57883, Transitions per second: 777781
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 297.2MB, 9.3 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/64.0%
pnml2lts-mc( 0/ 4): Stored 737 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 297.2MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-05-LTLFireability-07
ltl formula formula --ltl=/tmp/11870/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 280 places, 725 transitions and 3300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11870/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11870/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11870/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11870/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 925 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1238 levels ~10000 states ~67644 transitions
pnml2lts-mc( 0/ 4): ~2132 levels ~20000 states ~134284 transitions
pnml2lts-mc( 0/ 4): ~3585 levels ~40000 states ~253104 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~5528!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 37415
pnml2lts-mc( 0/ 4): unique states count: 74937
pnml2lts-mc( 0/ 4): unique transitions count: 510470
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 170666
pnml2lts-mc( 0/ 4): - claim found count: 83024
pnml2lts-mc( 0/ 4): - claim success count: 75098
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24258
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 75237 states 514089 transitions, fanout: 6.833
pnml2lts-mc( 0/ 4): Total exploration time 1.830 sec (1.830 sec minimum, 1.830 sec on average)
pnml2lts-mc( 0/ 4): States per second: 41113, Transitions per second: 280923
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 13.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 737 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.5MB (~256.0MB paged-in)
ltl formula name EisenbergMcGuire-PT-05-LTLFireability-15
ltl formula formula --ltl=/tmp/11870/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 280 places, 725 transitions and 3300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/11870/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/11870/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/11870/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/11870/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 733 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1402 levels ~10000 states ~53504 transitions
pnml2lts-mc( 2/ 4): ~2756 levels ~20000 states ~107664 transitions
pnml2lts-mc( 2/ 4): ~5175 levels ~40000 states ~216604 transitions
pnml2lts-mc( 2/ 4): ~10301 levels ~80000 states ~435404 transitions
pnml2lts-mc( 2/ 4): ~20130 levels ~160000 states ~877044 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~27031!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 205667
pnml2lts-mc( 0/ 4): unique transitions count: 1192210
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 667427
pnml2lts-mc( 0/ 4): - claim success count: 205998
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93113
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 206012 states 1193979 transitions, fanout: 5.796
pnml2lts-mc( 0/ 4): Total exploration time 4.220 sec (4.210 sec minimum, 4.213 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48818, Transitions per second: 282933
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.4MB, 13.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 737 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.4MB (~256.0MB paged-in)
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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is EisenbergMcGuire-PT-05, 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 r492-smll-171636266300164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 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 ;