About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11204.115 | 3600000.00 | 8021034.00 | 4775.60 | FTFFTF?FTF?FFF?T | 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.r245-tall-171654349100052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716577829092
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 19:10:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 19:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:10:30] [INFO ] Load time of PNML (sax parser for PT used): 460 ms
[2024-05-24 19:10:30] [INFO ] Transformed 6876 places.
[2024-05-24 19:10:30] [INFO ] Transformed 9571 transitions.
[2024-05-24 19:10:30] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 638 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 6876 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 6840 transition count 9571
Discarding 2154 places :
Symmetric choice reduction at 1 with 2154 rule applications. Total rules 2190 place count 4686 transition count 7417
Iterating global reduction 1 with 2154 rules applied. Total rules applied 4344 place count 4686 transition count 7417
Discarding 1889 places :
Symmetric choice reduction at 1 with 1889 rule applications. Total rules 6233 place count 2797 transition count 5528
Iterating global reduction 1 with 1889 rules applied. Total rules applied 8122 place count 2797 transition count 5528
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 8337 place count 2582 transition count 3808
Iterating global reduction 1 with 215 rules applied. Total rules applied 8552 place count 2582 transition count 3808
Applied a total of 8552 rules in 1435 ms. Remains 2582 /6876 variables (removed 4294) and now considering 3808/9571 (removed 5763) transitions.
[2024-05-24 19:10:32] [INFO ] Flow matrix only has 3536 transitions (discarded 272 similar events)
// Phase 1: matrix 3536 rows 2582 cols
[2024-05-24 19:10:32] [INFO ] Computed 613 invariants in 190 ms
[2024-05-24 19:10:35] [INFO ] Implicit Places using invariants in 3375 ms returned [4, 8, 12, 14, 18, 20, 22, 24, 26, 28, 33, 40, 49, 63, 76, 91, 107, 123, 125, 127, 131, 133, 135, 137, 139, 152, 165, 174, 181, 186, 189, 224, 231, 234, 235, 236, 237, 238, 239, 240, 241, 242, 245, 250, 257, 266, 277, 290, 304, 318, 319, 320, 321, 322, 323, 324, 325, 326, 337, 346, 353, 358, 361, 363, 398, 405, 408, 409, 410, 411, 412, 413, 414, 415, 416, 418, 422, 427, 434, 443, 454, 466, 478, 479, 480, 481, 482, 483, 484, 485, 486, 495, 502, 507, 510, 512, 514, 549, 556, 559, 560, 561, 562, 563, 564, 566, 567, 571, 573, 576, 581, 588, 597, 607, 617, 618, 619, 620, 621, 622, 623, 624, 625, 632, 637, 640, 642, 644, 646, 681, 688, 691, 692, 693, 694, 695, 696, 697, 698, 699, 701, 703, 706, 709, 714, 721, 729, 737, 738, 739, 740, 741, 742, 743, 744, 745, 750, 753, 755, 757, 759, 761, 796, 803, 806, 807, 808, 809, 811, 812, 813, 814, 818, 820, 822, 824, 827, 832, 838, 844, 845, 846, 847, 848, 849, 850, 851, 852, 855, 857, 859, 861, 863, 865, 907, 910, 911, 912, 913, 914, 915, 916, 917, 918, 920, 922, 924, 928, 931, 935, 939, 940, 941, 942, 943, 945, 946, 947, 949, 951, 953, 955, 959, 961, 996, 1003, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1016, 1018, 1020, 1022, 1024, 1026, 1028, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1039, 1042, 1047, 1049, 1051, 1053, 1055, 1090, 1092, 1096, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1109, 1111, 1113, 1115, 1117, 1119, 1121, 1124, 1125, 1126, 1128, 1129, 1130, 1131, 1132, 1134, 1136, 1138, 1140, 1144, 1146, 1181, 1188, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1201, 1203, 1205, 1207, 1209, 1211, 1213, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1271, 1278, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1291, 1293, 1295, 1297, 1299, 1301, 1304, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1320, 1322, 1324, 1326, 1328, 1330, 1365, 1372, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1385, 1387, 1389, 1391, 1393, 1396, 1401, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1421, 1424, 1426, 1428, 1430, 1432, 1467, 1474, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1485, 1487, 1489, 1491, 1496, 1499, 1504, 1511, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1535, 1540, 1543, 1545, 1547, 1549, 1584, 1591, 1594, 1595, 1597, 1598, 1599, 1600, 1601, 1602, 1605, 1607, 1609, 1612, 1618, 1628, 1637, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1656, 1667, 1674, 1679, 1682, 1684, 1687, 1722, 1729, 1732, 1733, 1734, 1735, 1736, 1737, 1739, 1740, 1742, 1744, 1747, 1752, 1759, 1770, 1781, 1794, 1795, 1797, 1798, 1800, 1801, 1802, 1813, 1822, 1829, 1837, 1842, 1844, 1879, 1886, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1899, 1903, 1908, 1915, 1924, 1935, 1948, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1971, 1984, 1995, 2004, 2011, 2018, 2021, 2056, 2058, 2062, 2065, 2067, 2068, 2069, 2070, 2071, 2072, 2073, 2076, 2084, 2091, 2100, 2111, 2124, 2139, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163, 2164, 2179, 2192, 2203, 2212, 2219, 2224, 2261]
[2024-05-24 19:10:35] [INFO ] Actually due to overlaps returned [224, 398, 549, 681, 796, 996, 1090, 1181, 1271, 1365, 1467, 1584, 1722, 1879, 2056, 2261, 4, 12, 14, 18, 20, 22, 24, 26, 49, 123, 125, 127, 131, 133, 135, 137, 234, 235, 236, 237, 238, 239, 240, 241, 257, 318, 319, 320, 321, 322, 323, 324, 325, 408, 409, 410, 411, 412, 413, 414, 415, 427, 478, 479, 480, 481, 482, 483, 484, 485, 559, 560, 561, 562, 563, 564, 566, 576, 617, 618, 619, 620, 621, 622, 623, 624, 691, 692, 693, 694, 695, 696, 697, 698, 706, 737, 738, 739, 740, 741, 742, 743, 744, 806, 807, 808, 809, 811, 812, 813, 844, 845, 846, 847, 848, 849, 850, 851, 910, 911, 912, 913, 914, 915, 916, 917, 939, 940, 941, 942, 943, 945, 946, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1022, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1092, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1115, 1124, 1125, 1126, 1128, 1129, 1130, 1131, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1207, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1297, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1391, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1496, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1594, 1595, 1597, 1598, 1599, 1600, 1601, 1612, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1732, 1733, 1734, 1735, 1736, 1737, 1739, 1752, 1794, 1795, 1797, 1798, 1800, 1801, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1915, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 2058, 2065, 2067, 2068, 2069, 2070, 2071, 2072, 2100, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 3417 ms to find 291 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2291/6876 places, 3808/9571 transitions.
Discarding 241 places :
Symmetric choice reduction at 0 with 241 rule applications. Total rules 241 place count 2050 transition count 3567
Iterating global reduction 0 with 241 rules applied. Total rules applied 482 place count 2050 transition count 3567
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 720 place count 1812 transition count 3329
Iterating global reduction 0 with 238 rules applied. Total rules applied 958 place count 1812 transition count 3329
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 1196 place count 1574 transition count 3091
Iterating global reduction 0 with 238 rules applied. Total rules applied 1434 place count 1574 transition count 3091
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1449 place count 1559 transition count 2971
Iterating global reduction 0 with 15 rules applied. Total rules applied 1464 place count 1559 transition count 2971
Applied a total of 1464 rules in 237 ms. Remains 1559 /2291 variables (removed 732) and now considering 2971/3808 (removed 837) transitions.
[2024-05-24 19:10:36] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
// Phase 1: matrix 2699 rows 1559 cols
[2024-05-24 19:10:36] [INFO ] Computed 322 invariants in 64 ms
[2024-05-24 19:10:37] [INFO ] Implicit Places using invariants in 1566 ms returned [7, 20, 25, 32, 54, 67, 82, 98, 123, 136, 149, 158, 165, 170, 173, 214, 217, 220, 225, 240, 251, 264, 278, 292, 303, 312, 319, 324, 327, 329, 342, 345, 347, 351, 362, 371, 382, 394, 406, 415, 422, 427, 430, 432, 434, 445, 449, 453, 455, 462, 469, 478, 488, 497, 504, 509, 512, 514, 516, 518, 529, 531, 533, 535, 540, 545, 552, 560, 567, 572, 575, 577, 579, 581, 583, 592, 596, 600, 602, 604, 606, 609, 614, 620, 625, 628, 630, 632, 634, 636, 638, 650, 652, 654, 656, 658, 662, 665, 669, 674, 676, 678, 680, 682, 686, 688, 699, 701, 703, 705, 707, 710, 712, 714, 718, 721, 726, 728, 730, 732, 734, 743, 745, 747, 749, 751, 754, 756, 758, 762, 764, 766, 768, 770, 774, 776, 787, 789, 791, 793, 795, 798, 800, 802, 804, 806, 808, 810, 812, 814, 816, 825, 827, 829, 831, 833, 836, 838, 841, 845, 848, 850, 852, 854, 856, 858, 867, 869, 871, 873, 875, 878, 881, 886, 892, 897, 900, 902, 904, 906, 908, 917, 921, 923, 925, 927, 934, 939, 946, 955, 962, 967, 970, 972, 974, 976, 988, 992, 995, 997, 999, 1007, 1017, 1026, 1038, 1049, 1056, 1061, 1064, 1066, 1069, 1082, 1086, 1088, 1090, 1093, 1104, 1115, 1126, 1141, 1152, 1161, 1168, 1176, 1181, 1183, 1198, 1200, 1202, 1206, 1211, 1226, 1237, 1250, 1266, 1279, 1290, 1299, 1306, 1313, 1316, 1325, 1329, 1332, 1340, 1347, 1366, 1379, 1394, 1410, 1425, 1438, 1449, 1458, 1465, 1470]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1580 ms to find 256 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1303/6876 places, 2971/9571 transitions.
Applied a total of 0 rules in 50 ms. Remains 1303 /1303 variables (removed 0) and now considering 2971/2971 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6737 ms. Remains : 1303/6876 places, 2971/9571 transitions.
Support contains 69 out of 1303 places after structural reductions.
[2024-05-24 19:10:38] [INFO ] Flatten gal took : 214 ms
[2024-05-24 19:10:38] [INFO ] Flatten gal took : 147 ms
[2024-05-24 19:10:38] [INFO ] Input system was already deterministic with 2971 transitions.
RANDOM walk for 40000 steps (480 resets) in 2424 ms. (16 steps per ms) remains 17/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 69 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (12 resets) in 63 ms. (62 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 65 ms. (60 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 69 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
[2024-05-24 19:10:39] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
// Phase 1: matrix 2699 rows 1303 cols
[2024-05-24 19:10:39] [INFO ] Computed 66 invariants in 46 ms
[2024-05-24 19:10:39] [INFO ] State equation strengthened by 1112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 1182/1219 variables, 13/15 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 377 places in 682 ms of which 26 ms to minimize.
[2024-05-24 19:10:41] [INFO ] Deduced a trap composed of 386 places in 795 ms of which 62 ms to minimize.
[2024-05-24 19:10:42] [INFO ] Deduced a trap composed of 446 places in 905 ms of which 20 ms to minimize.
[2024-05-24 19:10:43] [INFO ] Deduced a trap composed of 377 places in 620 ms of which 8 ms to minimize.
[2024-05-24 19:10:44] [INFO ] Deduced a trap composed of 277 places in 626 ms of which 8 ms to minimize.
[2024-05-24 19:10:44] [INFO ] Deduced a trap composed of 254 places in 545 ms of which 8 ms to minimize.
[2024-05-24 19:10:45] [INFO ] Deduced a trap composed of 258 places in 590 ms of which 8 ms to minimize.
SMT process timed out in 5663ms, After SMT, problems are : Problem set: 4 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1303 transition count 2947
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2947
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 1279 transition count 2920
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 1252 transition count 2920
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 119 place count 1235 transition count 2854
Iterating global reduction 2 with 17 rules applied. Total rules applied 136 place count 1235 transition count 2854
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 136 place count 1235 transition count 2851
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 1232 transition count 2851
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 1222 transition count 2792
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 1222 transition count 2792
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 1219 transition count 2768
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 1219 transition count 2768
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 222 place count 1192 transition count 2741
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 226 place count 1188 transition count 2737
Iterating global reduction 2 with 4 rules applied. Total rules applied 230 place count 1188 transition count 2737
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 234 place count 1184 transition count 2705
Iterating global reduction 2 with 4 rules applied. Total rules applied 238 place count 1184 transition count 2705
Free-agglomeration rule (complex) applied 145 times.
Iterating global reduction 2 with 145 rules applied. Total rules applied 383 place count 1184 transition count 4317
Reduce places removed 145 places and 0 transitions.
Iterating post reduction 2 with 145 rules applied. Total rules applied 528 place count 1039 transition count 4317
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 537 place count 1039 transition count 4317
Applied a total of 537 rules in 912 ms. Remains 1039 /1303 variables (removed 264) and now considering 4317/2971 (removed -1346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 913 ms. Remains : 1039/1303 places, 4317/2971 transitions.
RANDOM walk for 40000 steps (838 resets) in 1596 ms. (25 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (104 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (116 resets) in 326 ms. (122 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (117 resets) in 266 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (119 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (105 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (116 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (132 resets) in 273 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (120 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (120 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (120 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
[2024-05-24 19:10:47] [INFO ] Flow matrix only has 3923 transitions (discarded 394 similar events)
// Phase 1: matrix 3923 rows 1039 cols
[2024-05-24 19:10:47] [INFO ] Computed 66 invariants in 28 ms
[2024-05-24 19:10:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 936/955 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:10:48] [INFO ] Deduced a trap composed of 239 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:10:49] [INFO ] Deduced a trap composed of 125 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 138 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:10:50] [INFO ] Deduced a trap composed of 113 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:10:51] [INFO ] Deduced a trap composed of 114 places in 623 ms of which 7 ms to minimize.
[2024-05-24 19:10:51] [INFO ] Deduced a trap composed of 130 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:10:52] [INFO ] Deduced a trap composed of 158 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 121 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:10:53] [INFO ] Deduced a trap composed of 510 places in 464 ms of which 6 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 489 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:10:54] [INFO ] Deduced a trap composed of 145 places in 92 ms of which 1 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 113 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:10:55] [INFO ] Deduced a trap composed of 153 places in 623 ms of which 7 ms to minimize.
[2024-05-24 19:10:56] [INFO ] Deduced a trap composed of 125 places in 621 ms of which 7 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 165 places in 603 ms of which 5 ms to minimize.
[2024-05-24 19:10:57] [INFO ] Deduced a trap composed of 126 places in 589 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/955 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:10:58] [INFO ] Deduced a trap composed of 113 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:10:59] [INFO ] Deduced a trap composed of 129 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 137 places in 599 ms of which 6 ms to minimize.
[2024-05-24 19:11:00] [INFO ] Deduced a trap composed of 126 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 130 places in 645 ms of which 7 ms to minimize.
[2024-05-24 19:11:01] [INFO ] Deduced a trap composed of 139 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:11:02] [INFO ] Deduced a trap composed of 248 places in 595 ms of which 7 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 129 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:11:03] [INFO ] Deduced a trap composed of 157 places in 618 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:04] [INFO ] Deduced a trap composed of 173 places in 613 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/957 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:05] [INFO ] Deduced a trap composed of 153 places in 606 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/957 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/957 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 49/1006 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 5 places in 578 ms of which 9 ms to minimize.
[2024-05-24 19:11:07] [INFO ] Deduced a trap composed of 82 places in 574 ms of which 7 ms to minimize.
[2024-05-24 19:11:08] [INFO ] Deduced a trap composed of 244 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 200 places in 564 ms of which 7 ms to minimize.
[2024-05-24 19:11:09] [INFO ] Deduced a trap composed of 143 places in 580 ms of which 7 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 27 places in 552 ms of which 7 ms to minimize.
[2024-05-24 19:11:10] [INFO ] Deduced a trap composed of 185 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:11:11] [INFO ] Deduced a trap composed of 103 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:11:12] [INFO ] Deduced a trap composed of 103 places in 681 ms of which 7 ms to minimize.
[2024-05-24 19:11:12] [INFO ] Deduced a trap composed of 103 places in 660 ms of which 7 ms to minimize.
[2024-05-24 19:11:13] [INFO ] Deduced a trap composed of 97 places in 669 ms of which 6 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 84 places in 678 ms of which 7 ms to minimize.
[2024-05-24 19:11:14] [INFO ] Deduced a trap composed of 102 places in 653 ms of which 6 ms to minimize.
[2024-05-24 19:11:15] [INFO ] Deduced a trap composed of 92 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:11:16] [INFO ] Deduced a trap composed of 114 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:11:16] [INFO ] Deduced a trap composed of 93 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:11:17] [INFO ] Deduced a trap composed of 92 places in 701 ms of which 7 ms to minimize.
[2024-05-24 19:11:18] [INFO ] Deduced a trap composed of 166 places in 559 ms of which 7 ms to minimize.
[2024-05-24 19:11:18] [INFO ] Deduced a trap composed of 163 places in 537 ms of which 6 ms to minimize.
[2024-05-24 19:11:19] [INFO ] Deduced a trap composed of 161 places in 523 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:20] [INFO ] Deduced a trap composed of 111 places in 668 ms of which 7 ms to minimize.
[2024-05-24 19:11:20] [INFO ] Deduced a trap composed of 106 places in 656 ms of which 7 ms to minimize.
[2024-05-24 19:11:21] [INFO ] Deduced a trap composed of 103 places in 672 ms of which 7 ms to minimize.
[2024-05-24 19:11:22] [INFO ] Deduced a trap composed of 125 places in 678 ms of which 6 ms to minimize.
[2024-05-24 19:11:22] [INFO ] Deduced a trap composed of 118 places in 590 ms of which 7 ms to minimize.
[2024-05-24 19:11:23] [INFO ] Deduced a trap composed of 101 places in 690 ms of which 7 ms to minimize.
[2024-05-24 19:11:24] [INFO ] Deduced a trap composed of 117 places in 671 ms of which 7 ms to minimize.
[2024-05-24 19:11:24] [INFO ] Deduced a trap composed of 113 places in 673 ms of which 6 ms to minimize.
[2024-05-24 19:11:25] [INFO ] Deduced a trap composed of 118 places in 664 ms of which 6 ms to minimize.
[2024-05-24 19:11:26] [INFO ] Deduced a trap composed of 118 places in 683 ms of which 7 ms to minimize.
[2024-05-24 19:11:26] [INFO ] Deduced a trap composed of 106 places in 667 ms of which 7 ms to minimize.
[2024-05-24 19:11:27] [INFO ] Deduced a trap composed of 109 places in 681 ms of which 7 ms to minimize.
[2024-05-24 19:11:28] [INFO ] Deduced a trap composed of 136 places in 683 ms of which 7 ms to minimize.
[2024-05-24 19:11:29] [INFO ] Deduced a trap composed of 105 places in 679 ms of which 7 ms to minimize.
[2024-05-24 19:11:29] [INFO ] Deduced a trap composed of 186 places in 558 ms of which 7 ms to minimize.
[2024-05-24 19:11:30] [INFO ] Deduced a trap composed of 97 places in 673 ms of which 6 ms to minimize.
[2024-05-24 19:11:31] [INFO ] Deduced a trap composed of 103 places in 687 ms of which 7 ms to minimize.
[2024-05-24 19:11:31] [INFO ] Deduced a trap composed of 115 places in 673 ms of which 7 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 134 places in 675 ms of which 7 ms to minimize.
[2024-05-24 19:11:32] [INFO ] Deduced a trap composed of 172 places in 554 ms of which 6 ms to minimize.
SMT process timed out in 45205ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 4317/4317 transitions.
Applied a total of 0 rules in 121 ms. Remains 1039 /1039 variables (removed 0) and now considering 4317/4317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1039/1039 places, 4317/4317 transitions.
RANDOM walk for 40000 steps (840 resets) in 1782 ms. (22 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (107 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (119 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (121 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (118 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (107 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (121 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (132 resets) in 242 ms. (164 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (119 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (118 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (121 resets) in 240 ms. (165 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 54388 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 10
Probabilistic random walk after 54388 steps, saw 23040 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:11:37] [INFO ] Flow matrix only has 3923 transitions (discarded 394 similar events)
[2024-05-24 19:11:37] [INFO ] Invariant cache hit.
[2024-05-24 19:11:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 936/955 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:38] [INFO ] Deduced a trap composed of 239 places in 608 ms of which 10 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 125 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:11:39] [INFO ] Deduced a trap composed of 129 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 158 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:11:40] [INFO ] Deduced a trap composed of 113 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:11:41] [INFO ] Deduced a trap composed of 113 places in 599 ms of which 7 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 114 places in 619 ms of which 6 ms to minimize.
[2024-05-24 19:11:42] [INFO ] Deduced a trap composed of 114 places in 620 ms of which 7 ms to minimize.
[2024-05-24 19:11:43] [INFO ] Deduced a trap composed of 137 places in 600 ms of which 7 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 121 places in 602 ms of which 7 ms to minimize.
[2024-05-24 19:11:44] [INFO ] Deduced a trap composed of 531 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:11:45] [INFO ] Deduced a trap composed of 489 places in 438 ms of which 5 ms to minimize.
[2024-05-24 19:11:45] [INFO ] Deduced a trap composed of 145 places in 99 ms of which 2 ms to minimize.
[2024-05-24 19:11:45] [INFO ] Deduced a trap composed of 126 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:11:46] [INFO ] Deduced a trap composed of 173 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 139 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:11:47] [INFO ] Deduced a trap composed of 113 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:11:48] [INFO ] Deduced a trap composed of 130 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 248 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:11:49] [INFO ] Deduced a trap composed of 141 places in 629 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/955 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 347 places in 502 ms of which 6 ms to minimize.
[2024-05-24 19:11:50] [INFO ] Deduced a trap composed of 374 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:11:51] [INFO ] Deduced a trap composed of 130 places in 612 ms of which 7 ms to minimize.
[2024-05-24 19:11:52] [INFO ] Deduced a trap composed of 125 places in 613 ms of which 7 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 157 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:11:53] [INFO ] Deduced a trap composed of 165 places in 621 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:54] [INFO ] Deduced a trap composed of 177 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:11:55] [INFO ] Deduced a trap composed of 112 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:11:55] [INFO ] Deduced a trap composed of 179 places in 599 ms of which 6 ms to minimize.
[2024-05-24 19:11:56] [INFO ] Deduced a trap composed of 160 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:11:57] [INFO ] Deduced a trap composed of 121 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:11:57] [INFO ] Deduced a trap composed of 141 places in 629 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:11:58] [INFO ] Deduced a trap composed of 176 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 142 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:11:59] [INFO ] Deduced a trap composed of 174 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 126 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:12:00] [INFO ] Deduced a trap composed of 113 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:12:01] [INFO ] Deduced a trap composed of 138 places in 603 ms of which 7 ms to minimize.
[2024-05-24 19:12:02] [INFO ] Deduced a trap composed of 169 places in 645 ms of which 7 ms to minimize.
[2024-05-24 19:12:03] [INFO ] Deduced a trap composed of 239 places in 638 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 160 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:12:04] [INFO ] Deduced a trap composed of 210 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 137 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:12:05] [INFO ] Deduced a trap composed of 113 places in 600 ms of which 7 ms to minimize.
[2024-05-24 19:12:06] [INFO ] Deduced a trap composed of 189 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:12:07] [INFO ] Deduced a trap composed of 114 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:12:07] [INFO ] Deduced a trap composed of 174 places in 608 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/955 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:12:08] [INFO ] Deduced a trap composed of 178 places in 612 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:12:09] [INFO ] Deduced a trap composed of 181 places in 577 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/955 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/955 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/957 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/957 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 49/1006 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1006 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 20/1026 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 19:12:11] [INFO ] Deduced a trap composed of 5 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:12:12] [INFO ] Deduced a trap composed of 86 places in 669 ms of which 7 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 155 places in 564 ms of which 14 ms to minimize.
[2024-05-24 19:12:13] [INFO ] Deduced a trap composed of 27 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:12:14] [INFO ] Deduced a trap composed of 27 places in 588 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1026 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1026 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 13/1039 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1039 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 3923/4962 variables, 1039/1159 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 21 (INCLUDED_ONLY) 0/4962 variables, 2722/3881 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4962 variables, 0/3881 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/4962 variables, 0/3881 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4962/4962 variables, and 3881 constraints, problems are : Problem set: 1 solved, 9 unsolved in 44506 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 1039/1039 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 938/955 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/955 variables, 49/60 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:12:22] [INFO ] Deduced a trap composed of 176 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:12:23] [INFO ] Deduced a trap composed of 504 places in 436 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/955 variables, 2/62 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 145 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:12:24] [INFO ] Deduced a trap composed of 192 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:12:25] [INFO ] Deduced a trap composed of 145 places in 616 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 3/65 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/957 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/957 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 49/1006 variables, 20/87 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1006 variables, 5/92 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:12:26] [INFO ] Deduced a trap composed of 164 places in 585 ms of which 6 ms to minimize.
[2024-05-24 19:12:27] [INFO ] Deduced a trap composed of 82 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:12:28] [INFO ] Deduced a trap composed of 118 places in 578 ms of which 7 ms to minimize.
[2024-05-24 19:12:28] [INFO ] Deduced a trap composed of 240 places in 568 ms of which 6 ms to minimize.
[2024-05-24 19:12:29] [INFO ] Deduced a trap composed of 183 places in 552 ms of which 7 ms to minimize.
[2024-05-24 19:12:29] [INFO ] Deduced a trap composed of 217 places in 549 ms of which 7 ms to minimize.
[2024-05-24 19:12:30] [INFO ] Deduced a trap composed of 202 places in 554 ms of which 7 ms to minimize.
[2024-05-24 19:12:30] [INFO ] Deduced a trap composed of 118 places in 538 ms of which 6 ms to minimize.
[2024-05-24 19:12:31] [INFO ] Deduced a trap composed of 275 places in 556 ms of which 6 ms to minimize.
[2024-05-24 19:12:32] [INFO ] Deduced a trap composed of 165 places in 587 ms of which 7 ms to minimize.
[2024-05-24 19:12:32] [INFO ] Deduced a trap composed of 139 places in 560 ms of which 7 ms to minimize.
[2024-05-24 19:12:33] [INFO ] Deduced a trap composed of 125 places in 559 ms of which 6 ms to minimize.
[2024-05-24 19:12:33] [INFO ] Deduced a trap composed of 128 places in 555 ms of which 6 ms to minimize.
[2024-05-24 19:12:34] [INFO ] Deduced a trap composed of 139 places in 540 ms of which 6 ms to minimize.
[2024-05-24 19:12:34] [INFO ] Deduced a trap composed of 203 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:12:35] [INFO ] Deduced a trap composed of 232 places in 562 ms of which 6 ms to minimize.
[2024-05-24 19:12:36] [INFO ] Deduced a trap composed of 141 places in 545 ms of which 7 ms to minimize.
[2024-05-24 19:12:36] [INFO ] Deduced a trap composed of 141 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:12:37] [INFO ] Deduced a trap composed of 141 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:12:37] [INFO ] Deduced a trap composed of 303 places in 555 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1006 variables, 20/112 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:12:38] [INFO ] Deduced a trap composed of 172 places in 553 ms of which 6 ms to minimize.
[2024-05-24 19:12:39] [INFO ] Deduced a trap composed of 138 places in 554 ms of which 6 ms to minimize.
[2024-05-24 19:12:39] [INFO ] Deduced a trap composed of 174 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:12:40] [INFO ] Deduced a trap composed of 230 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:12:40] [INFO ] Deduced a trap composed of 134 places in 563 ms of which 7 ms to minimize.
[2024-05-24 19:12:41] [INFO ] Deduced a trap composed of 174 places in 551 ms of which 7 ms to minimize.
[2024-05-24 19:12:41] [INFO ] Deduced a trap composed of 215 places in 559 ms of which 6 ms to minimize.
[2024-05-24 19:12:42] [INFO ] Deduced a trap composed of 255 places in 541 ms of which 7 ms to minimize.
[2024-05-24 19:12:43] [INFO ] Deduced a trap composed of 127 places in 535 ms of which 6 ms to minimize.
[2024-05-24 19:12:43] [INFO ] Deduced a trap composed of 265 places in 558 ms of which 7 ms to minimize.
[2024-05-24 19:12:44] [INFO ] Deduced a trap composed of 287 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:12:44] [INFO ] Deduced a trap composed of 174 places in 537 ms of which 6 ms to minimize.
[2024-05-24 19:12:45] [INFO ] Deduced a trap composed of 82 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:12:45] [INFO ] Deduced a trap composed of 251 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:12:46] [INFO ] Deduced a trap composed of 254 places in 544 ms of which 7 ms to minimize.
[2024-05-24 19:12:47] [INFO ] Deduced a trap composed of 143 places in 535 ms of which 6 ms to minimize.
[2024-05-24 19:12:47] [INFO ] Deduced a trap composed of 57 places in 557 ms of which 7 ms to minimize.
[2024-05-24 19:12:48] [INFO ] Deduced a trap composed of 191 places in 566 ms of which 7 ms to minimize.
[2024-05-24 19:12:48] [INFO ] Deduced a trap composed of 82 places in 542 ms of which 6 ms to minimize.
[2024-05-24 19:12:49] [INFO ] Deduced a trap composed of 124 places in 552 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:12:50] [INFO ] Deduced a trap composed of 109 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:12:50] [INFO ] Deduced a trap composed of 127 places in 557 ms of which 6 ms to minimize.
[2024-05-24 19:12:51] [INFO ] Deduced a trap composed of 130 places in 656 ms of which 7 ms to minimize.
[2024-05-24 19:12:51] [INFO ] Deduced a trap composed of 266 places in 581 ms of which 7 ms to minimize.
[2024-05-24 19:12:52] [INFO ] Deduced a trap composed of 139 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:12:53] [INFO ] Deduced a trap composed of 120 places in 661 ms of which 6 ms to minimize.
[2024-05-24 19:12:54] [INFO ] Deduced a trap composed of 102 places in 676 ms of which 6 ms to minimize.
[2024-05-24 19:12:54] [INFO ] Deduced a trap composed of 98 places in 673 ms of which 6 ms to minimize.
[2024-05-24 19:12:55] [INFO ] Deduced a trap composed of 110 places in 659 ms of which 7 ms to minimize.
[2024-05-24 19:12:56] [INFO ] Deduced a trap composed of 88 places in 669 ms of which 6 ms to minimize.
[2024-05-24 19:12:56] [INFO ] Deduced a trap composed of 102 places in 669 ms of which 6 ms to minimize.
[2024-05-24 19:12:57] [INFO ] Deduced a trap composed of 113 places in 669 ms of which 6 ms to minimize.
[2024-05-24 19:12:58] [INFO ] Deduced a trap composed of 103 places in 643 ms of which 6 ms to minimize.
[2024-05-24 19:12:58] [INFO ] Deduced a trap composed of 84 places in 652 ms of which 6 ms to minimize.
[2024-05-24 19:12:59] [INFO ] Deduced a trap composed of 111 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:13:00] [INFO ] Deduced a trap composed of 121 places in 655 ms of which 7 ms to minimize.
[2024-05-24 19:13:00] [INFO ] Deduced a trap composed of 126 places in 668 ms of which 7 ms to minimize.
[2024-05-24 19:13:01] [INFO ] Deduced a trap composed of 96 places in 654 ms of which 7 ms to minimize.
[2024-05-24 19:13:02] [INFO ] Deduced a trap composed of 141 places in 673 ms of which 7 ms to minimize.
[2024-05-24 19:13:02] [INFO ] Deduced a trap composed of 97 places in 662 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1006 variables, 20/152 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:13:03] [INFO ] Deduced a trap composed of 131 places in 659 ms of which 7 ms to minimize.
[2024-05-24 19:13:04] [INFO ] Deduced a trap composed of 99 places in 667 ms of which 7 ms to minimize.
[2024-05-24 19:13:04] [INFO ] Deduced a trap composed of 172 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:13:05] [INFO ] Deduced a trap composed of 115 places in 684 ms of which 7 ms to minimize.
[2024-05-24 19:13:06] [INFO ] Deduced a trap composed of 128 places in 674 ms of which 6 ms to minimize.
[2024-05-24 19:13:07] [INFO ] Deduced a trap composed of 109 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:13:07] [INFO ] Deduced a trap composed of 111 places in 671 ms of which 7 ms to minimize.
[2024-05-24 19:13:08] [INFO ] Deduced a trap composed of 98 places in 662 ms of which 7 ms to minimize.
[2024-05-24 19:13:09] [INFO ] Deduced a trap composed of 93 places in 671 ms of which 6 ms to minimize.
[2024-05-24 19:13:09] [INFO ] Deduced a trap composed of 111 places in 661 ms of which 6 ms to minimize.
[2024-05-24 19:13:10] [INFO ] Deduced a trap composed of 98 places in 659 ms of which 6 ms to minimize.
[2024-05-24 19:13:11] [INFO ] Deduced a trap composed of 107 places in 656 ms of which 7 ms to minimize.
[2024-05-24 19:13:11] [INFO ] Deduced a trap composed of 97 places in 678 ms of which 6 ms to minimize.
[2024-05-24 19:13:12] [INFO ] Deduced a trap composed of 106 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:13:13] [INFO ] Deduced a trap composed of 147 places in 631 ms of which 7 ms to minimize.
[2024-05-24 19:13:13] [INFO ] Deduced a trap composed of 107 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:13:14] [INFO ] Deduced a trap composed of 160 places in 668 ms of which 7 ms to minimize.
[2024-05-24 19:13:15] [INFO ] Deduced a trap composed of 119 places in 670 ms of which 7 ms to minimize.
[2024-05-24 19:13:15] [INFO ] Deduced a trap composed of 291 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:13:16] [INFO ] Deduced a trap composed of 103 places in 660 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1006 variables, 20/172 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:13:17] [INFO ] Deduced a trap composed of 102 places in 647 ms of which 6 ms to minimize.
[2024-05-24 19:13:18] [INFO ] Deduced a trap composed of 99 places in 658 ms of which 6 ms to minimize.
[2024-05-24 19:13:18] [INFO ] Deduced a trap composed of 106 places in 655 ms of which 7 ms to minimize.
[2024-05-24 19:13:19] [INFO ] Deduced a trap composed of 104 places in 647 ms of which 6 ms to minimize.
[2024-05-24 19:13:20] [INFO ] Deduced a trap composed of 137 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:13:20] [INFO ] Deduced a trap composed of 124 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:13:21] [INFO ] Deduced a trap composed of 114 places in 661 ms of which 7 ms to minimize.
[2024-05-24 19:13:22] [INFO ] Deduced a trap composed of 125 places in 648 ms of which 7 ms to minimize.
[2024-05-24 19:13:22] [INFO ] Deduced a trap composed of 125 places in 645 ms of which 6 ms to minimize.
[2024-05-24 19:13:23] [INFO ] Deduced a trap composed of 338 places in 562 ms of which 7 ms to minimize.
[2024-05-24 19:13:23] [INFO ] Deduced a trap composed of 169 places in 553 ms of which 7 ms to minimize.
[2024-05-24 19:13:24] [INFO ] Deduced a trap composed of 118 places in 662 ms of which 6 ms to minimize.
[2024-05-24 19:13:25] [INFO ] Deduced a trap composed of 140 places in 673 ms of which 7 ms to minimize.
[2024-05-24 19:13:26] [INFO ] Deduced a trap composed of 101 places in 659 ms of which 7 ms to minimize.
[2024-05-24 19:13:26] [INFO ] Deduced a trap composed of 97 places in 658 ms of which 6 ms to minimize.
[2024-05-24 19:13:27] [INFO ] Deduced a trap composed of 100 places in 671 ms of which 6 ms to minimize.
[2024-05-24 19:13:28] [INFO ] Deduced a trap composed of 83 places in 673 ms of which 7 ms to minimize.
[2024-05-24 19:13:28] [INFO ] Deduced a trap composed of 118 places in 654 ms of which 7 ms to minimize.
[2024-05-24 19:13:29] [INFO ] Deduced a trap composed of 123 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:13:30] [INFO ] Deduced a trap composed of 121 places in 646 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1006 variables, 20/192 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-24 19:13:30] [INFO ] Deduced a trap composed of 107 places in 670 ms of which 6 ms to minimize.
[2024-05-24 19:13:31] [INFO ] Deduced a trap composed of 109 places in 666 ms of which 7 ms to minimize.
[2024-05-24 19:13:32] [INFO ] Deduced a trap composed of 106 places in 679 ms of which 6 ms to minimize.
[2024-05-24 19:13:32] [INFO ] Deduced a trap composed of 194 places in 550 ms of which 7 ms to minimize.
[2024-05-24 19:13:33] [INFO ] Deduced a trap composed of 87 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:13:34] [INFO ] Deduced a trap composed of 90 places in 669 ms of which 7 ms to minimize.
[2024-05-24 19:13:34] [INFO ] Deduced a trap composed of 106 places in 660 ms of which 6 ms to minimize.
[2024-05-24 19:13:35] [INFO ] Deduced a trap composed of 106 places in 676 ms of which 6 ms to minimize.
[2024-05-24 19:13:36] [INFO ] Deduced a trap composed of 115 places in 687 ms of which 7 ms to minimize.
[2024-05-24 19:13:37] [INFO ] Deduced a trap composed of 144 places in 676 ms of which 6 ms to minimize.
SMT process timed out in 119614ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 17 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 4317/4317 transitions.
Applied a total of 0 rules in 115 ms. Remains 1039 /1039 variables (removed 0) and now considering 4317/4317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1039/1039 places, 4317/4317 transitions.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 471 stabilizing places and 1338 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(p0)||(p1&&G(p2)))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2891
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2891
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1263 transition count 2812
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1263 transition count 2812
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 1256 transition count 2756
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 1256 transition count 2756
Applied a total of 94 rules in 151 ms. Remains 1256 /1303 variables (removed 47) and now considering 2756/2971 (removed 215) transitions.
[2024-05-24 19:13:37] [INFO ] Flow matrix only has 2484 transitions (discarded 272 similar events)
// Phase 1: matrix 2484 rows 1256 cols
[2024-05-24 19:13:37] [INFO ] Computed 66 invariants in 29 ms
[2024-05-24 19:13:38] [INFO ] Implicit Places using invariants in 1187 ms returned [12, 106, 392, 506, 537, 549, 559, 614, 772, 806, 843, 888, 889, 993, 1046]
[2024-05-24 19:13:38] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 614, 772, 806, 843, 888, 889, 993, 1046]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1190 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1303 places, 2756/2971 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1229 transition count 2743
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1229 transition count 2743
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1216 transition count 2730
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1216 transition count 2730
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1203 transition count 2717
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1203 transition count 2717
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 1191 transition count 2621
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 1191 transition count 2621
Applied a total of 102 rules in 188 ms. Remains 1191 /1242 variables (removed 51) and now considering 2621/2756 (removed 135) transitions.
[2024-05-24 19:13:39] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1191 cols
[2024-05-24 19:13:39] [INFO ] Computed 52 invariants in 31 ms
[2024-05-24 19:13:40] [INFO ] Implicit Places using invariants in 1080 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1082 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1190/1303 places, 2621/2971 transitions.
Applied a total of 0 rules in 35 ms. Remains 1190 /1190 variables (removed 0) and now considering 2621/2621 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2648 ms. Remains : 1190/1303 places, 2621/2971 transitions.
Stuttering acceptance computed with spot in 357 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 finished in 3096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1252 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1252 transition count 2745
Applied a total of 102 rules in 158 ms. Remains 1252 /1303 variables (removed 51) and now considering 2745/2971 (removed 226) transitions.
[2024-05-24 19:13:40] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1252 cols
[2024-05-24 19:13:40] [INFO ] Computed 66 invariants in 29 ms
[2024-05-24 19:13:41] [INFO ] Implicit Places using invariants in 1160 ms returned [12, 106, 508, 539, 551, 561, 588, 613, 717, 768, 802, 839, 884, 885, 989, 1042]
[2024-05-24 19:13:41] [INFO ] Actually due to overlaps returned [539, 12, 106, 508, 561, 588, 613, 717, 768, 802, 839, 884, 885, 989, 1042]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1165 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2745/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2731
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2731
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2717
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2717
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1195 transition count 2703
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1195 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1182 transition count 2599
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1182 transition count 2599
Applied a total of 110 rules in 195 ms. Remains 1182 /1237 variables (removed 55) and now considering 2599/2745 (removed 146) transitions.
[2024-05-24 19:13:42] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1182 cols
[2024-05-24 19:13:42] [INFO ] Computed 51 invariants in 24 ms
[2024-05-24 19:13:43] [INFO ] Implicit Places using invariants in 1038 ms returned [538]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1303 places, 2599/2971 transitions.
Applied a total of 0 rules in 37 ms. Remains 1181 /1181 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2597 ms. Remains : 1181/1303 places, 2599/2971 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 finished in 2725 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(G(p0))||G(p1)))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2825
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2825
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 1253 transition count 2753
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 1253 transition count 2753
Applied a total of 100 rules in 156 ms. Remains 1253 /1303 variables (removed 50) and now considering 2753/2971 (removed 218) transitions.
[2024-05-24 19:13:43] [INFO ] Flow matrix only has 2481 transitions (discarded 272 similar events)
// Phase 1: matrix 2481 rows 1253 cols
[2024-05-24 19:13:43] [INFO ] Computed 66 invariants in 35 ms
[2024-05-24 19:13:44] [INFO ] Implicit Places using invariants in 1164 ms returned [12, 394, 509, 540, 552, 562, 589, 614, 718, 769, 803, 840, 885, 886, 990, 1043]
[2024-05-24 19:13:44] [INFO ] Actually due to overlaps returned [540, 12, 394, 509, 562, 589, 614, 718, 769, 803, 840, 885, 886, 990, 1043]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1166 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2753/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2739
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2739
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2725
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2725
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1196 transition count 2711
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1196 transition count 2711
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1183 transition count 2607
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1183 transition count 2607
Applied a total of 110 rules in 189 ms. Remains 1183 /1238 variables (removed 55) and now considering 2607/2753 (removed 146) transitions.
[2024-05-24 19:13:44] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1183 cols
[2024-05-24 19:13:44] [INFO ] Computed 51 invariants in 27 ms
[2024-05-24 19:13:45] [INFO ] Implicit Places using invariants in 1044 ms returned [539]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1045 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1303 places, 2607/2971 transitions.
Applied a total of 0 rules in 47 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2603 ms. Remains : 1182/1303 places, 2607/2971 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Product exploration explored 100000 steps with 1204 reset in 500 ms.
Product exploration explored 100000 steps with 1205 reset in 499 ms.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 35221 steps (422 resets) in 217 ms. (161 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 36 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2024-05-24 19:13:47] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-24 19:13:47] [INFO ] Computed 50 invariants in 16 ms
[2024-05-24 19:13:48] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-05-24 19:13:48] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 19:13:48] [INFO ] Invariant cache hit.
[2024-05-24 19:13:49] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 19:14:03] [INFO ] Implicit Places using invariants and state equation in 14701 ms returned []
Implicit Place search using SMT with State Equation took 15726 ms to find 0 implicit places.
Running 2590 sub problems to find dead transitions.
[2024-05-24 19:14:03] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 19:14:03] [INFO ] Invariant cache hit.
[2024-05-24 19:14:03] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1180 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2590 unsolved
SMT process timed out in 32794ms, After SMT, problems are : Problem set: 0 solved, 2590 unsolved
Search for dead transitions found 0 dead transitions in 32822ms
Finished structural reductions in LTL mode , in 1 iterations and 48593 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 28192 steps (339 resets) in 182 ms. (154 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1204 reset in 411 ms.
Product exploration explored 100000 steps with 1206 reset in 454 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2607
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 1182 transition count 2607
Deduced a syphon composed of 47 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 1182 transition count 2607
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 1167 transition count 2592
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 1167 transition count 2592
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 2 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 1167 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 97 rules in 850 ms. Remains 1166 /1182 variables (removed 16) and now considering 2591/2607 (removed 16) transitions.
[2024-05-24 19:14:39] [INFO ] Redundant transitions in 167 ms returned []
Running 2574 sub problems to find dead transitions.
[2024-05-24 19:14:39] [INFO ] Flow matrix only has 2319 transitions (discarded 272 similar events)
// Phase 1: matrix 2319 rows 1166 cols
[2024-05-24 19:14:39] [INFO ] Computed 50 invariants in 19 ms
[2024-05-24 19:14:39] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1164 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2574 unsolved
SMT process timed out in 33023ms, After SMT, problems are : Problem set: 0 solved, 2574 unsolved
Search for dead transitions found 0 dead transitions in 33051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1166/1182 places, 2591/2607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34083 ms. Remains : 1166/1182 places, 2591/2607 transitions.
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 31 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2024-05-24 19:15:12] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-24 19:15:12] [INFO ] Computed 50 invariants in 16 ms
[2024-05-24 19:15:13] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2024-05-24 19:15:13] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 19:15:13] [INFO ] Invariant cache hit.
[2024-05-24 19:15:14] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 19:15:28] [INFO ] Implicit Places using invariants and state equation in 14120 ms returned []
Implicit Place search using SMT with State Equation took 15168 ms to find 0 implicit places.
Running 2590 sub problems to find dead transitions.
[2024-05-24 19:15:28] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 19:15:28] [INFO ] Invariant cache hit.
[2024-05-24 19:15:28] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1180 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2590 unsolved
SMT process timed out in 32412ms, After SMT, problems are : Problem set: 0 solved, 2590 unsolved
Search for dead transitions found 0 dead transitions in 32437ms
Finished structural reductions in LTL mode , in 1 iterations and 47650 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 137541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2891
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2891
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1263 transition count 2819
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1263 transition count 2819
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1255 transition count 2755
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1255 transition count 2755
Applied a total of 96 rules in 134 ms. Remains 1255 /1303 variables (removed 48) and now considering 2755/2971 (removed 216) transitions.
[2024-05-24 19:16:00] [INFO ] Flow matrix only has 2483 transitions (discarded 272 similar events)
// Phase 1: matrix 2483 rows 1255 cols
[2024-05-24 19:16:00] [INFO ] Computed 66 invariants in 26 ms
[2024-05-24 19:16:02] [INFO ] Implicit Places using invariants in 1158 ms returned [109, 395, 509, 540, 552, 591, 616, 720, 771, 805, 842, 887, 888, 992, 1045]
[2024-05-24 19:16:02] [INFO ] Actually due to overlaps returned [540, 109, 395, 509, 591, 616, 720, 771, 805, 842, 887, 888, 992, 1045]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1303 places, 2755/2971 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1228 transition count 2742
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1228 transition count 2742
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1215 transition count 2729
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1215 transition count 2729
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1202 transition count 2716
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1202 transition count 2716
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 1190 transition count 2620
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 1190 transition count 2620
Applied a total of 102 rules in 163 ms. Remains 1190 /1241 variables (removed 51) and now considering 2620/2755 (removed 135) transitions.
[2024-05-24 19:16:02] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1190 cols
[2024-05-24 19:16:02] [INFO ] Computed 52 invariants in 22 ms
[2024-05-24 19:16:03] [INFO ] Implicit Places using invariants in 1047 ms returned [539]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1049 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1189/1303 places, 2620/2971 transitions.
Applied a total of 0 rules in 31 ms. Remains 1189 /1189 variables (removed 0) and now considering 2620/2620 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2541 ms. Remains : 1189/1303 places, 2620/2971 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 finished in 2687 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 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 1230 transition count 2842
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 1230 transition count 2842
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 1230 transition count 2839
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1227 transition count 2839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1213 transition count 2748
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1213 transition count 2748
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 236 place count 1185 transition count 2720
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 242 place count 1179 transition count 2714
Iterating global reduction 2 with 6 rules applied. Total rules applied 248 place count 1179 transition count 2714
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 254 place count 1173 transition count 2666
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 1173 transition count 2666
Applied a total of 260 rules in 349 ms. Remains 1173 /1303 variables (removed 130) and now considering 2666/2971 (removed 305) transitions.
[2024-05-24 19:16:03] [INFO ] Flow matrix only has 2394 transitions (discarded 272 similar events)
// Phase 1: matrix 2394 rows 1173 cols
[2024-05-24 19:16:03] [INFO ] Computed 66 invariants in 26 ms
[2024-05-24 19:16:04] [INFO ] Implicit Places using invariants in 1074 ms returned [9, 95, 355, 466, 496, 507, 517, 542, 565, 664, 713, 747, 781, 827, 930, 981]
[2024-05-24 19:16:04] [INFO ] Actually due to overlaps returned [496, 9, 95, 355, 466, 517, 542, 565, 664, 713, 747, 781, 827, 930, 981]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1077 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1158/1303 places, 2666/2971 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1149 transition count 2657
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1149 transition count 2657
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1140 transition count 2648
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1140 transition count 2648
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 1132 transition count 2584
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 1132 transition count 2584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 62 place count 1127 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1122 transition count 2574
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1122 transition count 2574
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 1117 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 1117 transition count 2534
Applied a total of 82 rules in 294 ms. Remains 1117 /1158 variables (removed 41) and now considering 2534/2666 (removed 132) transitions.
[2024-05-24 19:16:05] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1117 cols
[2024-05-24 19:16:05] [INFO ] Computed 51 invariants in 20 ms
[2024-05-24 19:16:06] [INFO ] Implicit Places using invariants in 969 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 972 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1303 places, 2534/2971 transitions.
Applied a total of 0 rules in 65 ms. Remains 1116 /1116 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2759 ms. Remains : 1116/1303 places, 2534/2971 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
Product exploration explored 100000 steps with 1711 reset in 551 ms.
Product exploration explored 100000 steps with 1710 reset in 527 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1116 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 147 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (682 resets) in 340 ms. (117 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (148 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (148 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
[2024-05-24 19:16:07] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2024-05-24 19:16:07] [INFO ] Computed 50 invariants in 19 ms
[2024-05-24 19:16:07] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 1036/1040 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 19:16:08] [INFO ] Deduced a trap composed of 114 places in 459 ms of which 6 ms to minimize.
[2024-05-24 19:16:09] [INFO ] Deduced a trap composed of 90 places in 439 ms of which 7 ms to minimize.
[2024-05-24 19:16:09] [INFO ] Deduced a trap composed of 172 places in 428 ms of which 6 ms to minimize.
[2024-05-24 19:16:09] [INFO ] Deduced a trap composed of 191 places in 457 ms of which 7 ms to minimize.
[2024-05-24 19:16:10] [INFO ] Deduced a trap composed of 130 places in 437 ms of which 6 ms to minimize.
[2024-05-24 19:16:10] [INFO ] Deduced a trap composed of 105 places in 444 ms of which 8 ms to minimize.
[2024-05-24 19:16:11] [INFO ] Deduced a trap composed of 114 places in 495 ms of which 7 ms to minimize.
[2024-05-24 19:16:11] [INFO ] Deduced a trap composed of 109 places in 452 ms of which 7 ms to minimize.
[2024-05-24 19:16:12] [INFO ] Deduced a trap composed of 214 places in 439 ms of which 7 ms to minimize.
[2024-05-24 19:16:12] [INFO ] Deduced a trap composed of 105 places in 432 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1040 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1040 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 34/1074 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1074 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/1100 variables, 26/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1100 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/1116 variables, 16/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SMT process timed out in 5046ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2534/2534 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 1116 transition count 2533
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 1115 transition count 2533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1114 transition count 2532
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1114 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1113 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1113 transition count 2524
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 0 with 132 rules applied. Total rules applied 138 place count 1113 transition count 4275
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 270 place count 981 transition count 4275
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 981 transition count 4275
Applied a total of 271 rules in 396 ms. Remains 981 /1116 variables (removed 135) and now considering 4275/2534 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 981/1116 places, 4275/2534 transitions.
RANDOM walk for 40000 steps (840 resets) in 1002 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (105 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71448 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71448 steps, saw 30097 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 19:16:16] [INFO ] Flow matrix only has 3877 transitions (discarded 398 similar events)
// Phase 1: matrix 3877 rows 981 cols
[2024-05-24 19:16:16] [INFO ] Computed 50 invariants in 50 ms
[2024-05-24 19:16:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 885/887 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:17] [INFO ] Deduced a trap composed of 196 places in 562 ms of which 6 ms to minimize.
[2024-05-24 19:16:18] [INFO ] Deduced a trap composed of 153 places in 625 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/939 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:18] [INFO ] Deduced a trap composed of 5 places in 497 ms of which 6 ms to minimize.
[2024-05-24 19:16:19] [INFO ] Deduced a trap composed of 27 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:16:19] [INFO ] Deduced a trap composed of 62 places in 529 ms of which 7 ms to minimize.
[2024-05-24 19:16:20] [INFO ] Deduced a trap composed of 154 places in 536 ms of which 6 ms to minimize.
[2024-05-24 19:16:20] [INFO ] Deduced a trap composed of 82 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:16:21] [INFO ] Deduced a trap composed of 85 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:16:21] [INFO ] Deduced a trap composed of 85 places in 516 ms of which 6 ms to minimize.
[2024-05-24 19:16:22] [INFO ] Deduced a trap composed of 62 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:16:23] [INFO ] Deduced a trap composed of 97 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:16:23] [INFO ] Deduced a trap composed of 27 places in 521 ms of which 6 ms to minimize.
[2024-05-24 19:16:24] [INFO ] Deduced a trap composed of 57 places in 521 ms of which 7 ms to minimize.
[2024-05-24 19:16:24] [INFO ] Deduced a trap composed of 62 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:16:25] [INFO ] Deduced a trap composed of 104 places in 497 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/965 variables, 26/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/981 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3877/4858 variables, 981/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4858 variables, 2722/3768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4858 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4858 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4858/4858 variables, and 3768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11079 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 981/981 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 885/887 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:28] [INFO ] Deduced a trap composed of 99 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:16:29] [INFO ] Deduced a trap composed of 83 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:16:29] [INFO ] Deduced a trap composed of 136 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 83 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 153 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:16:31] [INFO ] Deduced a trap composed of 179 places in 558 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:32] [INFO ] Deduced a trap composed of 88 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:16:32] [INFO ] Deduced a trap composed of 80 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:16:33] [INFO ] Deduced a trap composed of 66 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:16:34] [INFO ] Deduced a trap composed of 70 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:16:34] [INFO ] Deduced a trap composed of 171 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:16:35] [INFO ] Deduced a trap composed of 72 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:16:35] [INFO ] Deduced a trap composed of 46 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:16:36] [INFO ] Deduced a trap composed of 74 places in 614 ms of which 5 ms to minimize.
[2024-05-24 19:16:37] [INFO ] Deduced a trap composed of 76 places in 606 ms of which 5 ms to minimize.
[2024-05-24 19:16:37] [INFO ] Deduced a trap composed of 72 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:16:38] [INFO ] Deduced a trap composed of 73 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:16:39] [INFO ] Deduced a trap composed of 72 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:16:39] [INFO ] Deduced a trap composed of 73 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:16:40] [INFO ] Deduced a trap composed of 89 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:16:40] [INFO ] Deduced a trap composed of 63 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:16:41] [INFO ] Deduced a trap composed of 62 places in 547 ms of which 6 ms to minimize.
[2024-05-24 19:16:42] [INFO ] Deduced a trap composed of 71 places in 681 ms of which 6 ms to minimize.
[2024-05-24 19:16:42] [INFO ] Deduced a trap composed of 66 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:16:43] [INFO ] Deduced a trap composed of 71 places in 578 ms of which 5 ms to minimize.
[2024-05-24 19:16:44] [INFO ] Deduced a trap composed of 77 places in 586 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:44] [INFO ] Deduced a trap composed of 75 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:16:45] [INFO ] Deduced a trap composed of 104 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:16:45] [INFO ] Deduced a trap composed of 66 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:16:46] [INFO ] Deduced a trap composed of 75 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:16:47] [INFO ] Deduced a trap composed of 104 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:16:47] [INFO ] Deduced a trap composed of 68 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:16:48] [INFO ] Deduced a trap composed of 82 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:16:48] [INFO ] Deduced a trap composed of 82 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:16:49] [INFO ] Deduced a trap composed of 163 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:16:50] [INFO ] Deduced a trap composed of 92 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:16:50] [INFO ] Deduced a trap composed of 87 places in 599 ms of which 5 ms to minimize.
[2024-05-24 19:16:51] [INFO ] Deduced a trap composed of 72 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:16:51] [INFO ] Deduced a trap composed of 71 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:16:52] [INFO ] Deduced a trap composed of 77 places in 599 ms of which 5 ms to minimize.
[2024-05-24 19:16:53] [INFO ] Deduced a trap composed of 84 places in 616 ms of which 6 ms to minimize.
[2024-05-24 19:16:53] [INFO ] Deduced a trap composed of 86 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:16:54] [INFO ] Deduced a trap composed of 85 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:16:55] [INFO ] Deduced a trap composed of 84 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:16:55] [INFO ] Deduced a trap composed of 66 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:16:56] [INFO ] Deduced a trap composed of 64 places in 616 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:16:57] [INFO ] Deduced a trap composed of 80 places in 607 ms of which 5 ms to minimize.
[2024-05-24 19:16:57] [INFO ] Deduced a trap composed of 70 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:16:58] [INFO ] Deduced a trap composed of 66 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:16:58] [INFO ] Deduced a trap composed of 66 places in 596 ms of which 5 ms to minimize.
[2024-05-24 19:16:59] [INFO ] Deduced a trap composed of 78 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:17:00] [INFO ] Deduced a trap composed of 66 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:17:00] [INFO ] Deduced a trap composed of 115 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:17:01] [INFO ] Deduced a trap composed of 76 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:17:01] [INFO ] Deduced a trap composed of 106 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:17:02] [INFO ] Deduced a trap composed of 101 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:17:03] [INFO ] Deduced a trap composed of 71 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:17:03] [INFO ] Deduced a trap composed of 77 places in 661 ms of which 6 ms to minimize.
[2024-05-24 19:17:04] [INFO ] Deduced a trap composed of 231 places in 586 ms of which 5 ms to minimize.
[2024-05-24 19:17:05] [INFO ] Deduced a trap composed of 95 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:17:05] [INFO ] Deduced a trap composed of 78 places in 553 ms of which 5 ms to minimize.
[2024-05-24 19:17:06] [INFO ] Deduced a trap composed of 88 places in 615 ms of which 7 ms to minimize.
[2024-05-24 19:17:06] [INFO ] Deduced a trap composed of 105 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:17:07] [INFO ] Deduced a trap composed of 99 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:17:08] [INFO ] Deduced a trap composed of 233 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:17:08] [INFO ] Deduced a trap composed of 215 places in 593 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:17:09] [INFO ] Deduced a trap composed of 88 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:17:10] [INFO ] Deduced a trap composed of 226 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:17:10] [INFO ] Deduced a trap composed of 99 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:17:11] [INFO ] Deduced a trap composed of 114 places in 568 ms of which 6 ms to minimize.
[2024-05-24 19:17:11] [INFO ] Deduced a trap composed of 81 places in 592 ms of which 5 ms to minimize.
[2024-05-24 19:17:12] [INFO ] Deduced a trap composed of 95 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:17:13] [INFO ] Deduced a trap composed of 81 places in 628 ms of which 6 ms to minimize.
SMT process timed out in 56548ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4275/4275 transitions.
Applied a total of 0 rules in 113 ms. Remains 981 /981 variables (removed 0) and now considering 4275/4275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 981/981 places, 4275/4275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4275/4275 transitions.
Applied a total of 0 rules in 110 ms. Remains 981 /981 variables (removed 0) and now considering 4275/4275 (removed 0) transitions.
[2024-05-24 19:17:13] [INFO ] Flow matrix only has 3877 transitions (discarded 398 similar events)
[2024-05-24 19:17:13] [INFO ] Invariant cache hit.
[2024-05-24 19:17:14] [INFO ] Implicit Places using invariants in 1278 ms returned [694]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1282 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 980/981 places, 4275/4275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 979 transition count 4274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 978 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 978 transition count 4273
Applied a total of 4 rules in 166 ms. Remains 978 /980 variables (removed 2) and now considering 4273/4275 (removed 2) transitions.
[2024-05-24 19:17:14] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:17:14] [INFO ] Computed 49 invariants in 28 ms
[2024-05-24 19:17:16] [INFO ] Implicit Places using invariants in 1313 ms returned []
[2024-05-24 19:17:16] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:17:16] [INFO ] Invariant cache hit.
[2024-05-24 19:17:17] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:17:47] [INFO ] Performed 672/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:17:59] [INFO ] Implicit Places using invariants and state equation in 43480 ms returned []
Implicit Place search using SMT with State Equation took 44794 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 978/981 places, 4273/4275 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46353 ms. Remains : 978/981 places, 4273/4275 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 finished in 116251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(p2))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2818
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2818
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1254 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1254 transition count 2754
Applied a total of 98 rules in 128 ms. Remains 1254 /1303 variables (removed 49) and now considering 2754/2971 (removed 217) transitions.
[2024-05-24 19:17:59] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1254 cols
[2024-05-24 19:17:59] [INFO ] Computed 66 invariants in 36 ms
[2024-05-24 19:18:01] [INFO ] Implicit Places using invariants in 1147 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 768, 803, 840, 885, 886, 990, 1043]
[2024-05-24 19:18:01] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 768, 803, 840, 885, 886, 990, 1043]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1149 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2754/2971 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1223 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1223 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1208 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1208 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1193 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1193 transition count 2709
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1179 transition count 2597
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1179 transition count 2597
Applied a total of 118 rules in 215 ms. Remains 1179 /1238 variables (removed 59) and now considering 2597/2754 (removed 157) transitions.
[2024-05-24 19:18:01] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1179 cols
[2024-05-24 19:18:01] [INFO ] Computed 50 invariants in 23 ms
[2024-05-24 19:18:02] [INFO ] Implicit Places using invariants in 1028 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1303 places, 2597/2971 transitions.
Applied a total of 0 rules in 32 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2556 ms. Remains : 1178/1303 places, 2597/2971 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 finished in 2715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(F(p2))))||p0))))'
Support contains 8 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1252 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1252 transition count 2745
Applied a total of 102 rules in 129 ms. Remains 1252 /1303 variables (removed 51) and now considering 2745/2971 (removed 226) transitions.
[2024-05-24 19:18:02] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1252 cols
[2024-05-24 19:18:02] [INFO ] Computed 66 invariants in 25 ms
[2024-05-24 19:18:03] [INFO ] Implicit Places using invariants in 1105 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 766, 800, 884, 885, 989, 1042]
[2024-05-24 19:18:03] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 766, 800, 884, 885, 989, 1042]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1108 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2745/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2731
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2731
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2717
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2717
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1195 transition count 2703
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1195 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1182 transition count 2599
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1182 transition count 2599
Applied a total of 110 rules in 160 ms. Remains 1182 /1237 variables (removed 55) and now considering 2599/2745 (removed 146) transitions.
[2024-05-24 19:18:03] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1182 cols
[2024-05-24 19:18:03] [INFO ] Computed 51 invariants in 24 ms
[2024-05-24 19:18:04] [INFO ] Implicit Places using invariants in 1052 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1303 places, 2599/2971 transitions.
Applied a total of 0 rules in 31 ms. Remains 1181 /1181 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2483 ms. Remains : 1181/1303 places, 2599/2971 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Product exploration explored 100000 steps with 1206 reset in 408 ms.
Product exploration explored 100000 steps with 1204 reset in 499 ms.
Computed a total of 349 stabilizing places and 966 stable transitions
Computed a total of 349 stabilizing places and 966 stable transitions
Detected a total of 349/1181 stabilizing places and 966/2599 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 145 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (480 resets) in 337 ms. (118 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (136 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (136 resets) in 325 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (136 resets) in 460 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (136 resets) in 168 ms. (236 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40002 steps (136 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
[2024-05-24 19:18:06] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2024-05-24 19:18:06] [INFO ] Computed 50 invariants in 20 ms
[2024-05-24 19:18:06] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1098/1106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1141 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1165 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1165 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/1181 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1181 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2327/3508 variables, 1181/1231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3508 variables, 846/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3508 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3508 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3508/3508 variables, and 2077 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1181/1181 constraints, ReadFeed: 846/846 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1098/1106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:09] [INFO ] Deduced a trap composed of 366 places in 475 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1108 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1141 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:10] [INFO ] Deduced a trap composed of 99 places in 501 ms of which 8 ms to minimize.
[2024-05-24 19:18:10] [INFO ] Deduced a trap composed of 103 places in 543 ms of which 7 ms to minimize.
[2024-05-24 19:18:11] [INFO ] Deduced a trap composed of 116 places in 498 ms of which 8 ms to minimize.
[2024-05-24 19:18:11] [INFO ] Deduced a trap composed of 232 places in 533 ms of which 7 ms to minimize.
[2024-05-24 19:18:12] [INFO ] Deduced a trap composed of 230 places in 519 ms of which 7 ms to minimize.
[2024-05-24 19:18:12] [INFO ] Deduced a trap composed of 234 places in 519 ms of which 7 ms to minimize.
[2024-05-24 19:18:13] [INFO ] Deduced a trap composed of 236 places in 516 ms of which 7 ms to minimize.
[2024-05-24 19:18:13] [INFO ] Deduced a trap composed of 234 places in 496 ms of which 8 ms to minimize.
SMT process timed out in 6936ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 2599/2599 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1181 transition count 2568
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1150 transition count 2568
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1150 transition count 2552
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1134 transition count 2552
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 1118 transition count 2536
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 2 with 119 rules applied. Total rules applied 245 place count 1118 transition count 4293
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 2 with 119 rules applied. Total rules applied 364 place count 999 transition count 4293
Applied a total of 364 rules in 309 ms. Remains 999 /1181 variables (removed 182) and now considering 4293/2599 (removed -1694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 999/1181 places, 4293/2599 transitions.
RANDOM walk for 40000 steps (838 resets) in 1422 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (117 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (132 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 61803 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 61803 steps, saw 26079 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:18:18] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
// Phase 1: matrix 3909 rows 999 cols
[2024-05-24 19:18:18] [INFO ] Computed 50 invariants in 47 ms
[2024-05-24 19:18:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 916/924 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/926 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/926 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/959 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/983 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/999 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/999 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3909/4908 variables, 999/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4908 variables, 2722/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4908/4908 variables, and 3771 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2329 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 999/999 constraints, ReadFeed: 2722/2722 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 916/924 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:21] [INFO ] Deduced a trap composed of 100 places in 557 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/926 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/926 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/959 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:22] [INFO ] Deduced a trap composed of 5 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:18:22] [INFO ] Deduced a trap composed of 76 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:18:23] [INFO ] Deduced a trap composed of 87 places in 667 ms of which 6 ms to minimize.
[2024-05-24 19:18:23] [INFO ] Deduced a trap composed of 78 places in 616 ms of which 7 ms to minimize.
[2024-05-24 19:18:24] [INFO ] Deduced a trap composed of 77 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:18:25] [INFO ] Deduced a trap composed of 93 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:18:25] [INFO ] Deduced a trap composed of 135 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:18:26] [INFO ] Deduced a trap composed of 76 places in 608 ms of which 7 ms to minimize.
[2024-05-24 19:18:27] [INFO ] Deduced a trap composed of 86 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:18:27] [INFO ] Deduced a trap composed of 78 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:18:28] [INFO ] Deduced a trap composed of 72 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:18:29] [INFO ] Deduced a trap composed of 59 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:18:29] [INFO ] Deduced a trap composed of 159 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:18:30] [INFO ] Deduced a trap composed of 58 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:18:30] [INFO ] Deduced a trap composed of 91 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:18:31] [INFO ] Deduced a trap composed of 81 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:18:32] [INFO ] Deduced a trap composed of 157 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:18:32] [INFO ] Deduced a trap composed of 61 places in 630 ms of which 7 ms to minimize.
[2024-05-24 19:18:33] [INFO ] Deduced a trap composed of 63 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:18:34] [INFO ] Deduced a trap composed of 161 places in 624 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:34] [INFO ] Deduced a trap composed of 215 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:18:35] [INFO ] Deduced a trap composed of 80 places in 618 ms of which 7 ms to minimize.
[2024-05-24 19:18:35] [INFO ] Deduced a trap composed of 172 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:18:36] [INFO ] Deduced a trap composed of 56 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:18:37] [INFO ] Deduced a trap composed of 72 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:18:37] [INFO ] Deduced a trap composed of 68 places in 619 ms of which 6 ms to minimize.
[2024-05-24 19:18:38] [INFO ] Deduced a trap composed of 73 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:18:39] [INFO ] Deduced a trap composed of 80 places in 610 ms of which 6 ms to minimize.
[2024-05-24 19:18:39] [INFO ] Deduced a trap composed of 110 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:18:40] [INFO ] Deduced a trap composed of 72 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:18:40] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-24 19:18:41] [INFO ] Deduced a trap composed of 91 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:18:41] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
[2024-05-24 19:18:41] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-24 19:18:42] [INFO ] Deduced a trap composed of 94 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:18:42] [INFO ] Deduced a trap composed of 69 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:18:42] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:43] [INFO ] Deduced a trap composed of 86 places in 623 ms of which 7 ms to minimize.
[2024-05-24 19:18:44] [INFO ] Deduced a trap composed of 89 places in 701 ms of which 6 ms to minimize.
[2024-05-24 19:18:44] [INFO ] Deduced a trap composed of 54 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:18:45] [INFO ] Deduced a trap composed of 88 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:18:46] [INFO ] Deduced a trap composed of 75 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:18:46] [INFO ] Deduced a trap composed of 198 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:18:47] [INFO ] Deduced a trap composed of 54 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:18:48] [INFO ] Deduced a trap composed of 59 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:18:48] [INFO ] Deduced a trap composed of 97 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:18:49] [INFO ] Deduced a trap composed of 93 places in 632 ms of which 7 ms to minimize.
[2024-05-24 19:18:49] [INFO ] Deduced a trap composed of 64 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:18:50] [INFO ] Deduced a trap composed of 93 places in 642 ms of which 7 ms to minimize.
[2024-05-24 19:18:51] [INFO ] Deduced a trap composed of 77 places in 641 ms of which 7 ms to minimize.
[2024-05-24 19:18:51] [INFO ] Deduced a trap composed of 84 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:18:52] [INFO ] Deduced a trap composed of 77 places in 639 ms of which 7 ms to minimize.
[2024-05-24 19:18:53] [INFO ] Deduced a trap composed of 212 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:18:53] [INFO ] Deduced a trap composed of 90 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:18:54] [INFO ] Deduced a trap composed of 113 places in 648 ms of which 6 ms to minimize.
[2024-05-24 19:18:55] [INFO ] Deduced a trap composed of 87 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:18:55] [INFO ] Deduced a trap composed of 57 places in 614 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:56] [INFO ] Deduced a trap composed of 200 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:18:57] [INFO ] Deduced a trap composed of 201 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:18:57] [INFO ] Deduced a trap composed of 74 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:18:58] [INFO ] Deduced a trap composed of 98 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:18:59] [INFO ] Deduced a trap composed of 85 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:18:59] [INFO ] Deduced a trap composed of 192 places in 653 ms of which 6 ms to minimize.
[2024-05-24 19:19:00] [INFO ] Deduced a trap composed of 233 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:19:00] [INFO ] Deduced a trap composed of 73 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:19:01] [INFO ] Deduced a trap composed of 69 places in 634 ms of which 7 ms to minimize.
[2024-05-24 19:19:02] [INFO ] Deduced a trap composed of 79 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:19:02] [INFO ] Deduced a trap composed of 91 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:19:03] [INFO ] Deduced a trap composed of 197 places in 625 ms of which 6 ms to minimize.
[2024-05-24 19:19:04] [INFO ] Deduced a trap composed of 79 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:19:04] [INFO ] Deduced a trap composed of 78 places in 588 ms of which 7 ms to minimize.
[2024-05-24 19:19:05] [INFO ] Deduced a trap composed of 60 places in 607 ms of which 6 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 959/4908 variables, and 83 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/31 constraints, Generalized P Invariants (flows): 3/19 constraints, State Equation: 0/999 constraints, ReadFeed: 0/2722 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 73/73 constraints]
After SMT, in 47426ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 172 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 999/999 places, 4293/4293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 107 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-24 19:19:05] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:19:05] [INFO ] Invariant cache hit.
[2024-05-24 19:19:06] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-05-24 19:19:06] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:19:06] [INFO ] Invariant cache hit.
[2024-05-24 19:19:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:19:38] [INFO ] Performed 738/999 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:19:54] [INFO ] Implicit Places using invariants and state equation in 47534 ms returned []
Implicit Place search using SMT with State Equation took 48770 ms to find 0 implicit places.
[2024-05-24 19:19:54] [INFO ] Redundant transitions in 292 ms returned []
Running 4231 sub problems to find dead transitions.
[2024-05-24 19:19:54] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:19:54] [INFO ] Invariant cache hit.
[2024-05-24 19:19:54] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4231 unsolved
SMT process timed out in 60010ms, After SMT, problems are : Problem set: 0 solved, 4231 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109237 ms. Remains : 999/999 places, 4293/4293 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 315 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 2599/2599 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1181 transition count 2568
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1150 transition count 2568
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1150 transition count 2552
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1134 transition count 2552
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 1118 transition count 2536
Applied a total of 126 rules in 124 ms. Remains 1118 /1181 variables (removed 63) and now considering 2536/2599 (removed 63) transitions.
[2024-05-24 19:20:55] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-24 19:20:55] [INFO ] Computed 50 invariants in 21 ms
[2024-05-24 19:20:56] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-24 19:20:56] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-24 19:20:56] [INFO ] Invariant cache hit.
[2024-05-24 19:20:57] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:21:08] [INFO ] Implicit Places using invariants and state equation in 11998 ms returned [1115]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12974 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1181 places, 2536/2599 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 1117 transition count 2535
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 1116 transition count 2535
Applied a total of 2 rules in 69 ms. Remains 1116 /1117 variables (removed 1) and now considering 2535/2536 (removed 1) transitions.
[2024-05-24 19:21:08] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:21:08] [INFO ] Computed 49 invariants in 25 ms
[2024-05-24 19:21:09] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-05-24 19:21:09] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:21:09] [INFO ] Invariant cache hit.
[2024-05-24 19:21:10] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:21:21] [INFO ] Implicit Places using invariants and state equation in 12213 ms returned []
Implicit Place search using SMT with State Equation took 13156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1181 places, 2535/2599 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26323 ms. Remains : 1116/1181 places, 2535/2599 transitions.
Computed a total of 299 stabilizing places and 917 stable transitions
Computed a total of 299 stabilizing places and 917 stable transitions
Detected a total of 299/1116 stabilizing places and 917/2535 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 174 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (683 resets) in 395 ms. (101 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
[2024-05-24 19:21:22] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:21:22] [INFO ] Invariant cache hit.
[2024-05-24 19:21:22] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1044 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1044 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1077 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1101 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/1116 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2263/3379 variables, 1116/1165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 846/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2011 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1728 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1116/1116 constraints, ReadFeed: 846/846 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:21:24] [INFO ] Deduced a trap composed of 147 places in 463 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1044 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1077 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:21:25] [INFO ] Deduced a trap composed of 47 places in 496 ms of which 7 ms to minimize.
[2024-05-24 19:21:26] [INFO ] Deduced a trap composed of 106 places in 469 ms of which 7 ms to minimize.
[2024-05-24 19:21:26] [INFO ] Deduced a trap composed of 190 places in 433 ms of which 6 ms to minimize.
[2024-05-24 19:21:26] [INFO ] Deduced a trap composed of 93 places in 407 ms of which 6 ms to minimize.
[2024-05-24 19:21:27] [INFO ] Deduced a trap composed of 194 places in 412 ms of which 6 ms to minimize.
[2024-05-24 19:21:27] [INFO ] Deduced a trap composed of 195 places in 404 ms of which 7 ms to minimize.
[2024-05-24 19:21:28] [INFO ] Deduced a trap composed of 166 places in 414 ms of which 7 ms to minimize.
[2024-05-24 19:21:28] [INFO ] Deduced a trap composed of 174 places in 417 ms of which 7 ms to minimize.
[2024-05-24 19:21:29] [INFO ] Deduced a trap composed of 174 places in 407 ms of which 7 ms to minimize.
[2024-05-24 19:21:29] [INFO ] Deduced a trap composed of 170 places in 445 ms of which 6 ms to minimize.
SMT process timed out in 7130ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1116 transition count 4292
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 997 transition count 4292
Applied a total of 238 rules in 195 ms. Remains 997 /1116 variables (removed 119) and now considering 4292/2535 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 997/1116 places, 4292/2535 transitions.
RANDOM walk for 40000 steps (839 resets) in 1715 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (118 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 60268 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 60268 steps, saw 25430 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:21:33] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
// Phase 1: matrix 3908 rows 997 cols
[2024-05-24 19:21:33] [INFO ] Computed 49 invariants in 94 ms
[2024-05-24 19:21:33] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 915/923 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/923 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/925 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/958 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/982 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/997 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3908/4905 variables, 997/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4905 variables, 2722/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4905/4905 variables, and 3768 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 997/997 constraints, ReadFeed: 2722/2722 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 915/923 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:21:36] [INFO ] Deduced a trap composed of 104 places in 567 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/923 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/923 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/925 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/925 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/958 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:21:37] [INFO ] Deduced a trap composed of 5 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:21:38] [INFO ] Deduced a trap composed of 73 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:21:38] [INFO ] Deduced a trap composed of 69 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:21:39] [INFO ] Deduced a trap composed of 80 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:21:40] [INFO ] Deduced a trap composed of 88 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:21:40] [INFO ] Deduced a trap composed of 65 places in 620 ms of which 7 ms to minimize.
[2024-05-24 19:21:41] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:21:41] [INFO ] Deduced a trap composed of 71 places in 623 ms of which 7 ms to minimize.
[2024-05-24 19:21:42] [INFO ] Deduced a trap composed of 85 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:21:43] [INFO ] Deduced a trap composed of 80 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:21:43] [INFO ] Deduced a trap composed of 84 places in 610 ms of which 7 ms to minimize.
[2024-05-24 19:21:44] [INFO ] Deduced a trap composed of 86 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:21:45] [INFO ] Deduced a trap composed of 79 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:21:45] [INFO ] Deduced a trap composed of 155 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:21:46] [INFO ] Deduced a trap composed of 170 places in 487 ms of which 6 ms to minimize.
[2024-05-24 19:21:46] [INFO ] Deduced a trap composed of 57 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:21:47] [INFO ] Deduced a trap composed of 82 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:21:48] [INFO ] Deduced a trap composed of 81 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:21:48] [INFO ] Deduced a trap composed of 102 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:21:49] [INFO ] Deduced a trap composed of 67 places in 634 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:21:49] [INFO ] Deduced a trap composed of 67 places in 619 ms of which 6 ms to minimize.
[2024-05-24 19:21:50] [INFO ] Deduced a trap composed of 70 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:21:51] [INFO ] Deduced a trap composed of 77 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:21:51] [INFO ] Deduced a trap composed of 66 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:21:52] [INFO ] Deduced a trap composed of 58 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:21:53] [INFO ] Deduced a trap composed of 69 places in 629 ms of which 6 ms to minimize.
[2024-05-24 19:21:53] [INFO ] Deduced a trap composed of 58 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:21:54] [INFO ] Deduced a trap composed of 58 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:21:55] [INFO ] Deduced a trap composed of 79 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:21:55] [INFO ] Deduced a trap composed of 115 places in 585 ms of which 6 ms to minimize.
[2024-05-24 19:21:56] [INFO ] Deduced a trap composed of 88 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:21:56] [INFO ] Deduced a trap composed of 57 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:21:57] [INFO ] Deduced a trap composed of 96 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:21:58] [INFO ] Deduced a trap composed of 68 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:21:58] [INFO ] Deduced a trap composed of 96 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:21:59] [INFO ] Deduced a trap composed of 98 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:22:00] [INFO ] Deduced a trap composed of 85 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:22:00] [INFO ] Deduced a trap composed of 73 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:22:01] [INFO ] Deduced a trap composed of 87 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:22:02] [INFO ] Deduced a trap composed of 80 places in 598 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/958 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:22:02] [INFO ] Deduced a trap composed of 72 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:22:03] [INFO ] Deduced a trap composed of 57 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:22:03] [INFO ] Deduced a trap composed of 54 places in 615 ms of which 7 ms to minimize.
[2024-05-24 19:22:04] [INFO ] Deduced a trap composed of 71 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:22:05] [INFO ] Deduced a trap composed of 256 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:22:05] [INFO ] Deduced a trap composed of 261 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:22:06] [INFO ] Deduced a trap composed of 108 places in 585 ms of which 5 ms to minimize.
[2024-05-24 19:22:07] [INFO ] Deduced a trap composed of 54 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:22:07] [INFO ] Deduced a trap composed of 56 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:22:08] [INFO ] Deduced a trap composed of 210 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:22:08] [INFO ] Deduced a trap composed of 100 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:22:09] [INFO ] Deduced a trap composed of 71 places in 582 ms of which 5 ms to minimize.
[2024-05-24 19:22:10] [INFO ] Deduced a trap composed of 86 places in 647 ms of which 6 ms to minimize.
[2024-05-24 19:22:10] [INFO ] Deduced a trap composed of 80 places in 608 ms of which 7 ms to minimize.
[2024-05-24 19:22:11] [INFO ] Deduced a trap composed of 71 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:22:12] [INFO ] Deduced a trap composed of 70 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:22:12] [INFO ] Deduced a trap composed of 55 places in 610 ms of which 6 ms to minimize.
[2024-05-24 19:22:13] [INFO ] Deduced a trap composed of 69 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:22:13] [INFO ] Deduced a trap composed of 84 places in 585 ms of which 6 ms to minimize.
[2024-05-24 19:22:14] [INFO ] Deduced a trap composed of 96 places in 588 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/958 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:22:15] [INFO ] Deduced a trap composed of 85 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:22:15] [INFO ] Deduced a trap composed of 114 places in 577 ms of which 5 ms to minimize.
[2024-05-24 19:22:16] [INFO ] Deduced a trap composed of 92 places in 635 ms of which 7 ms to minimize.
[2024-05-24 19:22:17] [INFO ] Deduced a trap composed of 98 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:22:17] [INFO ] Deduced a trap composed of 63 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:22:18] [INFO ] Deduced a trap composed of 111 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:22:18] [INFO ] Deduced a trap composed of 233 places in 608 ms of which 7 ms to minimize.
[2024-05-24 19:22:19] [INFO ] Deduced a trap composed of 89 places in 607 ms of which 5 ms to minimize.
[2024-05-24 19:22:20] [INFO ] Deduced a trap composed of 102 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:22:20] [INFO ] Deduced a trap composed of 54 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:22:21] [INFO ] Deduced a trap composed of 245 places in 616 ms of which 6 ms to minimize.
SMT process timed out in 47839ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 125 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 997/997 places, 4292/4292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 116 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
[2024-05-24 19:22:21] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:22:21] [INFO ] Invariant cache hit.
[2024-05-24 19:22:22] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2024-05-24 19:22:22] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:22:22] [INFO ] Invariant cache hit.
[2024-05-24 19:22:23] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:22:54] [INFO ] Performed 974/997 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:22:55] [INFO ] Implicit Places using invariants and state equation in 32811 ms returned []
Implicit Place search using SMT with State Equation took 34051 ms to find 0 implicit places.
[2024-05-24 19:22:55] [INFO ] Redundant transitions in 168 ms returned []
Running 4230 sub problems to find dead transitions.
[2024-05-24 19:22:55] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:22:55] [INFO ] Invariant cache hit.
[2024-05-24 19:22:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4230 unsolved
SMT process timed out in 59691ms, After SMT, problems are : Problem set: 0 solved, 4230 unsolved
Search for dead transitions found 0 dead transitions in 59729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94093 ms. Remains : 997/997 places, 4292/4292 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 308 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1714 reset in 513 ms.
Product exploration explored 100000 steps with 1714 reset in 611 ms.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Applied a total of 0 rules in 60 ms. Remains 1116 /1116 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2024-05-24 19:23:57] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:23:57] [INFO ] Computed 49 invariants in 23 ms
[2024-05-24 19:23:58] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 19:23:58] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:23:58] [INFO ] Invariant cache hit.
[2024-05-24 19:23:59] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:24:10] [INFO ] Implicit Places using invariants and state equation in 11660 ms returned []
Implicit Place search using SMT with State Equation took 12622 ms to find 0 implicit places.
[2024-05-24 19:24:10] [INFO ] Redundant transitions in 85 ms returned []
Running 2518 sub problems to find dead transitions.
[2024-05-24 19:24:10] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:24:10] [INFO ] Invariant cache hit.
[2024-05-24 19:24:10] [INFO ] State equation strengthened by 846 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1114 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2518 unsolved
SMT process timed out in 32610ms, After SMT, problems are : Problem set: 0 solved, 2518 unsolved
Search for dead transitions found 0 dead transitions in 32632ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45413 ms. Remains : 1116/1116 places, 2535/2535 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 400613 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 2 out of 1303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 52 place count 1277 transition count 2916
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 110 place count 1248 transition count 2916
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 129 place count 1229 transition count 2848
Iterating global reduction 2 with 19 rules applied. Total rules applied 148 place count 1229 transition count 2848
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 148 place count 1229 transition count 2844
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 1225 transition count 2844
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 1213 transition count 2769
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 1213 transition count 2769
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1210 transition count 2745
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1210 transition count 2745
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 240 place count 1183 transition count 2718
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 1177 transition count 2712
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 1177 transition count 2712
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 1171 transition count 2664
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 1171 transition count 2664
Applied a total of 264 rules in 318 ms. Remains 1171 /1303 variables (removed 132) and now considering 2664/2971 (removed 307) transitions.
[2024-05-24 19:24:43] [INFO ] Flow matrix only has 2392 transitions (discarded 272 similar events)
// Phase 1: matrix 2392 rows 1171 cols
[2024-05-24 19:24:43] [INFO ] Computed 66 invariants in 34 ms
[2024-05-24 19:24:44] [INFO ] Implicit Places using invariants in 1048 ms returned [9, 94, 354, 465, 495, 506, 516, 541, 564, 663, 712, 746, 780, 825, 826, 926, 977]
[2024-05-24 19:24:44] [INFO ] Actually due to overlaps returned [495, 9, 94, 354, 465, 516, 541, 564, 663, 712, 746, 780, 825, 826, 926, 977]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1155/1303 places, 2664/2971 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1145 transition count 2654
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1145 transition count 2654
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1135 transition count 2644
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1135 transition count 2644
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 1126 transition count 2572
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 1126 transition count 2572
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1121 transition count 2567
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 1116 transition count 2562
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 1116 transition count 2562
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1111 transition count 2522
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1111 transition count 2522
Applied a total of 88 rules in 269 ms. Remains 1111 /1155 variables (removed 44) and now considering 2522/2664 (removed 142) transitions.
[2024-05-24 19:24:44] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1111 cols
[2024-05-24 19:24:44] [INFO ] Computed 50 invariants in 32 ms
[2024-05-24 19:24:45] [INFO ] Implicit Places using invariants in 1000 ms returned [493]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1303 places, 2522/2971 transitions.
Applied a total of 0 rules in 62 ms. Remains 1110 /1110 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2701 ms. Remains : 1110/1303 places, 2522/2971 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 2769 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)&&F(p1)))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2810
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 1253 transition count 2746
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 1253 transition count 2746
Applied a total of 100 rules in 132 ms. Remains 1253 /1303 variables (removed 50) and now considering 2746/2971 (removed 225) transitions.
[2024-05-24 19:24:45] [INFO ] Flow matrix only has 2474 transitions (discarded 272 similar events)
// Phase 1: matrix 2474 rows 1253 cols
[2024-05-24 19:24:46] [INFO ] Computed 66 invariants in 39 ms
[2024-05-24 19:24:47] [INFO ] Implicit Places using invariants in 1158 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 766, 800, 837, 882, 883, 987]
[2024-05-24 19:24:47] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 766, 800, 837, 882, 883, 987]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1160 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2746/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2732
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2718
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2718
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 1197 transition count 2705
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 1197 transition count 2705
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 1185 transition count 2609
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 1185 transition count 2609
Applied a total of 106 rules in 155 ms. Remains 1185 /1238 variables (removed 53) and now considering 2609/2746 (removed 137) transitions.
[2024-05-24 19:24:47] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
// Phase 1: matrix 2337 rows 1185 cols
[2024-05-24 19:24:47] [INFO ] Computed 51 invariants in 28 ms
[2024-05-24 19:24:48] [INFO ] Implicit Places using invariants in 1044 ms returned [534]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1184/1303 places, 2609/2971 transitions.
Applied a total of 0 rules in 30 ms. Remains 1184 /1184 variables (removed 0) and now considering 2609/2609 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2526 ms. Remains : 1184/1303 places, 2609/2971 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
Stuttering criterion allowed to conclude after 161 steps with 1 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 finished in 2723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2810
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 1253 transition count 2746
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 1253 transition count 2746
Applied a total of 100 rules in 126 ms. Remains 1253 /1303 variables (removed 50) and now considering 2746/2971 (removed 225) transitions.
[2024-05-24 19:24:48] [INFO ] Flow matrix only has 2474 transitions (discarded 272 similar events)
// Phase 1: matrix 2474 rows 1253 cols
[2024-05-24 19:24:48] [INFO ] Computed 66 invariants in 37 ms
[2024-05-24 19:24:49] [INFO ] Implicit Places using invariants in 1131 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 803, 840, 885, 886, 990, 1043]
[2024-05-24 19:24:49] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 803, 840, 885, 886, 990, 1043]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1133 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2746/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2732
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2718
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2718
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1196 transition count 2704
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1196 transition count 2704
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1183 transition count 2600
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1183 transition count 2600
Applied a total of 110 rules in 152 ms. Remains 1183 /1238 variables (removed 55) and now considering 2600/2746 (removed 146) transitions.
[2024-05-24 19:24:49] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1183 cols
[2024-05-24 19:24:50] [INFO ] Computed 51 invariants in 23 ms
[2024-05-24 19:24:51] [INFO ] Implicit Places using invariants in 1045 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1303 places, 2600/2971 transitions.
Applied a total of 0 rules in 30 ms. Remains 1182 /1182 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2487 ms. Remains : 1182/1303 places, 2600/2971 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 finished in 2645 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)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2818
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2818
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1254 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1254 transition count 2754
Applied a total of 98 rules in 179 ms. Remains 1254 /1303 variables (removed 49) and now considering 2754/2971 (removed 217) transitions.
[2024-05-24 19:24:51] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1254 cols
[2024-05-24 19:24:51] [INFO ] Computed 66 invariants in 35 ms
[2024-05-24 19:24:52] [INFO ] Implicit Places using invariants in 1141 ms returned [12, 106, 394, 508, 539, 551, 561, 588, 613, 717, 768, 802, 839, 884, 885, 990, 1043]
[2024-05-24 19:24:52] [INFO ] Actually due to overlaps returned [539, 12, 106, 394, 508, 561, 588, 613, 717, 768, 802, 839, 884, 885, 990, 1043]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1143 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2754/2971 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1223 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1223 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1208 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1208 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1193 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1193 transition count 2709
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1179 transition count 2597
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1179 transition count 2597
Applied a total of 118 rules in 153 ms. Remains 1179 /1238 variables (removed 59) and now considering 2597/2754 (removed 157) transitions.
[2024-05-24 19:24:52] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1179 cols
[2024-05-24 19:24:52] [INFO ] Computed 50 invariants in 26 ms
[2024-05-24 19:24:53] [INFO ] Implicit Places using invariants in 1009 ms returned [534]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1303 places, 2597/2971 transitions.
Applied a total of 0 rules in 30 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2515 ms. Remains : 1178/1303 places, 2597/2971 transitions.
Stuttering acceptance computed with spot in 161 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Product exploration explored 100000 steps with 1204 reset in 393 ms.
Product exploration explored 100000 steps with 1204 reset in 413 ms.
Computed a total of 346 stabilizing places and 964 stable transitions
Computed a total of 346 stabilizing places and 964 stable transitions
Detected a total of 346/1178 stabilizing places and 964/2597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 264 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (481 resets) in 546 ms. (73 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (136 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
[2024-05-24 19:24:55] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2024-05-24 19:24:55] [INFO ] Computed 49 invariants in 21 ms
[2024-05-24 19:24:55] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1103 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:24:56] [INFO ] Deduced a trap composed of 658 places in 493 ms of which 7 ms to minimize.
[2024-05-24 19:24:56] [INFO ] Deduced a trap composed of 654 places in 494 ms of which 8 ms to minimize.
[2024-05-24 19:24:57] [INFO ] Deduced a trap composed of 650 places in 473 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1136 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:24:57] [INFO ] Deduced a trap composed of 139 places in 571 ms of which 7 ms to minimize.
[2024-05-24 19:24:58] [INFO ] Deduced a trap composed of 94 places in 554 ms of which 8 ms to minimize.
[2024-05-24 19:24:59] [INFO ] Deduced a trap composed of 110 places in 548 ms of which 7 ms to minimize.
[2024-05-24 19:24:59] [INFO ] Deduced a trap composed of 82 places in 559 ms of which 7 ms to minimize.
[2024-05-24 19:25:00] [INFO ] Deduced a trap composed of 98 places in 565 ms of which 7 ms to minimize.
[2024-05-24 19:25:00] [INFO ] Deduced a trap composed of 134 places in 546 ms of which 8 ms to minimize.
SMT process timed out in 5358ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 62 place count 1147 transition count 2549
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 1130 transition count 2549
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1128 transition count 2540
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1128 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1127 transition count 2539
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1127 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1126 transition count 2531
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1126 transition count 2531
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 138 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 269 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 400 place count 978 transition count 4273
Applied a total of 400 rules in 385 ms. Remains 978 /1178 variables (removed 200) and now considering 4273/2597 (removed -1676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 978/1178 places, 4273/2597 transitions.
RANDOM walk for 40000 steps (840 resets) in 885 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (121 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 72733 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 72733 steps, saw 30628 distinct states, run finished after 3014 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 19:25:04] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:25:04] [INFO ] Computed 49 invariants in 31 ms
[2024-05-24 19:25:04] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:25:05] [INFO ] Deduced a trap composed of 100 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:25:05] [INFO ] Deduced a trap composed of 490 places in 605 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2898 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:25:08] [INFO ] Deduced a trap composed of 5 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:25:08] [INFO ] Deduced a trap composed of 46 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:25:09] [INFO ] Deduced a trap composed of 62 places in 534 ms of which 5 ms to minimize.
[2024-05-24 19:25:09] [INFO ] Deduced a trap composed of 75 places in 534 ms of which 6 ms to minimize.
[2024-05-24 19:25:10] [INFO ] Deduced a trap composed of 75 places in 524 ms of which 6 ms to minimize.
[2024-05-24 19:25:10] [INFO ] Deduced a trap composed of 162 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:25:11] [INFO ] Deduced a trap composed of 148 places in 524 ms of which 6 ms to minimize.
[2024-05-24 19:25:11] [INFO ] Deduced a trap composed of 177 places in 503 ms of which 6 ms to minimize.
[2024-05-24 19:25:12] [INFO ] Deduced a trap composed of 27 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:25:13] [INFO ] Deduced a trap composed of 182 places in 541 ms of which 7 ms to minimize.
[2024-05-24 19:25:13] [INFO ] Deduced a trap composed of 178 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:25:14] [INFO ] Deduced a trap composed of 171 places in 521 ms of which 7 ms to minimize.
[2024-05-24 19:25:14] [INFO ] Deduced a trap composed of 179 places in 516 ms of which 6 ms to minimize.
[2024-05-24 19:25:15] [INFO ] Deduced a trap composed of 179 places in 529 ms of which 6 ms to minimize.
[2024-05-24 19:25:15] [INFO ] Deduced a trap composed of 90 places in 519 ms of which 7 ms to minimize.
[2024-05-24 19:25:16] [INFO ] Deduced a trap composed of 160 places in 533 ms of which 6 ms to minimize.
[2024-05-24 19:25:16] [INFO ] Deduced a trap composed of 94 places in 532 ms of which 6 ms to minimize.
[2024-05-24 19:25:17] [INFO ] Deduced a trap composed of 172 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:25:17] [INFO ] Deduced a trap composed of 85 places in 503 ms of which 6 ms to minimize.
[2024-05-24 19:25:18] [INFO ] Deduced a trap composed of 176 places in 547 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:25:18] [INFO ] Deduced a trap composed of 165 places in 508 ms of which 7 ms to minimize.
[2024-05-24 19:25:19] [INFO ] Deduced a trap composed of 94 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:25:19] [INFO ] Deduced a trap composed of 173 places in 493 ms of which 6 ms to minimize.
[2024-05-24 19:25:20] [INFO ] Deduced a trap composed of 85 places in 496 ms of which 6 ms to minimize.
[2024-05-24 19:25:21] [INFO ] Deduced a trap composed of 211 places in 501 ms of which 6 ms to minimize.
[2024-05-24 19:25:21] [INFO ] Deduced a trap composed of 207 places in 534 ms of which 6 ms to minimize.
[2024-05-24 19:25:22] [INFO ] Deduced a trap composed of 233 places in 509 ms of which 5 ms to minimize.
[2024-05-24 19:25:22] [INFO ] Deduced a trap composed of 214 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:25:23] [INFO ] Deduced a trap composed of 214 places in 505 ms of which 6 ms to minimize.
[2024-05-24 19:25:23] [INFO ] Deduced a trap composed of 214 places in 487 ms of which 7 ms to minimize.
[2024-05-24 19:25:24] [INFO ] Deduced a trap composed of 164 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:25:24] [INFO ] Deduced a trap composed of 210 places in 492 ms of which 6 ms to minimize.
[2024-05-24 19:25:25] [INFO ] Deduced a trap composed of 218 places in 491 ms of which 6 ms to minimize.
[2024-05-24 19:25:25] [INFO ] Deduced a trap composed of 106 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:25:26] [INFO ] Deduced a trap composed of 198 places in 521 ms of which 7 ms to minimize.
[2024-05-24 19:25:26] [INFO ] Deduced a trap composed of 192 places in 500 ms of which 5 ms to minimize.
[2024-05-24 19:25:27] [INFO ] Deduced a trap composed of 224 places in 521 ms of which 5 ms to minimize.
[2024-05-24 19:25:27] [INFO ] Deduced a trap composed of 191 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:25:28] [INFO ] Deduced a trap composed of 196 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:25:28] [INFO ] Deduced a trap composed of 201 places in 515 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:25:29] [INFO ] Deduced a trap composed of 92 places in 498 ms of which 6 ms to minimize.
[2024-05-24 19:25:30] [INFO ] Deduced a trap composed of 217 places in 503 ms of which 6 ms to minimize.
[2024-05-24 19:25:30] [INFO ] Deduced a trap composed of 94 places in 482 ms of which 5 ms to minimize.
[2024-05-24 19:25:31] [INFO ] Deduced a trap composed of 219 places in 526 ms of which 6 ms to minimize.
[2024-05-24 19:25:31] [INFO ] Deduced a trap composed of 94 places in 476 ms of which 5 ms to minimize.
[2024-05-24 19:25:32] [INFO ] Deduced a trap composed of 76 places in 578 ms of which 6 ms to minimize.
[2024-05-24 19:25:32] [INFO ] Deduced a trap composed of 203 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:25:33] [INFO ] Deduced a trap composed of 79 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:25:33] [INFO ] Deduced a trap composed of 198 places in 508 ms of which 6 ms to minimize.
[2024-05-24 19:25:34] [INFO ] Deduced a trap composed of 193 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:25:34] [INFO ] Deduced a trap composed of 208 places in 498 ms of which 6 ms to minimize.
[2024-05-24 19:25:35] [INFO ] Deduced a trap composed of 203 places in 520 ms of which 5 ms to minimize.
[2024-05-24 19:25:35] [INFO ] Deduced a trap composed of 193 places in 490 ms of which 6 ms to minimize.
[2024-05-24 19:25:36] [INFO ] Deduced a trap composed of 147 places in 464 ms of which 5 ms to minimize.
[2024-05-24 19:25:36] [INFO ] Deduced a trap composed of 193 places in 470 ms of which 6 ms to minimize.
[2024-05-24 19:25:37] [INFO ] Deduced a trap composed of 226 places in 463 ms of which 5 ms to minimize.
[2024-05-24 19:25:37] [INFO ] Deduced a trap composed of 209 places in 490 ms of which 6 ms to minimize.
[2024-05-24 19:25:38] [INFO ] Deduced a trap composed of 209 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:25:38] [INFO ] Deduced a trap composed of 94 places in 476 ms of which 5 ms to minimize.
[2024-05-24 19:25:39] [INFO ] Deduced a trap composed of 94 places in 495 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:25:39] [INFO ] Deduced a trap composed of 207 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:25:40] [INFO ] Deduced a trap composed of 209 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:25:40] [INFO ] Deduced a trap composed of 206 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:25:41] [INFO ] Deduced a trap composed of 191 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:25:42] [INFO ] Deduced a trap composed of 199 places in 533 ms of which 6 ms to minimize.
[2024-05-24 19:25:42] [INFO ] Deduced a trap composed of 203 places in 525 ms of which 7 ms to minimize.
[2024-05-24 19:25:43] [INFO ] Deduced a trap composed of 192 places in 478 ms of which 6 ms to minimize.
[2024-05-24 19:25:43] [INFO ] Deduced a trap composed of 198 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:25:44] [INFO ] Deduced a trap composed of 95 places in 510 ms of which 5 ms to minimize.
[2024-05-24 19:25:44] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:25:45] [INFO ] Deduced a trap composed of 185 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:25:45] [INFO ] Deduced a trap composed of 71 places in 475 ms of which 5 ms to minimize.
[2024-05-24 19:25:46] [INFO ] Deduced a trap composed of 120 places in 499 ms of which 6 ms to minimize.
[2024-05-24 19:25:46] [INFO ] Deduced a trap composed of 137 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:25:47] [INFO ] Deduced a trap composed of 57 places in 488 ms of which 5 ms to minimize.
[2024-05-24 19:25:47] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 5 ms to minimize.
[2024-05-24 19:25:48] [INFO ] Deduced a trap composed of 88 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:25:48] [INFO ] Deduced a trap composed of 169 places in 488 ms of which 5 ms to minimize.
[2024-05-24 19:25:49] [INFO ] Deduced a trap composed of 236 places in 490 ms of which 5 ms to minimize.
[2024-05-24 19:25:49] [INFO ] Deduced a trap composed of 148 places in 487 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:25:50] [INFO ] Deduced a trap composed of 150 places in 508 ms of which 6 ms to minimize.
[2024-05-24 19:25:50] [INFO ] Deduced a trap composed of 191 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:25:51] [INFO ] Deduced a trap composed of 97 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:25:51] [INFO ] Deduced a trap composed of 183 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:25:52] [INFO ] Deduced a trap composed of 120 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:25:52] [INFO ] Deduced a trap composed of 211 places in 488 ms of which 6 ms to minimize.
SMT process timed out in 48481ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 110 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 108 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:25:53] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:25:53] [INFO ] Invariant cache hit.
[2024-05-24 19:25:54] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2024-05-24 19:25:54] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:25:54] [INFO ] Invariant cache hit.
[2024-05-24 19:25:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:26:25] [INFO ] Performed 885/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:26:33] [INFO ] Implicit Places using invariants and state equation in 39231 ms returned []
Implicit Place search using SMT with State Equation took 40468 ms to find 0 implicit places.
[2024-05-24 19:26:33] [INFO ] Redundant transitions in 229 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:26:33] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:26:33] [INFO ] Invariant cache hit.
[2024-05-24 19:26:33] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 59375ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 59413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100238 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 444 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 89 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1178 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 : 1178/1178 places, 2597/2597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1147 transition count 2550
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1131 transition count 2550
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 130 place count 1113 transition count 2532
Applied a total of 130 rules in 125 ms. Remains 1113 /1178 variables (removed 65) and now considering 2532/2597 (removed 65) transitions.
[2024-05-24 19:27:34] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-24 19:27:34] [INFO ] Computed 49 invariants in 24 ms
[2024-05-24 19:27:35] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2024-05-24 19:27:35] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:27:35] [INFO ] Invariant cache hit.
[2024-05-24 19:27:35] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:27:46] [INFO ] Implicit Places using invariants and state equation in 11571 ms returned []
Implicit Place search using SMT with State Equation took 12579 ms to find 0 implicit places.
[2024-05-24 19:27:46] [INFO ] Redundant transitions in 80 ms returned []
Running 2515 sub problems to find dead transitions.
[2024-05-24 19:27:46] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:27:46] [INFO ] Invariant cache hit.
[2024-05-24 19:27:46] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2515 unsolved
SMT process timed out in 33075ms, After SMT, problems are : Problem set: 0 solved, 2515 unsolved
Search for dead transitions found 0 dead transitions in 33099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1113/1178 places, 2532/2597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45898 ms. Remains : 1113/1178 places, 2532/2597 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 126 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 73 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (684 resets) in 253 ms. (157 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2024-05-24 19:28:20] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:28:20] [INFO ] Invariant cache hit.
[2024-05-24 19:28:20] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:28:20] [INFO ] Deduced a trap composed of 601 places in 442 ms of which 6 ms to minimize.
[2024-05-24 19:28:21] [INFO ] Deduced a trap composed of 601 places in 446 ms of which 6 ms to minimize.
[2024-05-24 19:28:21] [INFO ] Deduced a trap composed of 601 places in 439 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2011 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:28:23] [INFO ] Deduced a trap composed of 47 places in 470 ms of which 7 ms to minimize.
[2024-05-24 19:28:23] [INFO ] Deduced a trap composed of 153 places in 497 ms of which 7 ms to minimize.
[2024-05-24 19:28:24] [INFO ] Deduced a trap composed of 246 places in 467 ms of which 7 ms to minimize.
[2024-05-24 19:28:24] [INFO ] Deduced a trap composed of 93 places in 485 ms of which 7 ms to minimize.
[2024-05-24 19:28:25] [INFO ] Deduced a trap composed of 182 places in 474 ms of which 7 ms to minimize.
[2024-05-24 19:28:25] [INFO ] Deduced a trap composed of 249 places in 466 ms of which 6 ms to minimize.
[2024-05-24 19:28:26] [INFO ] Deduced a trap composed of 187 places in 475 ms of which 7 ms to minimize.
[2024-05-24 19:28:26] [INFO ] Deduced a trap composed of 179 places in 487 ms of which 7 ms to minimize.
[2024-05-24 19:28:27] [INFO ] Deduced a trap composed of 132 places in 472 ms of which 7 ms to minimize.
[2024-05-24 19:28:27] [INFO ] Deduced a trap composed of 154 places in 476 ms of which 7 ms to minimize.
SMT process timed out in 7537ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 370 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (840 resets) in 798 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71949 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71949 steps, saw 30303 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 19:28:31] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:28:31] [INFO ] Computed 49 invariants in 33 ms
[2024-05-24 19:28:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:28:32] [INFO ] Deduced a trap composed of 188 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:28:32] [INFO ] Deduced a trap composed of 132 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:28:33] [INFO ] Deduced a trap composed of 112 places in 583 ms of which 5 ms to minimize.
[2024-05-24 19:28:33] [INFO ] Deduced a trap composed of 183 places in 599 ms of which 5 ms to minimize.
[2024-05-24 19:28:34] [INFO ] Deduced a trap composed of 288 places in 568 ms of which 5 ms to minimize.
[2024-05-24 19:28:35] [INFO ] Deduced a trap composed of 101 places in 564 ms of which 5 ms to minimize.
[2024-05-24 19:28:35] [INFO ] Deduced a trap composed of 329 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:28:36] [INFO ] Deduced a trap composed of 126 places in 586 ms of which 5 ms to minimize.
[2024-05-24 19:28:36] [INFO ] Deduced a trap composed of 89 places in 585 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:28:37] [INFO ] Deduced a trap composed of 5 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:28:38] [INFO ] Deduced a trap composed of 27 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:28:38] [INFO ] Deduced a trap composed of 77 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:28:39] [INFO ] Deduced a trap composed of 80 places in 645 ms of which 6 ms to minimize.
[2024-05-24 19:28:40] [INFO ] Deduced a trap composed of 46 places in 620 ms of which 5 ms to minimize.
[2024-05-24 19:28:40] [INFO ] Deduced a trap composed of 74 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:28:41] [INFO ] Deduced a trap composed of 79 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:28:42] [INFO ] Deduced a trap composed of 69 places in 619 ms of which 5 ms to minimize.
[2024-05-24 19:28:42] [INFO ] Deduced a trap composed of 75 places in 617 ms of which 5 ms to minimize.
[2024-05-24 19:28:43] [INFO ] Deduced a trap composed of 96 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:28:44] [INFO ] Deduced a trap composed of 68 places in 643 ms of which 6 ms to minimize.
[2024-05-24 19:28:44] [INFO ] Deduced a trap composed of 69 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:28:45] [INFO ] Deduced a trap composed of 74 places in 574 ms of which 6 ms to minimize.
[2024-05-24 19:28:45] [INFO ] Deduced a trap composed of 74 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:28:46] [INFO ] Deduced a trap composed of 85 places in 554 ms of which 5 ms to minimize.
[2024-05-24 19:28:47] [INFO ] Deduced a trap composed of 80 places in 568 ms of which 5 ms to minimize.
[2024-05-24 19:28:47] [INFO ] Deduced a trap composed of 71 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:28:48] [INFO ] Deduced a trap composed of 72 places in 569 ms of which 6 ms to minimize.
[2024-05-24 19:28:48] [INFO ] Deduced a trap composed of 82 places in 572 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/962 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/978 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3875/4853 variables, 978/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 2722/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4853 variables, 0/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4853 variables, 0/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3777 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19133 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:28:51] [INFO ] Deduced a trap composed of 314 places in 509 ms of which 5 ms to minimize.
[2024-05-24 19:28:51] [INFO ] Deduced a trap composed of 124 places in 522 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/936 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:28:52] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:28:52] [INFO ] Deduced a trap composed of 75 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:28:53] [INFO ] Deduced a trap composed of 66 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:28:54] [INFO ] Deduced a trap composed of 89 places in 568 ms of which 6 ms to minimize.
[2024-05-24 19:28:54] [INFO ] Deduced a trap composed of 83 places in 583 ms of which 5 ms to minimize.
[2024-05-24 19:28:55] [INFO ] Deduced a trap composed of 92 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:28:55] [INFO ] Deduced a trap composed of 83 places in 597 ms of which 5 ms to minimize.
[2024-05-24 19:28:56] [INFO ] Deduced a trap composed of 88 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:28:57] [INFO ] Deduced a trap composed of 91 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:28:57] [INFO ] Deduced a trap composed of 67 places in 568 ms of which 6 ms to minimize.
[2024-05-24 19:28:58] [INFO ] Deduced a trap composed of 65 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:28:58] [INFO ] Deduced a trap composed of 89 places in 563 ms of which 5 ms to minimize.
[2024-05-24 19:28:59] [INFO ] Deduced a trap composed of 78 places in 563 ms of which 5 ms to minimize.
[2024-05-24 19:28:59] [INFO ] Deduced a trap composed of 89 places in 563 ms of which 5 ms to minimize.
[2024-05-24 19:29:00] [INFO ] Deduced a trap composed of 75 places in 556 ms of which 5 ms to minimize.
[2024-05-24 19:29:01] [INFO ] Deduced a trap composed of 79 places in 560 ms of which 5 ms to minimize.
[2024-05-24 19:29:01] [INFO ] Deduced a trap composed of 106 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:29:02] [INFO ] Deduced a trap composed of 85 places in 562 ms of which 6 ms to minimize.
[2024-05-24 19:29:02] [INFO ] Deduced a trap composed of 82 places in 558 ms of which 6 ms to minimize.
[2024-05-24 19:29:03] [INFO ] Deduced a trap composed of 46 places in 561 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:29:04] [INFO ] Deduced a trap composed of 112 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:29:04] [INFO ] Deduced a trap composed of 75 places in 545 ms of which 6 ms to minimize.
[2024-05-24 19:29:05] [INFO ] Deduced a trap composed of 82 places in 555 ms of which 6 ms to minimize.
[2024-05-24 19:29:05] [INFO ] Deduced a trap composed of 46 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:29:06] [INFO ] Deduced a trap composed of 67 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:29:06] [INFO ] Deduced a trap composed of 71 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:29:07] [INFO ] Deduced a trap composed of 57 places in 565 ms of which 6 ms to minimize.
[2024-05-24 19:29:08] [INFO ] Deduced a trap composed of 62 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:29:08] [INFO ] Deduced a trap composed of 83 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:29:09] [INFO ] Deduced a trap composed of 88 places in 574 ms of which 6 ms to minimize.
[2024-05-24 19:29:09] [INFO ] Deduced a trap composed of 130 places in 578 ms of which 5 ms to minimize.
[2024-05-24 19:29:10] [INFO ] Deduced a trap composed of 66 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:29:11] [INFO ] Deduced a trap composed of 78 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:29:11] [INFO ] Deduced a trap composed of 79 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:29:12] [INFO ] Deduced a trap composed of 83 places in 564 ms of which 6 ms to minimize.
[2024-05-24 19:29:12] [INFO ] Deduced a trap composed of 83 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:29:13] [INFO ] Deduced a trap composed of 74 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:29:14] [INFO ] Deduced a trap composed of 73 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:29:14] [INFO ] Deduced a trap composed of 87 places in 562 ms of which 6 ms to minimize.
[2024-05-24 19:29:15] [INFO ] Deduced a trap composed of 87 places in 570 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:29:15] [INFO ] Deduced a trap composed of 87 places in 556 ms of which 6 ms to minimize.
[2024-05-24 19:29:16] [INFO ] Deduced a trap composed of 80 places in 554 ms of which 5 ms to minimize.
[2024-05-24 19:29:17] [INFO ] Deduced a trap composed of 59 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:29:17] [INFO ] Deduced a trap composed of 108 places in 548 ms of which 5 ms to minimize.
[2024-05-24 19:29:18] [INFO ] Deduced a trap composed of 89 places in 562 ms of which 7 ms to minimize.
[2024-05-24 19:29:18] [INFO ] Deduced a trap composed of 79 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:29:19] [INFO ] Deduced a trap composed of 104 places in 566 ms of which 5 ms to minimize.
[2024-05-24 19:29:19] [INFO ] Deduced a trap composed of 75 places in 558 ms of which 5 ms to minimize.
[2024-05-24 19:29:20] [INFO ] Deduced a trap composed of 100 places in 539 ms of which 6 ms to minimize.
[2024-05-24 19:29:21] [INFO ] Deduced a trap composed of 75 places in 558 ms of which 5 ms to minimize.
[2024-05-24 19:29:21] [INFO ] Deduced a trap composed of 71 places in 547 ms of which 6 ms to minimize.
[2024-05-24 19:29:22] [INFO ] Deduced a trap composed of 74 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:29:22] [INFO ] Deduced a trap composed of 85 places in 541 ms of which 6 ms to minimize.
[2024-05-24 19:29:23] [INFO ] Deduced a trap composed of 97 places in 560 ms of which 5 ms to minimize.
[2024-05-24 19:29:23] [INFO ] Deduced a trap composed of 58 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:29:24] [INFO ] Deduced a trap composed of 75 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:29:25] [INFO ] Deduced a trap composed of 94 places in 546 ms of which 5 ms to minimize.
[2024-05-24 19:29:25] [INFO ] Deduced a trap composed of 56 places in 584 ms of which 5 ms to minimize.
[2024-05-24 19:29:26] [INFO ] Deduced a trap composed of 71 places in 569 ms of which 6 ms to minimize.
[2024-05-24 19:29:26] [INFO ] Deduced a trap composed of 71 places in 573 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:29:27] [INFO ] Deduced a trap composed of 90 places in 551 ms of which 5 ms to minimize.
[2024-05-24 19:29:28] [INFO ] Deduced a trap composed of 76 places in 577 ms of which 6 ms to minimize.
[2024-05-24 19:29:28] [INFO ] Deduced a trap composed of 89 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:29:29] [INFO ] Deduced a trap composed of 85 places in 569 ms of which 5 ms to minimize.
[2024-05-24 19:29:29] [INFO ] Deduced a trap composed of 93 places in 561 ms of which 5 ms to minimize.
[2024-05-24 19:29:30] [INFO ] Deduced a trap composed of 97 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:29:31] [INFO ] Deduced a trap composed of 56 places in 572 ms of which 5 ms to minimize.
[2024-05-24 19:29:31] [INFO ] Deduced a trap composed of 72 places in 568 ms of which 5 ms to minimize.
[2024-05-24 19:29:32] [INFO ] Deduced a trap composed of 90 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:29:32] [INFO ] Deduced a trap composed of 92 places in 565 ms of which 6 ms to minimize.
[2024-05-24 19:29:33] [INFO ] Deduced a trap composed of 98 places in 545 ms of which 6 ms to minimize.
[2024-05-24 19:29:34] [INFO ] Deduced a trap composed of 98 places in 578 ms of which 5 ms to minimize.
[2024-05-24 19:29:34] [INFO ] Deduced a trap composed of 73 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:29:35] [INFO ] Deduced a trap composed of 82 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:29:35] [INFO ] Deduced a trap composed of 59 places in 547 ms of which 6 ms to minimize.
SMT process timed out in 64465ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 109 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 107 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:29:35] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:29:35] [INFO ] Invariant cache hit.
[2024-05-24 19:29:37] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2024-05-24 19:29:37] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:29:37] [INFO ] Invariant cache hit.
[2024-05-24 19:29:38] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:30:08] [INFO ] Performed 657/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:30:22] [INFO ] Implicit Places using invariants and state equation in 45594 ms returned []
Implicit Place search using SMT with State Equation took 46812 ms to find 0 implicit places.
[2024-05-24 19:30:23] [INFO ] Redundant transitions in 226 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:30:23] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:30:23] [INFO ] Invariant cache hit.
[2024-05-24 19:30:23] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 61454ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 61492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108658 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 229 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 81 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1711 reset in 523 ms.
Product exploration explored 100000 steps with 1712 reset in 526 ms.
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 164 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2024-05-24 19:31:26] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-24 19:31:26] [INFO ] Computed 49 invariants in 22 ms
[2024-05-24 19:31:27] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-24 19:31:27] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-24 19:31:27] [INFO ] Invariant cache hit.
[2024-05-24 19:31:27] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:31:38] [INFO ] Implicit Places using invariants and state equation in 11727 ms returned [1107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12702 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1113 places, 2522/2532 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 1109 transition count 2521
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 1108 transition count 2521
Applied a total of 2 rules in 71 ms. Remains 1108 /1109 variables (removed 1) and now considering 2521/2522 (removed 1) transitions.
[2024-05-24 19:31:39] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
// Phase 1: matrix 2249 rows 1108 cols
[2024-05-24 19:31:39] [INFO ] Computed 48 invariants in 27 ms
[2024-05-24 19:31:39] [INFO ] Implicit Places using invariants in 954 ms returned []
[2024-05-24 19:31:39] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
[2024-05-24 19:31:39] [INFO ] Invariant cache hit.
[2024-05-24 19:31:40] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:31:50] [INFO ] Implicit Places using invariants and state equation in 10341 ms returned []
Implicit Place search using SMT with State Equation took 11297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1113 places, 2521/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24237 ms. Remains : 1108/1113 places, 2521/2532 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 419179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(!p1)) U ((X(!p1)&&p2)||G((!p0&&X(!p1)))))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1280 transition count 2906
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1280 transition count 2906
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 63 place count 1263 transition count 2833
Iterating global reduction 0 with 17 rules applied. Total rules applied 80 place count 1263 transition count 2833
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 1254 transition count 2761
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 1254 transition count 2761
Applied a total of 98 rules in 128 ms. Remains 1254 /1303 variables (removed 49) and now considering 2761/2971 (removed 210) transitions.
[2024-05-24 19:31:50] [INFO ] Flow matrix only has 2489 transitions (discarded 272 similar events)
// Phase 1: matrix 2489 rows 1254 cols
[2024-05-24 19:31:50] [INFO ] Computed 66 invariants in 35 ms
[2024-05-24 19:31:51] [INFO ] Implicit Places using invariants in 1128 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 718, 769, 803, 841, 886, 887, 991, 1044]
[2024-05-24 19:31:51] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 718, 769, 803, 841, 886, 887, 991, 1044]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1130 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1239/1303 places, 2761/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1225 transition count 2747
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1225 transition count 2747
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1211 transition count 2733
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1211 transition count 2733
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1197 transition count 2719
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1197 transition count 2719
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1184 transition count 2615
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1184 transition count 2615
Applied a total of 110 rules in 160 ms. Remains 1184 /1239 variables (removed 55) and now considering 2615/2761 (removed 146) transitions.
[2024-05-24 19:31:51] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
// Phase 1: matrix 2343 rows 1184 cols
[2024-05-24 19:31:51] [INFO ] Computed 51 invariants in 29 ms
[2024-05-24 19:31:52] [INFO ] Implicit Places using invariants in 1004 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1303 places, 2615/2971 transitions.
Applied a total of 0 rules in 32 ms. Remains 1183 /1183 variables (removed 0) and now considering 2615/2615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2456 ms. Remains : 1183/1303 places, 2615/2971 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 741 ms.
Product exploration explored 100000 steps with 50000 reset in 805 ms.
Computed a total of 351 stabilizing places and 982 stable transitions
Computed a total of 351 stabilizing places and 982 stable transitions
Detected a total of 351/1183 stabilizing places and 982/2615 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (OR p2 (NOT p0))), (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p1)), (X (X p2)), (X (X (OR p2 (NOT p0)))), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 635 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 finished in 4766 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(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 1231 transition count 2850
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 1231 transition count 2850
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 144 place count 1231 transition count 2847
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 1228 transition count 2847
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 161 place count 1217 transition count 2780
Iterating global reduction 2 with 11 rules applied. Total rules applied 172 place count 1217 transition count 2780
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 1214 transition count 2756
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 1214 transition count 2756
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 234 place count 1186 transition count 2728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1180 transition count 2722
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1180 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 252 place count 1174 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 1174 transition count 2674
Applied a total of 258 rules in 311 ms. Remains 1174 /1303 variables (removed 129) and now considering 2674/2971 (removed 297) transitions.
[2024-05-24 19:31:55] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1174 cols
[2024-05-24 19:31:55] [INFO ] Computed 66 invariants in 34 ms
[2024-05-24 19:31:56] [INFO ] Implicit Places using invariants in 1039 ms returned [9, 358, 470, 500, 511, 521, 546, 569, 668, 717, 751, 785, 830, 831, 931, 982]
[2024-05-24 19:31:56] [INFO ] Actually due to overlaps returned [500, 9, 358, 470, 521, 546, 569, 668, 717, 751, 785, 830, 831, 931, 982]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1042 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1159/1303 places, 2674/2971 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1151 transition count 2666
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1151 transition count 2666
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1143 transition count 2658
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1143 transition count 2658
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1136 transition count 2602
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1136 transition count 2602
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1130 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1124 transition count 2590
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1124 transition count 2590
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1118 transition count 2542
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1118 transition count 2542
Applied a total of 82 rules in 248 ms. Remains 1118 /1159 variables (removed 41) and now considering 2542/2674 (removed 132) transitions.
[2024-05-24 19:31:57] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1118 cols
[2024-05-24 19:31:57] [INFO ] Computed 51 invariants in 30 ms
[2024-05-24 19:31:58] [INFO ] Implicit Places using invariants in 998 ms returned [501]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1117/1303 places, 2542/2971 transitions.
Applied a total of 0 rules in 41 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2646 ms. Remains : 1117/1303 places, 2542/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Product exploration explored 100000 steps with 1708 reset in 494 ms.
Product exploration explored 100000 steps with 1711 reset in 566 ms.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 32327 steps (550 resets) in 257 ms. (125 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 299 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 30 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 19:32:00] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2024-05-24 19:32:00] [INFO ] Computed 50 invariants in 24 ms
[2024-05-24 19:32:01] [INFO ] Implicit Places using invariants in 970 ms returned []
[2024-05-24 19:32:01] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:32:01] [INFO ] Invariant cache hit.
[2024-05-24 19:32:01] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 19:32:12] [INFO ] Implicit Places using invariants and state equation in 11107 ms returned []
Implicit Place search using SMT with State Equation took 12078 ms to find 0 implicit places.
Running 2525 sub problems to find dead transitions.
[2024-05-24 19:32:12] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:32:12] [INFO ] Invariant cache hit.
[2024-05-24 19:32:12] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.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 1.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 1.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 1.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 1.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 1.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 1.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 1.0)
(s108 1.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 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32699ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32720ms
Finished structural reductions in LTL mode , in 1 iterations and 44834 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 31388 steps (536 resets) in 258 ms. (121 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1710 reset in 529 ms.
Product exploration explored 100000 steps with 1711 reset in 526 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 68 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 19:32:47] [INFO ] Redundant transitions in 77 ms returned []
Running 2525 sub problems to find dead transitions.
[2024-05-24 19:32:47] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:32:47] [INFO ] Invariant cache hit.
[2024-05-24 19:32:47] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 33004ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 33030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33185 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 31 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 19:33:20] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:33:20] [INFO ] Invariant cache hit.
[2024-05-24 19:33:21] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-24 19:33:21] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:33:21] [INFO ] Invariant cache hit.
[2024-05-24 19:33:22] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 19:33:32] [INFO ] Implicit Places using invariants and state equation in 11513 ms returned []
Implicit Place search using SMT with State Equation took 12482 ms to find 0 implicit places.
Running 2525 sub problems to find dead transitions.
[2024-05-24 19:33:32] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:33:32] [INFO ] Invariant cache hit.
[2024-05-24 19:33:32] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.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 1.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 1.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 1.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 1.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 1.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 1.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 1.0)
(s108 1.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 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32904ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32926ms
Finished structural reductions in LTL mode , in 1 iterations and 45444 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 130734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(F(p2))))||p0))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 1230 transition count 2842
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 1230 transition count 2842
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 1230 transition count 2839
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1227 transition count 2839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1213 transition count 2748
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1213 transition count 2748
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 232 place count 1187 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 238 place count 1181 transition count 2716
Iterating global reduction 2 with 6 rules applied. Total rules applied 244 place count 1181 transition count 2716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 1175 transition count 2668
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 1175 transition count 2668
Applied a total of 256 rules in 295 ms. Remains 1175 /1303 variables (removed 128) and now considering 2668/2971 (removed 303) transitions.
[2024-05-24 19:34:06] [INFO ] Flow matrix only has 2396 transitions (discarded 272 similar events)
// Phase 1: matrix 2396 rows 1175 cols
[2024-05-24 19:34:06] [INFO ] Computed 66 invariants in 28 ms
[2024-05-24 19:34:07] [INFO ] Implicit Places using invariants in 1081 ms returned [9, 95, 355, 466, 496, 507, 517, 542, 565, 665, 714, 748, 830, 831, 932, 983]
[2024-05-24 19:34:07] [INFO ] Actually due to overlaps returned [496, 9, 95, 355, 466, 517, 542, 565, 665, 714, 748, 830, 831, 932, 983]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1160/1303 places, 2668/2971 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1152 transition count 2660
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1152 transition count 2660
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1144 transition count 2652
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1144 transition count 2652
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1137 transition count 2596
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1137 transition count 2596
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1131 transition count 2590
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1125 transition count 2584
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1125 transition count 2584
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1119 transition count 2536
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1119 transition count 2536
Applied a total of 82 rules in 308 ms. Remains 1119 /1160 variables (removed 41) and now considering 2536/2668 (removed 132) transitions.
[2024-05-24 19:34:07] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1119 cols
[2024-05-24 19:34:07] [INFO ] Computed 51 invariants in 34 ms
[2024-05-24 19:34:09] [INFO ] Implicit Places using invariants in 1660 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1662 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1118/1303 places, 2536/2971 transitions.
Applied a total of 0 rules in 49 ms. Remains 1118 /1118 variables (removed 0) and now considering 2536/2536 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 3398 ms. Remains : 1118/1303 places, 2536/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Product exploration explored 100000 steps with 1714 reset in 587 ms.
Product exploration explored 100000 steps with 1712 reset in 509 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1118 stabilizing places and 918/2536 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 170 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (685 resets) in 426 ms. (93 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 351 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (148 resets) in 320 ms. (124 steps per ms) remains 4/4 properties
[2024-05-24 19:34:11] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-24 19:34:11] [INFO ] Computed 50 invariants in 20 ms
[2024-05-24 19:34:11] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1035/1043 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1045 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1078 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1102 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/1118 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2264/3382 variables, 1118/1168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3382 variables, 846/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3382 variables, 0/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3382 variables, 0/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3382/3382 variables, and 2014 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1758 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1118/1118 constraints, ReadFeed: 846/846 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1035/1043 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:34:13] [INFO ] Deduced a trap composed of 114 places in 448 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1043 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1045 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1045 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1078 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:34:14] [INFO ] Deduced a trap composed of 47 places in 471 ms of which 6 ms to minimize.
[2024-05-24 19:34:15] [INFO ] Deduced a trap composed of 90 places in 480 ms of which 6 ms to minimize.
[2024-05-24 19:34:15] [INFO ] Deduced a trap composed of 120 places in 441 ms of which 6 ms to minimize.
[2024-05-24 19:34:16] [INFO ] Deduced a trap composed of 182 places in 548 ms of which 12 ms to minimize.
[2024-05-24 19:34:16] [INFO ] Deduced a trap composed of 110 places in 457 ms of which 7 ms to minimize.
[2024-05-24 19:34:17] [INFO ] Deduced a trap composed of 74 places in 504 ms of which 7 ms to minimize.
[2024-05-24 19:34:17] [INFO ] Deduced a trap composed of 92 places in 465 ms of which 7 ms to minimize.
[2024-05-24 19:34:18] [INFO ] Deduced a trap composed of 173 places in 479 ms of which 7 ms to minimize.
[2024-05-24 19:34:18] [INFO ] Deduced a trap composed of 61 places in 479 ms of which 6 ms to minimize.
SMT process timed out in 7216ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1118 transition count 4293
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 999 transition count 4293
Applied a total of 238 rules in 203 ms. Remains 999 /1118 variables (removed 119) and now considering 4293/2536 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 999/1118 places, 4293/2536 transitions.
RANDOM walk for 40000 steps (839 resets) in 2060 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 443 ms. (90 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 391 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 366 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 438 ms. (91 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 58992 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 4
Probabilistic random walk after 58992 steps, saw 24891 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 19:34:22] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
// Phase 1: matrix 3909 rows 999 cols
[2024-05-24 19:34:22] [INFO ] Computed 50 invariants in 34 ms
[2024-05-24 19:34:23] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 645/653 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/655 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/959 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/983 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/999 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/999 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3909/4908 variables, 999/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4908 variables, 2722/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4908/4908 variables, and 3771 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 999/999 constraints, ReadFeed: 2722/2722 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 645/653 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/655 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/959 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:34:26] [INFO ] Deduced a trap composed of 5 places in 676 ms of which 6 ms to minimize.
[2024-05-24 19:34:26] [INFO ] Deduced a trap composed of 76 places in 666 ms of which 6 ms to minimize.
[2024-05-24 19:34:27] [INFO ] Deduced a trap composed of 67 places in 675 ms of which 7 ms to minimize.
[2024-05-24 19:34:28] [INFO ] Deduced a trap composed of 65 places in 660 ms of which 6 ms to minimize.
[2024-05-24 19:34:29] [INFO ] Deduced a trap composed of 69 places in 693 ms of which 7 ms to minimize.
[2024-05-24 19:34:29] [INFO ] Deduced a trap composed of 76 places in 674 ms of which 6 ms to minimize.
[2024-05-24 19:34:30] [INFO ] Deduced a trap composed of 90 places in 663 ms of which 7 ms to minimize.
[2024-05-24 19:34:31] [INFO ] Deduced a trap composed of 166 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:34:31] [INFO ] Deduced a trap composed of 73 places in 692 ms of which 6 ms to minimize.
[2024-05-24 19:34:32] [INFO ] Deduced a trap composed of 182 places in 681 ms of which 7 ms to minimize.
[2024-05-24 19:34:33] [INFO ] Deduced a trap composed of 185 places in 694 ms of which 6 ms to minimize.
[2024-05-24 19:34:33] [INFO ] Deduced a trap composed of 186 places in 683 ms of which 6 ms to minimize.
[2024-05-24 19:34:34] [INFO ] Deduced a trap composed of 67 places in 687 ms of which 6 ms to minimize.
[2024-05-24 19:34:35] [INFO ] Deduced a trap composed of 68 places in 680 ms of which 6 ms to minimize.
[2024-05-24 19:34:36] [INFO ] Deduced a trap composed of 72 places in 694 ms of which 6 ms to minimize.
[2024-05-24 19:34:36] [INFO ] Deduced a trap composed of 72 places in 670 ms of which 7 ms to minimize.
[2024-05-24 19:34:37] [INFO ] Deduced a trap composed of 71 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:34:38] [INFO ] Deduced a trap composed of 61 places in 684 ms of which 6 ms to minimize.
[2024-05-24 19:34:38] [INFO ] Deduced a trap composed of 132 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:34:39] [INFO ] Deduced a trap composed of 81 places in 627 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:34:40] [INFO ] Deduced a trap composed of 27 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:34:40] [INFO ] Deduced a trap composed of 87 places in 653 ms of which 6 ms to minimize.
[2024-05-24 19:34:41] [INFO ] Deduced a trap composed of 65 places in 658 ms of which 6 ms to minimize.
[2024-05-24 19:34:42] [INFO ] Deduced a trap composed of 56 places in 651 ms of which 6 ms to minimize.
[2024-05-24 19:34:42] [INFO ] Deduced a trap composed of 56 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:34:43] [INFO ] Deduced a trap composed of 74 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:34:44] [INFO ] Deduced a trap composed of 27 places in 625 ms of which 6 ms to minimize.
[2024-05-24 19:34:44] [INFO ] Deduced a trap composed of 56 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:34:45] [INFO ] Deduced a trap composed of 56 places in 584 ms of which 6 ms to minimize.
[2024-05-24 19:34:46] [INFO ] Deduced a trap composed of 57 places in 587 ms of which 5 ms to minimize.
[2024-05-24 19:34:46] [INFO ] Deduced a trap composed of 68 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:34:47] [INFO ] Deduced a trap composed of 95 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:34:47] [INFO ] Deduced a trap composed of 92 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:34:48] [INFO ] Deduced a trap composed of 77 places in 659 ms of which 7 ms to minimize.
[2024-05-24 19:34:49] [INFO ] Deduced a trap composed of 70 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:34:49] [INFO ] Deduced a trap composed of 73 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:34:50] [INFO ] Deduced a trap composed of 97 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:34:51] [INFO ] Deduced a trap composed of 56 places in 640 ms of which 6 ms to minimize.
[2024-05-24 19:34:51] [INFO ] Deduced a trap composed of 86 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:34:52] [INFO ] Deduced a trap composed of 81 places in 628 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:34:53] [INFO ] Deduced a trap composed of 87 places in 636 ms of which 5 ms to minimize.
[2024-05-24 19:34:53] [INFO ] Deduced a trap composed of 85 places in 653 ms of which 7 ms to minimize.
[2024-05-24 19:34:54] [INFO ] Deduced a trap composed of 76 places in 661 ms of which 7 ms to minimize.
[2024-05-24 19:34:55] [INFO ] Deduced a trap composed of 58 places in 674 ms of which 7 ms to minimize.
[2024-05-24 19:34:56] [INFO ] Deduced a trap composed of 223 places in 683 ms of which 6 ms to minimize.
[2024-05-24 19:34:56] [INFO ] Deduced a trap composed of 57 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:34:57] [INFO ] Deduced a trap composed of 86 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:34:58] [INFO ] Deduced a trap composed of 55 places in 682 ms of which 7 ms to minimize.
[2024-05-24 19:34:58] [INFO ] Deduced a trap composed of 93 places in 657 ms of which 7 ms to minimize.
[2024-05-24 19:34:59] [INFO ] Deduced a trap composed of 208 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:35:00] [INFO ] Deduced a trap composed of 55 places in 671 ms of which 6 ms to minimize.
[2024-05-24 19:35:00] [INFO ] Deduced a trap composed of 212 places in 683 ms of which 7 ms to minimize.
[2024-05-24 19:35:01] [INFO ] Deduced a trap composed of 61 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:35:02] [INFO ] Deduced a trap composed of 79 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:35:02] [INFO ] Deduced a trap composed of 60 places in 653 ms of which 6 ms to minimize.
[2024-05-24 19:35:03] [INFO ] Deduced a trap composed of 86 places in 585 ms of which 6 ms to minimize.
[2024-05-24 19:35:04] [INFO ] Deduced a trap composed of 186 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:35:04] [INFO ] Deduced a trap composed of 66 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:35:05] [INFO ] Deduced a trap composed of 186 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:35:05] [INFO ] Deduced a trap composed of 55 places in 659 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:35:06] [INFO ] Deduced a trap composed of 88 places in 619 ms of which 5 ms to minimize.
[2024-05-24 19:35:07] [INFO ] Deduced a trap composed of 75 places in 632 ms of which 5 ms to minimize.
[2024-05-24 19:35:07] [INFO ] Deduced a trap composed of 97 places in 646 ms of which 7 ms to minimize.
[2024-05-24 19:35:08] [INFO ] Deduced a trap composed of 75 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:35:09] [INFO ] Deduced a trap composed of 77 places in 648 ms of which 6 ms to minimize.
[2024-05-24 19:35:09] [INFO ] Deduced a trap composed of 100 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:35:10] [INFO ] Deduced a trap composed of 194 places in 639 ms of which 6 ms to minimize.
SMT process timed out in 47615ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 126 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 999/999 places, 4293/4293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 123 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-24 19:35:10] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:35:10] [INFO ] Invariant cache hit.
[2024-05-24 19:35:12] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2024-05-24 19:35:12] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:35:12] [INFO ] Invariant cache hit.
[2024-05-24 19:35:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:35:43] [INFO ] Performed 734/999 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:35:55] [INFO ] Implicit Places using invariants and state equation in 43335 ms returned []
Implicit Place search using SMT with State Equation took 44610 ms to find 0 implicit places.
[2024-05-24 19:35:55] [INFO ] Redundant transitions in 230 ms returned []
Running 4231 sub problems to find dead transitions.
[2024-05-24 19:35:55] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:35:55] [INFO ] Invariant cache hit.
[2024-05-24 19:35:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4231 unsolved
SMT process timed out in 59444ms, After SMT, problems are : Problem set: 0 solved, 4231 unsolved
Search for dead transitions found 0 dead transitions in 59481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104463 ms. Remains : 999/999 places, 4293/4293 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 314 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Applied a total of 0 rules in 73 ms. Remains 1118 /1118 variables (removed 0) and now considering 2536/2536 (removed 0) transitions.
[2024-05-24 19:36:55] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-24 19:36:55] [INFO ] Computed 50 invariants in 25 ms
[2024-05-24 19:36:57] [INFO ] Implicit Places using invariants in 1632 ms returned []
[2024-05-24 19:36:57] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-24 19:36:57] [INFO ] Invariant cache hit.
[2024-05-24 19:36:58] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:37:09] [INFO ] Implicit Places using invariants and state equation in 11670 ms returned [1111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13311 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1118 places, 2536/2536 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 1117 transition count 2535
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 1116 transition count 2535
Applied a total of 2 rules in 81 ms. Remains 1116 /1117 variables (removed 1) and now considering 2535/2536 (removed 1) transitions.
[2024-05-24 19:37:09] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:37:09] [INFO ] Computed 49 invariants in 25 ms
[2024-05-24 19:37:10] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-05-24 19:37:10] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:37:10] [INFO ] Invariant cache hit.
[2024-05-24 19:37:11] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:37:22] [INFO ] Implicit Places using invariants and state equation in 12078 ms returned []
Implicit Place search using SMT with State Equation took 13066 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1118 places, 2535/2536 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26532 ms. Remains : 1116/1118 places, 2535/2536 transitions.
Computed a total of 299 stabilizing places and 917 stable transitions
Computed a total of 299 stabilizing places and 917 stable transitions
Detected a total of 299/1116 stabilizing places and 917/2535 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 165 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (683 resets) in 1774 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 377 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 595 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 590 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (148 resets) in 347 ms. (114 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
[2024-05-24 19:37:24] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:37:24] [INFO ] Invariant cache hit.
[2024-05-24 19:37:24] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1044 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1044 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1077 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1101 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/1116 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2263/3379 variables, 1116/1165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 846/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2011 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1116/1116 constraints, ReadFeed: 846/846 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:37:26] [INFO ] Deduced a trap composed of 133 places in 495 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1044 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1077 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:37:27] [INFO ] Deduced a trap composed of 98 places in 510 ms of which 8 ms to minimize.
[2024-05-24 19:37:27] [INFO ] Deduced a trap composed of 47 places in 505 ms of which 7 ms to minimize.
[2024-05-24 19:37:28] [INFO ] Deduced a trap composed of 71 places in 505 ms of which 7 ms to minimize.
[2024-05-24 19:37:28] [INFO ] Deduced a trap composed of 93 places in 508 ms of which 7 ms to minimize.
[2024-05-24 19:37:29] [INFO ] Deduced a trap composed of 65 places in 482 ms of which 7 ms to minimize.
[2024-05-24 19:37:29] [INFO ] Deduced a trap composed of 63 places in 476 ms of which 7 ms to minimize.
[2024-05-24 19:37:30] [INFO ] Deduced a trap composed of 230 places in 482 ms of which 7 ms to minimize.
[2024-05-24 19:37:30] [INFO ] Deduced a trap composed of 155 places in 473 ms of which 7 ms to minimize.
SMT process timed out in 6622ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1116 transition count 4292
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 997 transition count 4292
Applied a total of 238 rules in 226 ms. Remains 997 /1116 variables (removed 119) and now considering 4292/2535 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 997/1116 places, 4292/2535 transitions.
RANDOM walk for 40000 steps (840 resets) in 1869 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 355 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 345 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 386 ms. (103 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 57069 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 4
Probabilistic random walk after 57069 steps, saw 24101 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 19:37:34] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
// Phase 1: matrix 3908 rows 997 cols
[2024-05-24 19:37:34] [INFO ] Computed 49 invariants in 33 ms
[2024-05-24 19:37:34] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 644/652 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/652 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/654 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/958 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/982 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/997 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3908/4905 variables, 997/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4905 variables, 2722/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4905/4905 variables, and 3768 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 997/997 constraints, ReadFeed: 2722/2722 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 644/652 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/652 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/654 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/958 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:37:38] [INFO ] Deduced a trap composed of 65 places in 666 ms of which 6 ms to minimize.
[2024-05-24 19:37:38] [INFO ] Deduced a trap composed of 56 places in 639 ms of which 7 ms to minimize.
[2024-05-24 19:37:39] [INFO ] Deduced a trap composed of 57 places in 654 ms of which 6 ms to minimize.
[2024-05-24 19:37:40] [INFO ] Deduced a trap composed of 73 places in 654 ms of which 6 ms to minimize.
[2024-05-24 19:37:40] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 6 ms to minimize.
[2024-05-24 19:37:41] [INFO ] Deduced a trap composed of 68 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:37:42] [INFO ] Deduced a trap composed of 90 places in 639 ms of which 7 ms to minimize.
[2024-05-24 19:37:42] [INFO ] Deduced a trap composed of 71 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:37:43] [INFO ] Deduced a trap composed of 69 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:37:44] [INFO ] Deduced a trap composed of 78 places in 677 ms of which 6 ms to minimize.
[2024-05-24 19:37:44] [INFO ] Deduced a trap composed of 81 places in 654 ms of which 6 ms to minimize.
[2024-05-24 19:37:45] [INFO ] Deduced a trap composed of 67 places in 648 ms of which 6 ms to minimize.
[2024-05-24 19:37:46] [INFO ] Deduced a trap composed of 59 places in 653 ms of which 5 ms to minimize.
[2024-05-24 19:37:46] [INFO ] Deduced a trap composed of 59 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:37:47] [INFO ] Deduced a trap composed of 71 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:37:48] [INFO ] Deduced a trap composed of 130 places in 684 ms of which 6 ms to minimize.
[2024-05-24 19:37:48] [INFO ] Deduced a trap composed of 98 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:37:49] [INFO ] Deduced a trap composed of 78 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:37:50] [INFO ] Deduced a trap composed of 71 places in 663 ms of which 7 ms to minimize.
[2024-05-24 19:37:50] [INFO ] Deduced a trap composed of 74 places in 630 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:37:51] [INFO ] Deduced a trap composed of 73 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:37:52] [INFO ] Deduced a trap composed of 80 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:37:52] [INFO ] Deduced a trap composed of 85 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:37:53] [INFO ] Deduced a trap composed of 71 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:37:54] [INFO ] Deduced a trap composed of 66 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:37:54] [INFO ] Deduced a trap composed of 73 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:37:55] [INFO ] Deduced a trap composed of 80 places in 647 ms of which 6 ms to minimize.
[2024-05-24 19:37:56] [INFO ] Deduced a trap composed of 78 places in 627 ms of which 5 ms to minimize.
[2024-05-24 19:37:56] [INFO ] Deduced a trap composed of 60 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:37:57] [INFO ] Deduced a trap composed of 70 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:37:58] [INFO ] Deduced a trap composed of 78 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:37:58] [INFO ] Deduced a trap composed of 73 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:37:59] [INFO ] Deduced a trap composed of 76 places in 700 ms of which 5 ms to minimize.
[2024-05-24 19:38:00] [INFO ] Deduced a trap composed of 90 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:38:00] [INFO ] Deduced a trap composed of 91 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:38:01] [INFO ] Deduced a trap composed of 83 places in 657 ms of which 7 ms to minimize.
[2024-05-24 19:38:02] [INFO ] Deduced a trap composed of 58 places in 738 ms of which 6 ms to minimize.
[2024-05-24 19:38:02] [INFO ] Deduced a trap composed of 60 places in 669 ms of which 6 ms to minimize.
[2024-05-24 19:38:03] [INFO ] Deduced a trap composed of 77 places in 667 ms of which 7 ms to minimize.
[2024-05-24 19:38:04] [INFO ] Deduced a trap composed of 74 places in 659 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:38:05] [INFO ] Deduced a trap composed of 55 places in 647 ms of which 7 ms to minimize.
[2024-05-24 19:38:05] [INFO ] Deduced a trap composed of 58 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:38:06] [INFO ] Deduced a trap composed of 76 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:38:06] [INFO ] Deduced a trap composed of 86 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:38:07] [INFO ] Deduced a trap composed of 73 places in 654 ms of which 6 ms to minimize.
[2024-05-24 19:38:08] [INFO ] Deduced a trap composed of 115 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:38:09] [INFO ] Deduced a trap composed of 61 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:38:09] [INFO ] Deduced a trap composed of 58 places in 656 ms of which 6 ms to minimize.
[2024-05-24 19:38:10] [INFO ] Deduced a trap composed of 67 places in 636 ms of which 7 ms to minimize.
[2024-05-24 19:38:11] [INFO ] Deduced a trap composed of 71 places in 658 ms of which 7 ms to minimize.
[2024-05-24 19:38:11] [INFO ] Deduced a trap composed of 73 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:38:12] [INFO ] Deduced a trap composed of 60 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:38:13] [INFO ] Deduced a trap composed of 59 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:38:13] [INFO ] Deduced a trap composed of 61 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:38:14] [INFO ] Deduced a trap composed of 68 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:38:14] [INFO ] Deduced a trap composed of 62 places in 630 ms of which 7 ms to minimize.
[2024-05-24 19:38:15] [INFO ] Deduced a trap composed of 61 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:38:16] [INFO ] Deduced a trap composed of 61 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:38:16] [INFO ] Deduced a trap composed of 71 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:38:17] [INFO ] Deduced a trap composed of 86 places in 630 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/958 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:38:18] [INFO ] Deduced a trap composed of 93 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:38:18] [INFO ] Deduced a trap composed of 95 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:38:19] [INFO ] Deduced a trap composed of 87 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:38:20] [INFO ] Deduced a trap composed of 69 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:38:20] [INFO ] Deduced a trap composed of 69 places in 659 ms of which 7 ms to minimize.
[2024-05-24 19:38:21] [INFO ] Deduced a trap composed of 76 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:38:22] [INFO ] Deduced a trap composed of 82 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:38:22] [INFO ] Deduced a trap composed of 92 places in 625 ms of which 6 ms to minimize.
SMT process timed out in 47912ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 111 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 997/997 places, 4292/4292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 110 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
[2024-05-24 19:38:23] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:38:23] [INFO ] Invariant cache hit.
[2024-05-24 19:38:24] [INFO ] Implicit Places using invariants in 1283 ms returned []
[2024-05-24 19:38:24] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:38:24] [INFO ] Invariant cache hit.
[2024-05-24 19:38:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:38:54] [INFO ] Implicit Places using invariants and state equation in 29857 ms returned []
Implicit Place search using SMT with State Equation took 31141 ms to find 0 implicit places.
[2024-05-24 19:38:54] [INFO ] Redundant transitions in 212 ms returned []
Running 4230 sub problems to find dead transitions.
[2024-05-24 19:38:54] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:38:54] [INFO ] Invariant cache hit.
[2024-05-24 19:38:54] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4230 unsolved
SMT process timed out in 59804ms, After SMT, problems are : Problem set: 0 solved, 4230 unsolved
Search for dead transitions found 0 dead transitions in 59845ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91331 ms. Remains : 997/997 places, 4292/4292 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 306 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 537 ms.
Product exploration explored 100000 steps with 1714 reset in 541 ms.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Applied a total of 0 rules in 67 ms. Remains 1116 /1116 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2024-05-24 19:39:56] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:39:56] [INFO ] Computed 49 invariants in 27 ms
[2024-05-24 19:39:57] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-24 19:39:57] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:39:57] [INFO ] Invariant cache hit.
[2024-05-24 19:39:57] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:40:08] [INFO ] Implicit Places using invariants and state equation in 11827 ms returned []
Implicit Place search using SMT with State Equation took 12780 ms to find 0 implicit places.
[2024-05-24 19:40:08] [INFO ] Redundant transitions in 78 ms returned []
Running 2518 sub problems to find dead transitions.
[2024-05-24 19:40:08] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:40:08] [INFO ] Invariant cache hit.
[2024-05-24 19:40:08] [INFO ] State equation strengthened by 846 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.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 1.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 1.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 1.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 1.0)
(s80 1.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.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 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 0.0)
(s756 1.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 1.0)
(s776 1.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 1.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 1.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 1.0)
(s907 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1114 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2518 unsolved
SMT process timed out in 32605ms, After SMT, problems are : Problem set: 0 solved, 2518 unsolved
Search for dead transitions found 0 dead transitions in 32628ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45568 ms. Remains : 1116/1116 places, 2535/2535 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 395775 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)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 1231 transition count 2850
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 1231 transition count 2850
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 144 place count 1231 transition count 2846
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 1227 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 1214 transition count 2756
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 1214 transition count 2756
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 234 place count 1186 transition count 2728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1180 transition count 2722
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1180 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 252 place count 1174 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 1174 transition count 2674
Applied a total of 258 rules in 371 ms. Remains 1174 /1303 variables (removed 129) and now considering 2674/2971 (removed 297) transitions.
[2024-05-24 19:40:42] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1174 cols
[2024-05-24 19:40:42] [INFO ] Computed 66 invariants in 32 ms
[2024-05-24 19:40:43] [INFO ] Implicit Places using invariants in 1085 ms returned [9, 94, 357, 468, 498, 509, 519, 544, 567, 666, 715, 749, 783, 828, 829, 930, 981]
[2024-05-24 19:40:43] [INFO ] Actually due to overlaps returned [498, 9, 94, 357, 468, 519, 544, 567, 666, 715, 749, 783, 828, 829, 930, 981]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1087 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1158/1303 places, 2674/2971 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1148 transition count 2664
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1148 transition count 2664
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1138 transition count 2654
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1138 transition count 2654
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 1129 transition count 2582
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 1129 transition count 2582
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1124 transition count 2577
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 1119 transition count 2572
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 1119 transition count 2572
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1114 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1114 transition count 2532
Applied a total of 88 rules in 338 ms. Remains 1114 /1158 variables (removed 44) and now considering 2532/2674 (removed 142) transitions.
[2024-05-24 19:40:43] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1114 cols
[2024-05-24 19:40:43] [INFO ] Computed 50 invariants in 29 ms
[2024-05-24 19:40:44] [INFO ] Implicit Places using invariants in 999 ms returned [496]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1113/1303 places, 2532/2971 transitions.
Applied a total of 0 rules in 55 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2853 ms. Remains : 1113/1303 places, 2532/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Product exploration explored 100000 steps with 1715 reset in 580 ms.
Product exploration explored 100000 steps with 1711 reset in 595 ms.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 260 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (684 resets) in 935 ms. (42 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2024-05-24 19:40:46] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-24 19:40:46] [INFO ] Computed 49 invariants in 21 ms
[2024-05-24 19:40:46] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:40:47] [INFO ] Deduced a trap composed of 154 places in 467 ms of which 7 ms to minimize.
[2024-05-24 19:40:47] [INFO ] Deduced a trap composed of 163 places in 453 ms of which 6 ms to minimize.
[2024-05-24 19:40:48] [INFO ] Deduced a trap composed of 153 places in 460 ms of which 7 ms to minimize.
[2024-05-24 19:40:48] [INFO ] Deduced a trap composed of 155 places in 457 ms of which 6 ms to minimize.
[2024-05-24 19:40:49] [INFO ] Deduced a trap composed of 207 places in 452 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2013 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3380 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:40:50] [INFO ] Deduced a trap composed of 47 places in 478 ms of which 7 ms to minimize.
[2024-05-24 19:40:51] [INFO ] Deduced a trap composed of 167 places in 460 ms of which 6 ms to minimize.
[2024-05-24 19:40:51] [INFO ] Deduced a trap composed of 206 places in 509 ms of which 7 ms to minimize.
[2024-05-24 19:40:52] [INFO ] Deduced a trap composed of 187 places in 504 ms of which 8 ms to minimize.
[2024-05-24 19:40:52] [INFO ] Deduced a trap composed of 157 places in 485 ms of which 7 ms to minimize.
[2024-05-24 19:40:53] [INFO ] Deduced a trap composed of 164 places in 472 ms of which 7 ms to minimize.
[2024-05-24 19:40:53] [INFO ] Deduced a trap composed of 199 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:40:54] [INFO ] Deduced a trap composed of 205 places in 479 ms of which 7 ms to minimize.
[2024-05-24 19:40:54] [INFO ] Deduced a trap composed of 189 places in 477 ms of which 7 ms to minimize.
[2024-05-24 19:40:55] [INFO ] Deduced a trap composed of 209 places in 470 ms of which 6 ms to minimize.
SMT process timed out in 8646ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 399 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (838 resets) in 857 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (119 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 72491 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 72491 steps, saw 30529 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 19:40:59] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:40:59] [INFO ] Computed 49 invariants in 32 ms
[2024-05-24 19:40:59] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:40:59] [INFO ] Deduced a trap composed of 228 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:41:00] [INFO ] Deduced a trap composed of 447 places in 558 ms of which 5 ms to minimize.
[2024-05-24 19:41:01] [INFO ] Deduced a trap composed of 490 places in 553 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:03] [INFO ] Deduced a trap composed of 27 places in 517 ms of which 6 ms to minimize.
[2024-05-24 19:41:03] [INFO ] Deduced a trap composed of 112 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:41:04] [INFO ] Deduced a trap composed of 46 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:41:04] [INFO ] Deduced a trap composed of 126 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:41:05] [INFO ] Deduced a trap composed of 122 places in 552 ms of which 9 ms to minimize.
[2024-05-24 19:41:05] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 5 ms to minimize.
[2024-05-24 19:41:06] [INFO ] Deduced a trap composed of 57 places in 553 ms of which 7 ms to minimize.
[2024-05-24 19:41:06] [INFO ] Deduced a trap composed of 157 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:41:07] [INFO ] Deduced a trap composed of 88 places in 548 ms of which 6 ms to minimize.
[2024-05-24 19:41:08] [INFO ] Deduced a trap composed of 62 places in 556 ms of which 6 ms to minimize.
[2024-05-24 19:41:08] [INFO ] Deduced a trap composed of 143 places in 535 ms of which 6 ms to minimize.
[2024-05-24 19:41:09] [INFO ] Deduced a trap composed of 75 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:41:09] [INFO ] Deduced a trap composed of 149 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:41:10] [INFO ] Deduced a trap composed of 154 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:41:10] [INFO ] Deduced a trap composed of 152 places in 538 ms of which 6 ms to minimize.
[2024-05-24 19:41:11] [INFO ] Deduced a trap composed of 155 places in 505 ms of which 6 ms to minimize.
[2024-05-24 19:41:11] [INFO ] Deduced a trap composed of 139 places in 491 ms of which 6 ms to minimize.
[2024-05-24 19:41:12] [INFO ] Deduced a trap composed of 150 places in 512 ms of which 6 ms to minimize.
[2024-05-24 19:41:12] [INFO ] Deduced a trap composed of 155 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:41:13] [INFO ] Deduced a trap composed of 161 places in 505 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:14] [INFO ] Deduced a trap composed of 172 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:41:14] [INFO ] Deduced a trap composed of 75 places in 499 ms of which 6 ms to minimize.
[2024-05-24 19:41:15] [INFO ] Deduced a trap composed of 195 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:41:15] [INFO ] Deduced a trap composed of 169 places in 506 ms of which 6 ms to minimize.
[2024-05-24 19:41:16] [INFO ] Deduced a trap composed of 90 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:41:16] [INFO ] Deduced a trap composed of 94 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:41:17] [INFO ] Deduced a trap composed of 85 places in 505 ms of which 6 ms to minimize.
[2024-05-24 19:41:17] [INFO ] Deduced a trap composed of 71 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:41:18] [INFO ] Deduced a trap composed of 166 places in 541 ms of which 6 ms to minimize.
[2024-05-24 19:41:18] [INFO ] Deduced a trap composed of 97 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:41:19] [INFO ] Deduced a trap composed of 110 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:41:19] [INFO ] Deduced a trap composed of 104 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:41:20] [INFO ] Deduced a trap composed of 117 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:41:20] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:41:21] [INFO ] Deduced a trap composed of 92 places in 502 ms of which 6 ms to minimize.
[2024-05-24 19:41:21] [INFO ] Deduced a trap composed of 115 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:41:22] [INFO ] Deduced a trap composed of 94 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:41:23] [INFO ] Deduced a trap composed of 92 places in 516 ms of which 6 ms to minimize.
[2024-05-24 19:41:23] [INFO ] Deduced a trap composed of 94 places in 492 ms of which 6 ms to minimize.
[2024-05-24 19:41:24] [INFO ] Deduced a trap composed of 94 places in 495 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:24] [INFO ] Deduced a trap composed of 101 places in 493 ms of which 6 ms to minimize.
[2024-05-24 19:41:25] [INFO ] Deduced a trap composed of 168 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:41:25] [INFO ] Deduced a trap composed of 94 places in 524 ms of which 6 ms to minimize.
[2024-05-24 19:41:26] [INFO ] Deduced a trap composed of 207 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:41:26] [INFO ] Deduced a trap composed of 209 places in 540 ms of which 6 ms to minimize.
[2024-05-24 19:41:27] [INFO ] Deduced a trap composed of 208 places in 538 ms of which 9 ms to minimize.
[2024-05-24 19:41:27] [INFO ] Deduced a trap composed of 207 places in 537 ms of which 6 ms to minimize.
[2024-05-24 19:41:28] [INFO ] Deduced a trap composed of 159 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:41:28] [INFO ] Deduced a trap composed of 94 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:41:29] [INFO ] Deduced a trap composed of 240 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:41:30] [INFO ] Deduced a trap composed of 215 places in 555 ms of which 6 ms to minimize.
[2024-05-24 19:41:30] [INFO ] Deduced a trap composed of 260 places in 537 ms of which 7 ms to minimize.
[2024-05-24 19:41:31] [INFO ] Deduced a trap composed of 219 places in 537 ms of which 6 ms to minimize.
[2024-05-24 19:41:31] [INFO ] Deduced a trap composed of 94 places in 502 ms of which 6 ms to minimize.
[2024-05-24 19:41:32] [INFO ] Deduced a trap composed of 126 places in 501 ms of which 6 ms to minimize.
[2024-05-24 19:41:32] [INFO ] Deduced a trap composed of 129 places in 497 ms of which 6 ms to minimize.
[2024-05-24 19:41:33] [INFO ] Deduced a trap composed of 101 places in 498 ms of which 5 ms to minimize.
[2024-05-24 19:41:33] [INFO ] Deduced a trap composed of 103 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:41:34] [INFO ] Deduced a trap composed of 101 places in 532 ms of which 6 ms to minimize.
[2024-05-24 19:41:34] [INFO ] Deduced a trap composed of 103 places in 507 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:35] [INFO ] Deduced a trap composed of 95 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:41:35] [INFO ] Deduced a trap composed of 106 places in 512 ms of which 6 ms to minimize.
[2024-05-24 19:41:36] [INFO ] Deduced a trap composed of 108 places in 511 ms of which 6 ms to minimize.
[2024-05-24 19:41:37] [INFO ] Deduced a trap composed of 85 places in 541 ms of which 6 ms to minimize.
[2024-05-24 19:41:37] [INFO ] Deduced a trap composed of 120 places in 521 ms of which 6 ms to minimize.
[2024-05-24 19:41:38] [INFO ] Deduced a trap composed of 168 places in 526 ms of which 5 ms to minimize.
[2024-05-24 19:41:38] [INFO ] Deduced a trap composed of 157 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:41:39] [INFO ] Deduced a trap composed of 206 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:41:39] [INFO ] Deduced a trap composed of 165 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:41:40] [INFO ] Deduced a trap composed of 173 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:41:41] [INFO ] Deduced a trap composed of 173 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:41:41] [INFO ] Deduced a trap composed of 158 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:41:42] [INFO ] Deduced a trap composed of 70 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:41:42] [INFO ] Deduced a trap composed of 85 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:41:43] [INFO ] Deduced a trap composed of 85 places in 550 ms of which 6 ms to minimize.
[2024-05-24 19:41:43] [INFO ] Deduced a trap composed of 191 places in 517 ms of which 7 ms to minimize.
[2024-05-24 19:41:44] [INFO ] Deduced a trap composed of 159 places in 550 ms of which 6 ms to minimize.
[2024-05-24 19:41:45] [INFO ] Deduced a trap composed of 113 places in 527 ms of which 6 ms to minimize.
[2024-05-24 19:41:45] [INFO ] Deduced a trap composed of 174 places in 508 ms of which 6 ms to minimize.
[2024-05-24 19:41:46] [INFO ] Deduced a trap composed of 212 places in 499 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:41:46] [INFO ] Deduced a trap composed of 183 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:41:47] [INFO ] Deduced a trap composed of 92 places in 503 ms of which 6 ms to minimize.
[2024-05-24 19:41:47] [INFO ] Deduced a trap composed of 94 places in 498 ms of which 6 ms to minimize.
SMT process timed out in 48803ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 114 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 109 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:41:48] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:41:48] [INFO ] Invariant cache hit.
[2024-05-24 19:41:49] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2024-05-24 19:41:49] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:41:49] [INFO ] Invariant cache hit.
[2024-05-24 19:41:50] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:42:20] [INFO ] Performed 599/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:42:35] [INFO ] Implicit Places using invariants and state equation in 46259 ms returned []
Implicit Place search using SMT with State Equation took 47515 ms to find 0 implicit places.
[2024-05-24 19:42:35] [INFO ] Redundant transitions in 196 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:42:35] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:42:35] [INFO ] Invariant cache hit.
[2024-05-24 19:42:35] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 61040ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 61077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108916 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 446 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 86 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1113 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 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 72 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2024-05-24 19:43:37] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-24 19:43:37] [INFO ] Computed 49 invariants in 27 ms
[2024-05-24 19:43:38] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-05-24 19:43:38] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:43:38] [INFO ] Invariant cache hit.
[2024-05-24 19:43:39] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:43:50] [INFO ] Implicit Places using invariants and state equation in 11966 ms returned []
Implicit Place search using SMT with State Equation took 12955 ms to find 0 implicit places.
[2024-05-24 19:43:50] [INFO ] Redundant transitions in 77 ms returned []
Running 2515 sub problems to find dead transitions.
[2024-05-24 19:43:50] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:43:50] [INFO ] Invariant cache hit.
[2024-05-24 19:43:50] [INFO ] State equation strengthened by 846 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.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 1.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 1.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 1.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 1.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 1.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 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.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 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2515 unsolved
SMT process timed out in 32693ms, After SMT, problems are : Problem set: 0 solved, 2515 unsolved
Search for dead transitions found 0 dead transitions in 32719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45841 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (682 resets) in 788 ms. (50 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2024-05-24 19:44:23] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:44:23] [INFO ] Invariant cache hit.
[2024-05-24 19:44:23] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:44:24] [INFO ] Deduced a trap composed of 180 places in 450 ms of which 7 ms to minimize.
[2024-05-24 19:44:25] [INFO ] Deduced a trap composed of 167 places in 454 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2010 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:44:26] [INFO ] Deduced a trap composed of 163 places in 460 ms of which 6 ms to minimize.
[2024-05-24 19:44:27] [INFO ] Deduced a trap composed of 181 places in 450 ms of which 7 ms to minimize.
[2024-05-24 19:44:27] [INFO ] Deduced a trap composed of 207 places in 458 ms of which 7 ms to minimize.
[2024-05-24 19:44:28] [INFO ] Deduced a trap composed of 188 places in 453 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1038 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/1071 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:44:28] [INFO ] Deduced a trap composed of 103 places in 498 ms of which 7 ms to minimize.
[2024-05-24 19:44:29] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 7 ms to minimize.
[2024-05-24 19:44:29] [INFO ] Deduced a trap composed of 47 places in 476 ms of which 7 ms to minimize.
[2024-05-24 19:44:30] [INFO ] Deduced a trap composed of 89 places in 494 ms of which 7 ms to minimize.
[2024-05-24 19:44:30] [INFO ] Deduced a trap composed of 87 places in 480 ms of which 7 ms to minimize.
[2024-05-24 19:44:31] [INFO ] Deduced a trap composed of 105 places in 462 ms of which 7 ms to minimize.
SMT process timed out in 7129ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 370 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (840 resets) in 806 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (121 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 73260 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 73260 steps, saw 30842 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 19:44:34] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:44:34] [INFO ] Computed 49 invariants in 32 ms
[2024-05-24 19:44:34] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:44:35] [INFO ] Deduced a trap composed of 228 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:44:36] [INFO ] Deduced a trap composed of 447 places in 556 ms of which 5 ms to minimize.
[2024-05-24 19:44:36] [INFO ] Deduced a trap composed of 490 places in 599 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:44:38] [INFO ] Deduced a trap composed of 27 places in 527 ms of which 5 ms to minimize.
[2024-05-24 19:44:39] [INFO ] Deduced a trap composed of 112 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:44:39] [INFO ] Deduced a trap composed of 46 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:44:40] [INFO ] Deduced a trap composed of 126 places in 535 ms of which 7 ms to minimize.
[2024-05-24 19:44:40] [INFO ] Deduced a trap composed of 122 places in 501 ms of which 6 ms to minimize.
[2024-05-24 19:44:41] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:44:41] [INFO ] Deduced a trap composed of 57 places in 526 ms of which 6 ms to minimize.
[2024-05-24 19:44:42] [INFO ] Deduced a trap composed of 157 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:44:43] [INFO ] Deduced a trap composed of 88 places in 525 ms of which 5 ms to minimize.
[2024-05-24 19:44:43] [INFO ] Deduced a trap composed of 62 places in 520 ms of which 5 ms to minimize.
[2024-05-24 19:44:44] [INFO ] Deduced a trap composed of 143 places in 554 ms of which 7 ms to minimize.
[2024-05-24 19:44:44] [INFO ] Deduced a trap composed of 75 places in 497 ms of which 6 ms to minimize.
[2024-05-24 19:44:45] [INFO ] Deduced a trap composed of 149 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:44:45] [INFO ] Deduced a trap composed of 154 places in 536 ms of which 6 ms to minimize.
[2024-05-24 19:44:46] [INFO ] Deduced a trap composed of 152 places in 503 ms of which 7 ms to minimize.
[2024-05-24 19:44:46] [INFO ] Deduced a trap composed of 155 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:44:47] [INFO ] Deduced a trap composed of 139 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:44:47] [INFO ] Deduced a trap composed of 150 places in 536 ms of which 6 ms to minimize.
[2024-05-24 19:44:48] [INFO ] Deduced a trap composed of 155 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:44:49] [INFO ] Deduced a trap composed of 161 places in 550 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:44:49] [INFO ] Deduced a trap composed of 172 places in 522 ms of which 6 ms to minimize.
[2024-05-24 19:44:50] [INFO ] Deduced a trap composed of 75 places in 526 ms of which 6 ms to minimize.
[2024-05-24 19:44:50] [INFO ] Deduced a trap composed of 195 places in 540 ms of which 6 ms to minimize.
[2024-05-24 19:44:51] [INFO ] Deduced a trap composed of 169 places in 541 ms of which 11 ms to minimize.
[2024-05-24 19:44:51] [INFO ] Deduced a trap composed of 90 places in 540 ms of which 6 ms to minimize.
[2024-05-24 19:44:52] [INFO ] Deduced a trap composed of 94 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:44:52] [INFO ] Deduced a trap composed of 85 places in 534 ms of which 6 ms to minimize.
[2024-05-24 19:44:53] [INFO ] Deduced a trap composed of 71 places in 541 ms of which 6 ms to minimize.
[2024-05-24 19:44:54] [INFO ] Deduced a trap composed of 166 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:44:54] [INFO ] Deduced a trap composed of 97 places in 539 ms of which 5 ms to minimize.
[2024-05-24 19:44:55] [INFO ] Deduced a trap composed of 110 places in 549 ms of which 6 ms to minimize.
[2024-05-24 19:44:55] [INFO ] Deduced a trap composed of 104 places in 553 ms of which 7 ms to minimize.
[2024-05-24 19:44:56] [INFO ] Deduced a trap composed of 117 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:44:56] [INFO ] Deduced a trap composed of 5 places in 559 ms of which 7 ms to minimize.
[2024-05-24 19:44:57] [INFO ] Deduced a trap composed of 92 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:44:58] [INFO ] Deduced a trap composed of 115 places in 531 ms of which 6 ms to minimize.
[2024-05-24 19:44:58] [INFO ] Deduced a trap composed of 94 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:44:59] [INFO ] Deduced a trap composed of 92 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:44:59] [INFO ] Deduced a trap composed of 94 places in 550 ms of which 6 ms to minimize.
[2024-05-24 19:45:00] [INFO ] Deduced a trap composed of 94 places in 495 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:45:00] [INFO ] Deduced a trap composed of 101 places in 494 ms of which 6 ms to minimize.
[2024-05-24 19:45:01] [INFO ] Deduced a trap composed of 168 places in 548 ms of which 6 ms to minimize.
[2024-05-24 19:45:01] [INFO ] Deduced a trap composed of 94 places in 547 ms of which 6 ms to minimize.
[2024-05-24 19:45:02] [INFO ] Deduced a trap composed of 207 places in 534 ms of which 5 ms to minimize.
[2024-05-24 19:45:02] [INFO ] Deduced a trap composed of 209 places in 558 ms of which 6 ms to minimize.
[2024-05-24 19:45:03] [INFO ] Deduced a trap composed of 208 places in 565 ms of which 6 ms to minimize.
[2024-05-24 19:45:04] [INFO ] Deduced a trap composed of 207 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:45:04] [INFO ] Deduced a trap composed of 159 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:45:05] [INFO ] Deduced a trap composed of 94 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:45:05] [INFO ] Deduced a trap composed of 240 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:45:06] [INFO ] Deduced a trap composed of 215 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:45:06] [INFO ] Deduced a trap composed of 260 places in 554 ms of which 6 ms to minimize.
[2024-05-24 19:45:07] [INFO ] Deduced a trap composed of 219 places in 550 ms of which 6 ms to minimize.
[2024-05-24 19:45:08] [INFO ] Deduced a trap composed of 94 places in 521 ms of which 6 ms to minimize.
[2024-05-24 19:45:08] [INFO ] Deduced a trap composed of 126 places in 512 ms of which 6 ms to minimize.
[2024-05-24 19:45:09] [INFO ] Deduced a trap composed of 129 places in 510 ms of which 6 ms to minimize.
[2024-05-24 19:45:09] [INFO ] Deduced a trap composed of 101 places in 516 ms of which 6 ms to minimize.
[2024-05-24 19:45:10] [INFO ] Deduced a trap composed of 103 places in 535 ms of which 6 ms to minimize.
[2024-05-24 19:45:10] [INFO ] Deduced a trap composed of 101 places in 530 ms of which 7 ms to minimize.
[2024-05-24 19:45:11] [INFO ] Deduced a trap composed of 103 places in 537 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:45:11] [INFO ] Deduced a trap composed of 95 places in 533 ms of which 6 ms to minimize.
[2024-05-24 19:45:12] [INFO ] Deduced a trap composed of 106 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:45:13] [INFO ] Deduced a trap composed of 108 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:45:13] [INFO ] Deduced a trap composed of 85 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:45:14] [INFO ] Deduced a trap composed of 120 places in 559 ms of which 6 ms to minimize.
[2024-05-24 19:45:14] [INFO ] Deduced a trap composed of 168 places in 538 ms of which 6 ms to minimize.
[2024-05-24 19:45:15] [INFO ] Deduced a trap composed of 157 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:45:15] [INFO ] Deduced a trap composed of 206 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:45:16] [INFO ] Deduced a trap composed of 165 places in 533 ms of which 6 ms to minimize.
[2024-05-24 19:45:17] [INFO ] Deduced a trap composed of 173 places in 547 ms of which 6 ms to minimize.
[2024-05-24 19:45:17] [INFO ] Deduced a trap composed of 173 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:45:18] [INFO ] Deduced a trap composed of 158 places in 548 ms of which 6 ms to minimize.
[2024-05-24 19:45:18] [INFO ] Deduced a trap composed of 70 places in 635 ms of which 5 ms to minimize.
[2024-05-24 19:45:19] [INFO ] Deduced a trap composed of 85 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:45:20] [INFO ] Deduced a trap composed of 85 places in 499 ms of which 5 ms to minimize.
[2024-05-24 19:45:20] [INFO ] Deduced a trap composed of 191 places in 497 ms of which 6 ms to minimize.
[2024-05-24 19:45:21] [INFO ] Deduced a trap composed of 159 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:45:21] [INFO ] Deduced a trap composed of 113 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:45:22] [INFO ] Deduced a trap composed of 174 places in 486 ms of which 6 ms to minimize.
[2024-05-24 19:45:22] [INFO ] Deduced a trap composed of 212 places in 475 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:45:23] [INFO ] Deduced a trap composed of 183 places in 474 ms of which 6 ms to minimize.
SMT process timed out in 48573ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 113 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 111 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:45:23] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:45:23] [INFO ] Invariant cache hit.
[2024-05-24 19:45:24] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2024-05-24 19:45:24] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:45:24] [INFO ] Invariant cache hit.
[2024-05-24 19:45:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:45:55] [INFO ] Performed 601/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:46:09] [INFO ] Implicit Places using invariants and state equation in 45010 ms returned []
Implicit Place search using SMT with State Equation took 46190 ms to find 0 implicit places.
[2024-05-24 19:46:09] [INFO ] Redundant transitions in 192 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:46:09] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:46:09] [INFO ] Invariant cache hit.
[2024-05-24 19:46:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 60140ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106688 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 251 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 71 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 481 ms.
Product exploration explored 100000 steps with 1712 reset in 512 ms.
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 190 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2024-05-24 19:47:11] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-24 19:47:11] [INFO ] Computed 49 invariants in 28 ms
[2024-05-24 19:47:12] [INFO ] Implicit Places using invariants in 921 ms returned []
[2024-05-24 19:47:12] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-24 19:47:12] [INFO ] Invariant cache hit.
[2024-05-24 19:47:13] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:47:23] [INFO ] Implicit Places using invariants and state equation in 11066 ms returned [1103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11992 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1113 places, 2522/2532 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 1109 transition count 2521
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 1108 transition count 2521
Applied a total of 2 rules in 74 ms. Remains 1108 /1109 variables (removed 1) and now considering 2521/2522 (removed 1) transitions.
[2024-05-24 19:47:23] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
// Phase 1: matrix 2249 rows 1108 cols
[2024-05-24 19:47:23] [INFO ] Computed 48 invariants in 30 ms
[2024-05-24 19:47:24] [INFO ] Implicit Places using invariants in 936 ms returned []
[2024-05-24 19:47:24] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
[2024-05-24 19:47:24] [INFO ] Invariant cache hit.
[2024-05-24 19:47:25] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:47:34] [INFO ] Implicit Places using invariants and state equation in 9405 ms returned []
Implicit Place search using SMT with State Equation took 10344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1113 places, 2521/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22600 ms. Remains : 1108/1113 places, 2521/2532 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 412553 ms.
[2024-05-24 19:47:34] [INFO ] Flatten gal took : 106 ms
[2024-05-24 19:47:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-24 19:47:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1303 places, 2971 transitions and 13023 arcs took 23 ms.
Total runtime 2224180 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S16C08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1303
TRANSITIONS: 2971
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.062s, Sys 0.011s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 5438
MODEL NAME: /home/mcc/execution/413/model
1303 places, 2971 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, 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 r245-tall-171654349100052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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 ;