About the Execution of GreatSPN+red for TokenRing-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5965.487 | 927815.00 | 1010161.00 | 10261.70 | TFTFFTFTFTF?F?FF | 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.r421-smll-171690572800163.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 TokenRing-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-smll-171690572800163
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 519K 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 TokenRing-PT-010-LTLCardinality-00
FORMULA_NAME TokenRing-PT-010-LTLCardinality-01
FORMULA_NAME TokenRing-PT-010-LTLCardinality-02
FORMULA_NAME TokenRing-PT-010-LTLCardinality-03
FORMULA_NAME TokenRing-PT-010-LTLCardinality-04
FORMULA_NAME TokenRing-PT-010-LTLCardinality-05
FORMULA_NAME TokenRing-PT-010-LTLCardinality-06
FORMULA_NAME TokenRing-PT-010-LTLCardinality-07
FORMULA_NAME TokenRing-PT-010-LTLCardinality-08
FORMULA_NAME TokenRing-PT-010-LTLCardinality-09
FORMULA_NAME TokenRing-PT-010-LTLCardinality-10
FORMULA_NAME TokenRing-PT-010-LTLCardinality-11
FORMULA_NAME TokenRing-PT-010-LTLCardinality-12
FORMULA_NAME TokenRing-PT-010-LTLCardinality-13
FORMULA_NAME TokenRing-PT-010-LTLCardinality-14
FORMULA_NAME TokenRing-PT-010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717003189227
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 17:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:19:52] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2024-05-29 17:19:52] [INFO ] Transformed 121 places.
[2024-05-29 17:19:52] [INFO ] Transformed 1111 transitions.
[2024-05-29 17:19:52] [INFO ] Found NUPN structural information;
[2024-05-29 17:19:52] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 73 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA TokenRing-PT-010-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 95 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-05-29 17:19:52] [INFO ] Computed 11 invariants in 46 ms
[2024-05-29 17:19:53] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-29 17:19:53] [INFO ] Invariant cache hit.
[2024-05-29 17:19:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:19:55] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:19:55] [INFO ] Invariant cache hit.
[2024-05-29 17:19:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:04] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 30 ms to minimize.
[2024-05-29 17:20:05] [INFO ] Deduced a trap composed of 67 places in 267 ms of which 4 ms to minimize.
[2024-05-29 17:20:05] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:20:05] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:20:05] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2024-05-29 17:20:05] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 2 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:20:06] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 2 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-05-29 17:20:07] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 62 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:20:08] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 4 ms to minimize.
[2024-05-29 17:20:09] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:10] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:20:10] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 2 ms to minimize.
[2024-05-29 17:20:10] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 1 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:20:11] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:20:12] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 3 ms to minimize.
[2024-05-29 17:20:13] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 7 ms to minimize.
[2024-05-29 17:20:14] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 4 ms to minimize.
[2024-05-29 17:20:15] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:21] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:20:22] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:20:22] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:20:22] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:20:22] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:20:23] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:20:24] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:20:25] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:20:25] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:20:25] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:20:26] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:20:26] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 17:20:26] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:20:26] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30103 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:20:30] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 1 ms to minimize.
[2024-05-29 17:20:31] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-05-29 17:20:31] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 3 ms to minimize.
[2024-05-29 17:20:31] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 2 ms to minimize.
[2024-05-29 17:20:31] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:20:31] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2024-05-29 17:20:32] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:20:32] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:20:32] [INFO ] Deduced a trap composed of 63 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:20:33] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:20:33] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:20:33] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:20:33] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:20:34] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:20:34] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:20:34] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 2 ms to minimize.
[2024-05-29 17:20:34] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:20:35] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:20:35] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:37] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 2 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 2 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:20:38] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:20:39] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:20:40] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 2 ms to minimize.
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:20:41] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:20:42] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 2 ms to minimize.
[2024-05-29 17:20:45] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 2 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:20:46] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:20:47] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:20:47] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:20:47] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 4 ms to minimize.
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:20:48] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 3 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:20:49] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:20:50] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:20:52] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 2 ms to minimize.
[2024-05-29 17:20:53] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
[2024-05-29 17:20:53] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 4 ms to minimize.
[2024-05-29 17:20:53] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 3 ms to minimize.
[2024-05-29 17:20:53] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:20:53] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:20:54] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:20:55] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:20:56] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:20:56] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:20:56] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:20:57] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:20:57] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 2 ms to minimize.
[2024-05-29 17:20:57] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:20:57] [INFO ] Deduced a trap composed of 62 places in 241 ms of which 3 ms to minimize.
SMT process timed out in 61914ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61984ms
Finished structural reductions in LTL mode , in 1 iterations and 65184 ms. Remains : 121/121 places, 1111/1111 transitions.
Support contains 14 out of 121 places after structural reductions.
[2024-05-29 17:20:58] [INFO ] Flatten gal took : 204 ms
[2024-05-29 17:20:58] [INFO ] Flatten gal took : 135 ms
[2024-05-29 17:20:58] [INFO ] Input system was already deterministic with 1111 transitions.
Support contains 11 out of 121 places (down from 14) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 530 steps (0 resets) in 51 ms. (10 steps per ms) remains 0/8 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((F(p1)&&G(p2)))))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:20:59] [INFO ] Invariant cache hit.
[2024-05-29 17:20:59] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-29 17:20:59] [INFO ] Invariant cache hit.
[2024-05-29 17:20:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:21:01] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:21:01] [INFO ] Invariant cache hit.
[2024-05-29 17:21:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 2 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 1 ms to minimize.
[2024-05-29 17:21:09] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 2 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 2 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2024-05-29 17:21:10] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 1 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2024-05-29 17:21:11] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:21:12] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 2 ms to minimize.
[2024-05-29 17:21:12] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:21:12] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:21:12] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:21:12] [INFO ] Deduced a trap composed of 63 places in 198 ms of which 3 ms to minimize.
[2024-05-29 17:21:13] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:21:13] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:21:14] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 2 ms to minimize.
[2024-05-29 17:21:14] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 1 ms to minimize.
[2024-05-29 17:21:14] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:21:15] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:21:15] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:21:15] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:21:15] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:21:16] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:21:16] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:21:16] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:21:16] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:21:17] [INFO ] Deduced a trap composed of 68 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:21:17] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:21:17] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:21:18] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 2 ms to minimize.
[2024-05-29 17:21:18] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:21:18] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 1 ms to minimize.
[2024-05-29 17:21:18] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
[2024-05-29 17:21:18] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:21:19] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:21:25] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:21:26] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 2 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:21:27] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:21:28] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:21:28] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:21:28] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:21:28] [INFO ] Deduced a trap composed of 67 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:21:29] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:21:29] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:21:29] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:21:29] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:21:30] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:21:30] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:21:30] [INFO ] Deduced a trap composed of 65 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:21:31] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:21:32] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:21:33] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 3 ms to minimize.
SMT process timed out in 31639ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31666ms
Finished structural reductions in LTL mode , in 1 iterations and 33902 ms. Remains : 121/121 places, 1111/1111 transitions.
Stuttering acceptance computed with spot in 570 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : TokenRing-PT-010-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 122 steps with 0 reset in 6 ms.
FORMULA TokenRing-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-010-LTLCardinality-10 finished in 34582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 91 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:21:33] [INFO ] Invariant cache hit.
[2024-05-29 17:21:34] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-29 17:21:34] [INFO ] Invariant cache hit.
[2024-05-29 17:21:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:21:36] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
[2024-05-29 17:21:36] [INFO ] Redundant transitions in 123 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:21:36] [INFO ] Invariant cache hit.
[2024-05-29 17:21:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:21:44] [INFO ] Deduced a trap composed of 66 places in 280 ms of which 3 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
[2024-05-29 17:21:45] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:21:46] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 2 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:21:47] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 3 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:21:48] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 2 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 63 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 2 ms to minimize.
[2024-05-29 17:21:49] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:21:51] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:21:51] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:21:51] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:21:51] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:21:52] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:21:52] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:21:52] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:21:52] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 2 ms to minimize.
[2024-05-29 17:21:53] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:21:53] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 4 ms to minimize.
[2024-05-29 17:21:53] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:21:53] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 4 ms to minimize.
[2024-05-29 17:21:54] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:21:54] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:21:54] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:21:55] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:21:55] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:21:55] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:21:55] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:21:56] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:22:03] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:22:03] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:22:04] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:22:04] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:22:04] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:22:04] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:22:05] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 3 ms to minimize.
[2024-05-29 17:22:05] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:22:05] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:22:05] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:22:06] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 4 ms to minimize.
[2024-05-29 17:22:06] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:22:06] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:22:06] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:22:07] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 2 ms to minimize.
[2024-05-29 17:22:07] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
SMT process timed out in 31272ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31294ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33804 ms. Remains : 121/121 places, 1111/1111 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-010-LTLCardinality-11
Product exploration explored 100000 steps with 1675 reset in 773 ms.
Product exploration explored 100000 steps with 1676 reset in 371 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 247 steps (0 resets) in 12 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-29 17:22:09] [INFO ] Invariant cache hit.
[2024-05-29 17:22:10] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-29 17:22:10] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-29 17:22:10] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:22:11] [INFO ] [Real]Added 1010 Read/Feed constraints in 199 ms returned sat
[2024-05-29 17:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:22:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 17:22:12] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-29 17:22:12] [INFO ] [Nat]Added 1010 Read/Feed constraints in 143 ms returned sat
[2024-05-29 17:22:12] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1091 transitions) in 110 ms.
[2024-05-29 17:22:12] [INFO ] Added : 1 causal constraints over 1 iterations in 257 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 36 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:22:12] [INFO ] Invariant cache hit.
[2024-05-29 17:22:12] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-29 17:22:12] [INFO ] Invariant cache hit.
[2024-05-29 17:22:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:22:14] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
[2024-05-29 17:22:14] [INFO ] Redundant transitions in 31 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:22:14] [INFO ] Invariant cache hit.
[2024-05-29 17:22:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:22:21] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:22:22] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:22:22] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:22:22] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:22:22] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:22:23] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:22:23] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:22:23] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:22:23] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 2 ms to minimize.
[2024-05-29 17:22:24] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:22:24] [INFO ] Deduced a trap composed of 65 places in 326 ms of which 98 ms to minimize.
[2024-05-29 17:22:24] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:22:25] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:22:25] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:22:25] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:22:25] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 63 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:22:26] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:22:28] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2024-05-29 17:22:28] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-29 17:22:28] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 3 ms to minimize.
[2024-05-29 17:22:28] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:22:28] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:22:29] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:22:29] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:22:29] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:22:29] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:22:29] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:22:30] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:22:31] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:22:32] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:22:32] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:22:40] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 3 ms to minimize.
[2024-05-29 17:22:40] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:22:40] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:22:41] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:22:41] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 2 ms to minimize.
[2024-05-29 17:22:41] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:22:41] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 2 ms to minimize.
[2024-05-29 17:22:41] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 3 ms to minimize.
[2024-05-29 17:22:42] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 3 ms to minimize.
[2024-05-29 17:22:42] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:22:42] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:22:42] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:22:43] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:22:43] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:22:43] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:22:43] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:22:44] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:22:44] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:22:44] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:22:44] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30035 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:22:48] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-05-29 17:22:48] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-29 17:22:48] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:22:48] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:22:48] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 3 ms to minimize.
[2024-05-29 17:22:49] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:22:49] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:22:49] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:22:49] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:22:50] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:22:50] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:22:50] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:22:50] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:22:51] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:22:51] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:22:51] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:22:51] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
[2024-05-29 17:22:52] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:22:52] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:22:52] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:22:55] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:22:55] [INFO ] Deduced a trap composed of 64 places in 356 ms of which 3 ms to minimize.
[2024-05-29 17:22:55] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:22:56] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:22:56] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:22:56] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:22:56] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:22:57] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:22:57] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:22:57] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:22:57] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:22:58] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:22:58] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:22:58] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:22:58] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:22:59] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 3 ms to minimize.
[2024-05-29 17:22:59] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:22:59] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:22:59] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:23:00] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:23:02] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:23:03] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:23:04] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:23:05] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:23:05] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:23:05] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:23:06] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:23:07] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:23:07] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:23:07] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 4 ms to minimize.
[2024-05-29 17:23:07] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:23:10] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 3 ms to minimize.
[2024-05-29 17:23:11] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:23:11] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 3 ms to minimize.
[2024-05-29 17:23:11] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:23:11] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:23:12] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 3 ms to minimize.
[2024-05-29 17:23:12] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:23:12] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:23:13] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 2 ms to minimize.
[2024-05-29 17:23:13] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:23:13] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:23:13] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 14 ms to minimize.
[2024-05-29 17:23:13] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:23:14] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:23:14] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:23:14] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:23:14] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:23:15] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 2 ms to minimize.
SMT process timed out in 60900ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62872 ms. Remains : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 234 steps (0 resets) in 10 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-05-29 17:23:16] [INFO ] Invariant cache hit.
[2024-05-29 17:23:17] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-29 17:23:17] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-05-29 17:23:17] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:23:17] [INFO ] [Real]Added 1010 Read/Feed constraints in 120 ms returned sat
[2024-05-29 17:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:23:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-29 17:23:18] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-05-29 17:23:18] [INFO ] [Nat]Added 1010 Read/Feed constraints in 233 ms returned sat
[2024-05-29 17:23:18] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1091 transitions) in 180 ms.
[2024-05-29 17:23:19] [INFO ] Added : 1 causal constraints over 1 iterations in 411 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1678 reset in 478 ms.
Product exploration explored 100000 steps with 1674 reset in 400 ms.
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 36 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:23:20] [INFO ] Invariant cache hit.
[2024-05-29 17:23:20] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-29 17:23:20] [INFO ] Invariant cache hit.
[2024-05-29 17:23:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:23:21] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2024-05-29 17:23:21] [INFO ] Redundant transitions in 79 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:23:21] [INFO ] Invariant cache hit.
[2024-05-29 17:23:21] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:23:29] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 2 ms to minimize.
[2024-05-29 17:23:29] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:23:29] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 2 ms to minimize.
[2024-05-29 17:23:29] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 4 ms to minimize.
[2024-05-29 17:23:30] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2024-05-29 17:23:30] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 1 ms to minimize.
[2024-05-29 17:23:30] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 1 ms to minimize.
[2024-05-29 17:23:30] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 1 ms to minimize.
[2024-05-29 17:23:30] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-29 17:23:30] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2024-05-29 17:23:31] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:23:31] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:23:31] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 2 ms to minimize.
[2024-05-29 17:23:31] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:23:31] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:23:32] [INFO ] Deduced a trap composed of 62 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:23:32] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:23:32] [INFO ] Deduced a trap composed of 63 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:23:32] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:23:33] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:23:34] [INFO ] Deduced a trap composed of 64 places in 344 ms of which 2 ms to minimize.
[2024-05-29 17:23:34] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:23:35] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:23:35] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:23:35] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:23:35] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:23:36] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:23:36] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:23:36] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 3 ms to minimize.
[2024-05-29 17:23:36] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:23:37] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:23:37] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:23:37] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:23:37] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:23:38] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:23:38] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:23:38] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:23:39] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:23:39] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:23:39] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:23:47] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-05-29 17:23:47] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 3 ms to minimize.
[2024-05-29 17:23:47] [INFO ] Deduced a trap composed of 68 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:23:47] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:23:48] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:23:48] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:23:48] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 3 ms to minimize.
[2024-05-29 17:23:48] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:23:49] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:23:49] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 3 ms to minimize.
[2024-05-29 17:23:49] [INFO ] Deduced a trap composed of 68 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:23:49] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:23:50] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:23:50] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:23:50] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:23:50] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:23:51] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:23:51] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:23:51] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:23:52] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30037 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:23:55] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:23:56] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:23:56] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:23:56] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 3 ms to minimize.
[2024-05-29 17:23:56] [INFO ] Deduced a trap composed of 63 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:23:57] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 3 ms to minimize.
[2024-05-29 17:23:57] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:23:57] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:23:57] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:23:58] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:23:58] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:23:58] [INFO ] Deduced a trap composed of 68 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:23:58] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:23:59] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:23:59] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:23:59] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:23:59] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:24:00] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:24:00] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:24:00] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:24:02] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 3 ms to minimize.
[2024-05-29 17:24:02] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:24:02] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:24:03] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:24:03] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:24:03] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:24:03] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:24:04] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:24:04] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:24:04] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:24:04] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:24:05] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:24:05] [INFO ] Deduced a trap composed of 63 places in 336 ms of which 2 ms to minimize.
[2024-05-29 17:24:05] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:24:05] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:24:06] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:24:06] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:24:06] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:24:06] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:24:07] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:24:09] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:24:10] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:24:10] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:24:10] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:24:10] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:24:11] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:24:11] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:24:11] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:24:11] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:24:12] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:24:12] [INFO ] Deduced a trap composed of 69 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:24:12] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:24:13] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:24:13] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 3 ms to minimize.
[2024-05-29 17:24:13] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:24:13] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 3 ms to minimize.
[2024-05-29 17:24:14] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:24:14] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 2 ms to minimize.
[2024-05-29 17:24:14] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:24:14] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:24:17] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-05-29 17:24:17] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-29 17:24:17] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 2 ms to minimize.
[2024-05-29 17:24:17] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:24:18] [INFO ] Deduced a trap composed of 68 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:24:18] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:24:18] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:24:18] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:24:19] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:24:19] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-05-29 17:24:19] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:24:19] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:24:20] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:24:20] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 1 ms to minimize.
[2024-05-29 17:24:20] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:24:20] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 1 ms to minimize.
[2024-05-29 17:24:21] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 1 ms to minimize.
[2024-05-29 17:24:21] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-05-29 17:24:21] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 3 ms to minimize.
[2024-05-29 17:24:21] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30027 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 60907ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62513 ms. Remains : 121/121 places, 1111/1111 transitions.
Treatment of property TokenRing-PT-010-LTLCardinality-11 finished in 169214 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 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 12 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:24:22] [INFO ] Invariant cache hit.
[2024-05-29 17:24:23] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 17:24:23] [INFO ] Invariant cache hit.
[2024-05-29 17:24:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:24:24] [INFO ] Implicit Places using invariants and state equation in 1701 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:24:25] [INFO ] Invariant cache hit.
[2024-05-29 17:24:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:24:32] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:24:32] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:24:32] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:24:33] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:24:33] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:24:33] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:24:34] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:24:34] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:24:34] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:24:34] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 65 places in 387 ms of which 2 ms to minimize.
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:24:35] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:24:36] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:24:37] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:24:38] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:24:39] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:24:40] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:24:41] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:24:41] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:24:41] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:24:41] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:24:42] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:24:42] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:24:42] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:24:42] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:24:43] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 3 ms to minimize.
[2024-05-29 17:24:43] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:24:43] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:24:44] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:24:51] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:24:51] [INFO ] Deduced a trap composed of 67 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:24:51] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:24:52] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:24:52] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:24:52] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 67 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 2 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:24:53] [INFO ] Deduced a trap composed of 67 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:24:54] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:24:54] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 2 ms to minimize.
[2024-05-29 17:24:54] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:24:54] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:24:55] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:24:55] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:24:55] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:24:56] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:24:56] [INFO ] Deduced a trap composed of 65 places in 218 ms of which 2 ms to minimize.
SMT process timed out in 31288ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31310ms
Finished structural reductions in LTL mode , in 1 iterations and 33364 ms. Remains : 121/121 places, 1111/1111 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-010-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA TokenRing-PT-010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-010-LTLCardinality-12 finished in 33515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 11 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:24:56] [INFO ] Invariant cache hit.
[2024-05-29 17:24:56] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-29 17:24:56] [INFO ] Invariant cache hit.
[2024-05-29 17:24:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:24:58] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:24:58] [INFO ] Invariant cache hit.
[2024-05-29 17:24:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:05] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:25:06] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:25:06] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:25:06] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:25:06] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:25:07] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:25:07] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:25:07] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:25:07] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:25:08] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:25:08] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:25:08] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:25:08] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:25:09] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:25:09] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:25:09] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:25:10] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:25:10] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:25:10] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:25:10] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:11] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2024-05-29 17:25:11] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:25:12] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:25:12] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:25:12] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:25:12] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:25:13] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:25:13] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:25:13] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:25:13] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:25:14] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:25:14] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:25:14] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:25:14] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 1 ms to minimize.
[2024-05-29 17:25:15] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:25:15] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:25:15] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2024-05-29 17:25:15] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:25:16] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:25:16] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:24] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:25:24] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:25:24] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:25:24] [INFO ] Deduced a trap composed of 66 places in 333 ms of which 2 ms to minimize.
[2024-05-29 17:25:25] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 2 ms to minimize.
[2024-05-29 17:25:25] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:25:25] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 3 ms to minimize.
[2024-05-29 17:25:25] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 2 ms to minimize.
[2024-05-29 17:25:26] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:25:26] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:25:26] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:25:26] [INFO ] Deduced a trap composed of 67 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:25:27] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:25:27] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:25:27] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:25:28] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:25:28] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 2 ms to minimize.
[2024-05-29 17:25:28] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:25:28] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:25:29] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30034 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:33] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:25:34] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:25:34] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 2 ms to minimize.
[2024-05-29 17:25:34] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 2 ms to minimize.
[2024-05-29 17:25:34] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:25:35] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:25:35] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:25:35] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:25:36] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:25:36] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:25:36] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:25:36] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:25:37] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:25:37] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:25:37] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:25:37] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:25:38] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:25:38] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:25:38] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 2 ms to minimize.
[2024-05-29 17:25:38] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:40] [INFO ] Deduced a trap composed of 63 places in 209 ms of which 2 ms to minimize.
[2024-05-29 17:25:41] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:25:41] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:25:41] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:25:41] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:25:42] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:25:42] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:25:42] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:25:42] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:25:43] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:25:43] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:25:43] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:25:44] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:25:44] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 2 ms to minimize.
[2024-05-29 17:25:44] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:25:44] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:25:45] [INFO ] Deduced a trap composed of 65 places in 265 ms of which 3 ms to minimize.
[2024-05-29 17:25:45] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:25:45] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:25:45] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:48] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
[2024-05-29 17:25:48] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:25:48] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:25:48] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:25:49] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:25:49] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-05-29 17:25:49] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:25:49] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 3 ms to minimize.
[2024-05-29 17:25:50] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:25:50] [INFO ] Deduced a trap composed of 69 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:25:50] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:25:50] [INFO ] Deduced a trap composed of 68 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:25:51] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:25:51] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:25:51] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:25:52] [INFO ] Deduced a trap composed of 68 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:25:52] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:25:52] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:25:52] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:25:53] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:25:55] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 1 ms to minimize.
[2024-05-29 17:25:55] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 3 ms to minimize.
[2024-05-29 17:25:56] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:25:56] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 2 ms to minimize.
[2024-05-29 17:25:56] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:25:56] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:25:57] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:25:57] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 2 ms to minimize.
[2024-05-29 17:25:57] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 3 ms to minimize.
[2024-05-29 17:25:58] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:25:58] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:25:58] [INFO ] Deduced a trap composed of 67 places in 273 ms of which 3 ms to minimize.
[2024-05-29 17:25:58] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:25:59] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:25:59] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 2 ms to minimize.
[2024-05-29 17:25:59] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
SMT process timed out in 61107ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61129ms
Finished structural reductions in LTL mode , in 1 iterations and 63366 ms. Remains : 121/121 places, 1111/1111 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TokenRing-PT-010-LTLCardinality-13
Product exploration explored 100000 steps with 4633 reset in 447 ms.
Product exploration explored 100000 steps with 4580 reset in 426 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 490 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 26685 steps (6 resets) in 501 ms. (53 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 505 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-29 17:26:02] [INFO ] Invariant cache hit.
[2024-05-29 17:26:03] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-29 17:26:04] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-05-29 17:26:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:26:04] [INFO ] [Real]Added 1010 Read/Feed constraints in 186 ms returned sat
[2024-05-29 17:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:26:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-29 17:26:06] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2024-05-29 17:26:06] [INFO ] [Nat]Added 1010 Read/Feed constraints in 251 ms returned sat
[2024-05-29 17:26:06] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1091 transitions) in 150 ms.
[2024-05-29 17:26:06] [INFO ] Added : 0 causal constraints over 0 iterations in 302 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 34 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:26:06] [INFO ] Invariant cache hit.
[2024-05-29 17:26:07] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 17:26:07] [INFO ] Invariant cache hit.
[2024-05-29 17:26:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:26:09] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
[2024-05-29 17:26:09] [INFO ] Redundant transitions in 46 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:26:09] [INFO ] Invariant cache hit.
[2024-05-29 17:26:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:26:17] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:26:17] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:26:17] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 2 ms to minimize.
[2024-05-29 17:26:18] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 1 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:26:19] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:26:20] [INFO ] Deduced a trap composed of 64 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:26:20] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 3 ms to minimize.
[2024-05-29 17:26:20] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:26:20] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:26:21] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:26:21] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:26:21] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:26:21] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:26:22] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:26:23] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:26:23] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:26:24] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:26:24] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 2 ms to minimize.
[2024-05-29 17:26:24] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:26:24] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:26:25] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:26:25] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-05-29 17:26:25] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:26:25] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:26:26] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 3 ms to minimize.
[2024-05-29 17:26:26] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:26:26] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:26:26] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:26:27] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:26:27] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:26:27] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:26:27] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:26:28] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:26:28] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:26:35] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:26:35] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:26:35] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:26:36] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:26:36] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:26:36] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:26:36] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 2 ms to minimize.
[2024-05-29 17:26:37] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:26:37] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:26:37] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:26:37] [INFO ] Deduced a trap composed of 68 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:26:38] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:26:38] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:26:38] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:26:39] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:26:39] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 3 ms to minimize.
[2024-05-29 17:26:39] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:26:39] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:26:40] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:26:40] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
SMT process timed out in 31150ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31174ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33661 ms. Remains : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 33339 steps (7 resets) in 215 ms. (154 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 649 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-29 17:26:42] [INFO ] Invariant cache hit.
[2024-05-29 17:26:43] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-29 17:26:43] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2024-05-29 17:26:43] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:26:44] [INFO ] [Real]Added 1010 Read/Feed constraints in 196 ms returned sat
[2024-05-29 17:26:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:26:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-29 17:26:45] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2024-05-29 17:26:45] [INFO ] [Nat]Added 1010 Read/Feed constraints in 231 ms returned sat
[2024-05-29 17:26:45] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1091 transitions) in 91 ms.
[2024-05-29 17:26:46] [INFO ] Added : 0 causal constraints over 0 iterations in 186 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 4744 reset in 419 ms.
Product exploration explored 100000 steps with 4797 reset in 386 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 20 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:26:47] [INFO ] Invariant cache hit.
[2024-05-29 17:26:47] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 17:26:47] [INFO ] Invariant cache hit.
[2024-05-29 17:26:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:26:48] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2024-05-29 17:26:48] [INFO ] Redundant transitions in 18 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:26:48] [INFO ] Invariant cache hit.
[2024-05-29 17:26:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:26:56] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:26:56] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:26:56] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:26:57] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:26:57] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:26:57] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-05-29 17:26:57] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:26:58] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:26:58] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:26:58] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:26:58] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:26:59] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:26:59] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:26:59] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:26:59] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:27:00] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:27:00] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:27:00] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:27:00] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:27:01] [INFO ] Deduced a trap composed of 66 places in 372 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:02] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2024-05-29 17:27:02] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2024-05-29 17:27:02] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:27:02] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-05-29 17:27:02] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:27:03] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:27:03] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:27:03] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:27:03] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:27:04] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:27:04] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:27:04] [INFO ] Deduced a trap composed of 68 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:27:04] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:27:05] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:27:05] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:27:05] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:27:05] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:27:06] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:27:06] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:27:06] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:14] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:27:14] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:27:14] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:27:14] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:27:15] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:27:15] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:27:15] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2024-05-29 17:27:15] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:27:16] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:27:16] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 2 ms to minimize.
[2024-05-29 17:27:16] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:27:16] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:27:17] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:27:17] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 2 ms to minimize.
[2024-05-29 17:27:17] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:27:17] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:27:18] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:27:18] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:27:18] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:27:18] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30030 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 1 ms to minimize.
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 1 ms to minimize.
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 67 places in 278 ms of which 3 ms to minimize.
[2024-05-29 17:27:23] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:27:24] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:27:25] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:27:26] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:27:26] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:27:26] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:27:26] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:27:27] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:27:27] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:27:27] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:30] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 3 ms to minimize.
[2024-05-29 17:27:30] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:27:30] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:27:30] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:27:31] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:27:31] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:27:31] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:27:31] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:27:32] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:27:32] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:27:32] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:27:32] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:27:33] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:27:33] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:27:33] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:27:33] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:27:34] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 6 ms to minimize.
[2024-05-29 17:27:34] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:27:34] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:27:34] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:37] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 3 ms to minimize.
[2024-05-29 17:27:37] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:27:37] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:27:37] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 2 ms to minimize.
[2024-05-29 17:27:38] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 3 ms to minimize.
[2024-05-29 17:27:38] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:27:38] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:27:39] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:27:39] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:27:39] [INFO ] Deduced a trap composed of 69 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:27:39] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:27:40] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 2 ms to minimize.
[2024-05-29 17:27:40] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:27:40] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:27:40] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
[2024-05-29 17:27:41] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:27:41] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:27:41] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:27:41] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:27:42] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:44] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-05-29 17:27:44] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-05-29 17:27:45] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:27:45] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:27:45] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:27:45] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:27:46] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:27:46] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:27:46] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:27:46] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:27:47] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 3 ms to minimize.
[2024-05-29 17:27:47] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:27:47] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:27:47] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:27:48] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:27:48] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:27:48] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:27:49] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:27:49] [INFO ] Deduced a trap composed of 63 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:27:49] [INFO ] Deduced a trap composed of 62 places in 243 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30035 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 61106ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62675 ms. Remains : 121/121 places, 1111/1111 transitions.
Treatment of property TokenRing-PT-010-LTLCardinality-13 finished in 173399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:27:49] [INFO ] Invariant cache hit.
[2024-05-29 17:27:50] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 17:27:50] [INFO ] Invariant cache hit.
[2024-05-29 17:27:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:27:51] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:27:52] [INFO ] Invariant cache hit.
[2024-05-29 17:27:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:27:59] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:28:00] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:28:00] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:28:00] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:28:00] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 2 ms to minimize.
[2024-05-29 17:28:01] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 1 ms to minimize.
[2024-05-29 17:28:01] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:28:01] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:28:01] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:28:02] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:28:02] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:28:02] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:28:02] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-05-29 17:28:03] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:28:03] [INFO ] Deduced a trap composed of 64 places in 271 ms of which 3 ms to minimize.
[2024-05-29 17:28:03] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:28:03] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:28:04] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:28:04] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 3 ms to minimize.
[2024-05-29 17:28:04] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:28:05] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:28:06] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:28:06] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:28:06] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 2 ms to minimize.
[2024-05-29 17:28:07] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:28:07] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:28:07] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:28:07] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:28:08] [INFO ] Deduced a trap composed of 64 places in 263 ms of which 2 ms to minimize.
[2024-05-29 17:28:08] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:28:08] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:28:08] [INFO ] Deduced a trap composed of 68 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:28:09] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 6 ms to minimize.
[2024-05-29 17:28:09] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 2 ms to minimize.
[2024-05-29 17:28:09] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:28:09] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:28:10] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:28:10] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:28:10] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:28:11] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:28:18] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-05-29 17:28:18] [INFO ] Deduced a trap composed of 67 places in 261 ms of which 3 ms to minimize.
[2024-05-29 17:28:19] [INFO ] Deduced a trap composed of 68 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:28:19] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-05-29 17:28:19] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:28:19] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:28:20] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 3 ms to minimize.
[2024-05-29 17:28:20] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:28:20] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:28:20] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:28:21] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:28:21] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:28:21] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:28:22] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:28:22] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:28:22] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:28:22] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:28:22] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2024-05-29 17:28:23] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
SMT process timed out in 31216ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31236ms
Finished structural reductions in LTL mode , in 1 iterations and 33381 ms. Remains : 121/121 places, 1111/1111 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : TokenRing-PT-010-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 310 ms.
Stack based approach found an accepted trace after 142 steps with 0 reset with depth 143 and stack size 143 in 2 ms.
FORMULA TokenRing-PT-010-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-010-LTLCardinality-14 finished in 33939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : TokenRing-PT-010-LTLCardinality-13
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 31 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:28:24] [INFO ] Invariant cache hit.
[2024-05-29 17:28:24] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-29 17:28:24] [INFO ] Invariant cache hit.
[2024-05-29 17:28:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:28:26] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:28:26] [INFO ] Invariant cache hit.
[2024-05-29 17:28:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:28:33] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 3 ms to minimize.
[2024-05-29 17:28:34] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:28:34] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:28:34] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:28:34] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 3 ms to minimize.
[2024-05-29 17:28:35] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 3 ms to minimize.
[2024-05-29 17:28:35] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-05-29 17:28:35] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:28:36] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 62 places in 162 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 1 ms to minimize.
[2024-05-29 17:28:37] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 1 ms to minimize.
[2024-05-29 17:28:38] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-05-29 17:28:38] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:28:39] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 2 ms to minimize.
[2024-05-29 17:28:39] [INFO ] Deduced a trap composed of 65 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:28:39] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 1 ms to minimize.
[2024-05-29 17:28:39] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 1 ms to minimize.
[2024-05-29 17:28:40] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:28:40] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 2 ms to minimize.
[2024-05-29 17:28:40] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 1 ms to minimize.
[2024-05-29 17:28:40] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-05-29 17:28:40] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 1 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 1 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 1 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 1 ms to minimize.
[2024-05-29 17:28:41] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 1 ms to minimize.
[2024-05-29 17:28:42] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 1 ms to minimize.
[2024-05-29 17:28:42] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2024-05-29 17:28:42] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 1 ms to minimize.
[2024-05-29 17:28:42] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 2 ms to minimize.
[2024-05-29 17:28:42] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:28:49] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:28:50] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 2 ms to minimize.
[2024-05-29 17:28:50] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:28:50] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:28:50] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:28:51] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:28:51] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:28:51] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 3 ms to minimize.
[2024-05-29 17:28:51] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:28:52] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:28:52] [INFO ] Deduced a trap composed of 68 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:28:52] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:28:52] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-05-29 17:28:53] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-05-29 17:28:53] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:28:53] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:28:53] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 3 ms to minimize.
[2024-05-29 17:28:54] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 1 ms to minimize.
[2024-05-29 17:28:54] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 2 ms to minimize.
[2024-05-29 17:28:54] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:28:56] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:28:56] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:28:56] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-05-29 17:28:56] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:28:56] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:28:57] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-05-29 17:28:57] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 3 ms to minimize.
[2024-05-29 17:28:57] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:28:57] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
SMT process timed out in 31427ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31484ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 33343 ms. Remains : 121/121 places, 1111/1111 transitions.
Running random walk in product with property : TokenRing-PT-010-LTLCardinality-13
Product exploration explored 100000 steps with 4713 reset in 438 ms.
Product exploration explored 100000 steps with 4768 reset in 323 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 20176 steps (4 resets) in 118 ms. (169 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 486 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-29 17:29:00] [INFO ] Invariant cache hit.
[2024-05-29 17:29:00] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-29 17:29:01] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-29 17:29:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:29:01] [INFO ] [Real]Added 1010 Read/Feed constraints in 121 ms returned sat
[2024-05-29 17:29:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:29:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-29 17:29:02] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2024-05-29 17:29:02] [INFO ] [Nat]Added 1010 Read/Feed constraints in 200 ms returned sat
[2024-05-29 17:29:02] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1091 transitions) in 123 ms.
[2024-05-29 17:29:03] [INFO ] Added : 0 causal constraints over 0 iterations in 258 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 28 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:29:03] [INFO ] Invariant cache hit.
[2024-05-29 17:29:03] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-29 17:29:03] [INFO ] Invariant cache hit.
[2024-05-29 17:29:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:29:04] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2024-05-29 17:29:04] [INFO ] Redundant transitions in 19 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:29:04] [INFO ] Invariant cache hit.
[2024-05-29 17:29:04] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:12] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:29:12] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:29:13] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:29:13] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:29:13] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:29:13] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:29:14] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:29:14] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:29:14] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:29:14] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:29:15] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:29:15] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2024-05-29 17:29:15] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:15] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:29:16] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:16] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:29:16] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:29:16] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:29:17] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:29:17] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:18] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 2 ms to minimize.
[2024-05-29 17:29:18] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 2 ms to minimize.
[2024-05-29 17:29:19] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:29:19] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:29:19] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:29:19] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:29:20] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:29:20] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:29:20] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:29:20] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:29:21] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:29:21] [INFO ] Deduced a trap composed of 68 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:29:21] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:29:21] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:29:22] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:29:22] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
[2024-05-29 17:29:22] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:29:22] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-05-29 17:29:22] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-29 17:29:23] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:30] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 2 ms to minimize.
[2024-05-29 17:29:31] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:29:31] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 2 ms to minimize.
[2024-05-29 17:29:31] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:29:31] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:29:32] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:29:32] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:29:32] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:29:32] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:29:33] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:29:33] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 2 ms to minimize.
[2024-05-29 17:29:33] [INFO ] Deduced a trap composed of 67 places in 235 ms of which 4 ms to minimize.
[2024-05-29 17:29:33] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:29:34] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:34] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:29:34] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:29:34] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 4 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 1 ms to minimize.
[2024-05-29 17:29:35] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30031 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:38] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:29:38] [INFO ] Deduced a trap composed of 63 places in 231 ms of which 3 ms to minimize.
[2024-05-29 17:29:38] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:29:39] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:29:39] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:29:39] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 1 ms to minimize.
[2024-05-29 17:29:39] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:29:40] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 3 ms to minimize.
[2024-05-29 17:29:40] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 1 ms to minimize.
[2024-05-29 17:29:40] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:29:40] [INFO ] Deduced a trap composed of 67 places in 168 ms of which 2 ms to minimize.
[2024-05-29 17:29:40] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 2 ms to minimize.
[2024-05-29 17:29:41] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:29:41] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 2 ms to minimize.
[2024-05-29 17:29:41] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:29:41] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:29:41] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-05-29 17:29:42] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-05-29 17:29:42] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 3 ms to minimize.
[2024-05-29 17:29:42] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:44] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2024-05-29 17:29:44] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2024-05-29 17:29:44] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 1 ms to minimize.
[2024-05-29 17:29:44] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 2 ms to minimize.
[2024-05-29 17:29:45] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:29:45] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:29:45] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:45] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 3 ms to minimize.
[2024-05-29 17:29:46] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:29:46] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:29:46] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:29:46] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:29:47] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:29:47] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 3 ms to minimize.
[2024-05-29 17:29:47] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:29:47] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:29:48] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:29:48] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:29:48] [INFO ] Deduced a trap composed of 66 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:29:48] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:50] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
[2024-05-29 17:29:50] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 3 ms to minimize.
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 3 ms to minimize.
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 2 ms to minimize.
[2024-05-29 17:29:51] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 3 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 2 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:29:52] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 2 ms to minimize.
[2024-05-29 17:29:53] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 3 ms to minimize.
[2024-05-29 17:29:53] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 3 ms to minimize.
[2024-05-29 17:29:53] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:29:53] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:29:54] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 2 ms to minimize.
[2024-05-29 17:29:54] [INFO ] Deduced a trap composed of 66 places in 232 ms of which 2 ms to minimize.
[2024-05-29 17:29:54] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:54] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-29 17:29:55] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:29:57] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:57] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:29:57] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 3 ms to minimize.
[2024-05-29 17:29:58] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:29:58] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:29:58] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:29:58] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:29:59] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 2 ms to minimize.
[2024-05-29 17:29:59] [INFO ] Deduced a trap composed of 65 places in 238 ms of which 2 ms to minimize.
[2024-05-29 17:29:59] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:29:59] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:30:00] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-05-29 17:30:00] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:30:00] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:30:00] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:30:01] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-05-29 17:30:01] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:30:01] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:30:01] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 2 ms to minimize.
[2024-05-29 17:30:02] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:30:04] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 1 ms to minimize.
[2024-05-29 17:30:04] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 3 ms to minimize.
[2024-05-29 17:30:04] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:30:04] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:30:05] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 2 ms to minimize.
[2024-05-29 17:30:05] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2024-05-29 17:30:05] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-05-29 17:30:05] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 2 ms to minimize.
SMT process timed out in 61270ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61283ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62895 ms. Remains : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 30009 steps (6 resets) in 145 ms. (205 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 538 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-29 17:30:07] [INFO ] Invariant cache hit.
[2024-05-29 17:30:08] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-29 17:30:08] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-29 17:30:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:30:08] [INFO ] [Real]Added 1010 Read/Feed constraints in 153 ms returned sat
[2024-05-29 17:30:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 17:30:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-29 17:30:10] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2024-05-29 17:30:10] [INFO ] [Nat]Added 1010 Read/Feed constraints in 212 ms returned sat
[2024-05-29 17:30:10] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 1091 transitions) in 120 ms.
[2024-05-29 17:30:10] [INFO ] Added : 0 causal constraints over 0 iterations in 244 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 4687 reset in 312 ms.
Product exploration explored 100000 steps with 4691 reset in 359 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 19 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-05-29 17:30:11] [INFO ] Invariant cache hit.
[2024-05-29 17:30:11] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-29 17:30:11] [INFO ] Invariant cache hit.
[2024-05-29 17:30:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:30:13] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-29 17:30:13] [INFO ] Redundant transitions in 31 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:30:13] [INFO ] Invariant cache hit.
[2024-05-29 17:30:13] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:30:20] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:30:20] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:30:20] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:30:20] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:30:21] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:30:21] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 3 ms to minimize.
[2024-05-29 17:30:21] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:30:21] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:30:22] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:30:22] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 2 ms to minimize.
[2024-05-29 17:30:22] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:30:22] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:30:23] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:30:23] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 3 ms to minimize.
[2024-05-29 17:30:23] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 2 ms to minimize.
[2024-05-29 17:30:23] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:30:24] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 3 ms to minimize.
[2024-05-29 17:30:24] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:30:24] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 2 ms to minimize.
[2024-05-29 17:30:24] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:30:25] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 1 ms to minimize.
[2024-05-29 17:30:26] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-29 17:30:26] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 1 ms to minimize.
[2024-05-29 17:30:26] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 2 ms to minimize.
[2024-05-29 17:30:26] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 2 ms to minimize.
[2024-05-29 17:30:26] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2024-05-29 17:30:26] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 2 ms to minimize.
[2024-05-29 17:30:27] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 2 ms to minimize.
[2024-05-29 17:30:27] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:30:27] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:30:27] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:30:28] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:30:28] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:30:28] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:30:28] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-05-29 17:30:29] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:30:29] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:30:29] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 2 ms to minimize.
[2024-05-29 17:30:29] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 2 ms to minimize.
[2024-05-29 17:30:30] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:30:37] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-05-29 17:30:37] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 2 ms to minimize.
[2024-05-29 17:30:37] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 3 ms to minimize.
[2024-05-29 17:30:37] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-29 17:30:38] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:30:38] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 2 ms to minimize.
[2024-05-29 17:30:38] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 3 ms to minimize.
[2024-05-29 17:30:38] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:30:39] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 2 ms to minimize.
[2024-05-29 17:30:39] [INFO ] Deduced a trap composed of 67 places in 243 ms of which 3 ms to minimize.
[2024-05-29 17:30:39] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 2 ms to minimize.
[2024-05-29 17:30:39] [INFO ] Deduced a trap composed of 67 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:30:40] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 2 ms to minimize.
[2024-05-29 17:30:40] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:30:40] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 3 ms to minimize.
[2024-05-29 17:30:41] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:30:41] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 2 ms to minimize.
[2024-05-29 17:30:41] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-05-29 17:30:41] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 2 ms to minimize.
[2024-05-29 17:30:41] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:30:43] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-29 17:30:43] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 2 ms to minimize.
[2024-05-29 17:30:43] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 2 ms to minimize.
[2024-05-29 17:30:44] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 1 ms to minimize.
[2024-05-29 17:30:44] [INFO ] Deduced a trap composed of 64 places in 219 ms of which 3 ms to minimize.
SMT process timed out in 31188ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32824 ms. Remains : 121/121 places, 1111/1111 transitions.
Treatment of property TokenRing-PT-010-LTLCardinality-13 finished in 140318 ms.
[2024-05-29 17:30:44] [INFO ] Flatten gal took : 86 ms
[2024-05-29 17:30:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2024-05-29 17:30:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 1111 transitions and 4444 arcs took 19 ms.
Total runtime 652959 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running TokenRing-PT-010
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/400/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 121
TRANSITIONS: 1111
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.052s, Sys 0.004s]
SAVING FILE /home/mcc/execution/400/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 5282
MODEL NAME: /home/mcc/execution/400/model
121 places, 1111 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717004117042
--------------------
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 LTLCardinality -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="TokenRing-PT-010"
export BK_EXAMINATION="LTLCardinality"
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 TokenRing-PT-010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-smll-171690572800163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;