About the Execution of ITS-Tools for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.323 | 3600000.00 | 9782773.00 | 7168.50 | FTFFFF?FFFFFF?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.r268-smll-171654407300284.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 itstools
Input is Peterson-PT-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407300284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K 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 Peterson-PT-6-LTLFireability-00
FORMULA_NAME Peterson-PT-6-LTLFireability-01
FORMULA_NAME Peterson-PT-6-LTLFireability-02
FORMULA_NAME Peterson-PT-6-LTLFireability-03
FORMULA_NAME Peterson-PT-6-LTLFireability-04
FORMULA_NAME Peterson-PT-6-LTLFireability-05
FORMULA_NAME Peterson-PT-6-LTLFireability-06
FORMULA_NAME Peterson-PT-6-LTLFireability-07
FORMULA_NAME Peterson-PT-6-LTLFireability-08
FORMULA_NAME Peterson-PT-6-LTLFireability-09
FORMULA_NAME Peterson-PT-6-LTLFireability-10
FORMULA_NAME Peterson-PT-6-LTLFireability-11
FORMULA_NAME Peterson-PT-6-LTLFireability-12
FORMULA_NAME Peterson-PT-6-LTLFireability-13
FORMULA_NAME Peterson-PT-6-LTLFireability-14
FORMULA_NAME Peterson-PT-6-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716783586666
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 04:19:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 04:19:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 04:19:49] [INFO ] Load time of PNML (sax parser for PT used): 460 ms
[2024-05-27 04:19:49] [INFO ] Transformed 1330 places.
[2024-05-27 04:19:49] [INFO ] Transformed 2030 transitions.
[2024-05-27 04:19:49] [INFO ] Found NUPN structural information;
[2024-05-27 04:19:49] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 737 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1003 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 115 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:19:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:19:50] [INFO ] Computed 27 invariants in 60 ms
[2024-05-27 04:19:51] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-05-27 04:19:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:19:51] [INFO ] Invariant cache hit.
[2024-05-27 04:19:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:19:53] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:19:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:19:53] [INFO ] Invariant cache hit.
[2024-05-27 04:19:53] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31520ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31622ms
Finished structural reductions in LTL mode , in 1 iterations and 34488 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1003 out of 1330 places after structural reductions.
[2024-05-27 04:20:25] [INFO ] Flatten gal took : 213 ms
[2024-05-27 04:20:26] [INFO ] Flatten gal took : 162 ms
[2024-05-27 04:20:26] [INFO ] Input system was already deterministic with 2030 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 2994 ms. (13 steps per ms) remains 10/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1077 ms. (37 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
[2024-05-27 04:20:28] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:20:28] [INFO ] Invariant cache hit.
[2024-05-27 04:20:28] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1254/1288 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1288 variables, 1254/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1288 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3108 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 42/3150 variables, 42/2969 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/3150 variables, 42/3011 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3150 variables, 6/3017 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 3017 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5012 ms.
Refiners :[Domain max(s): 1330/1330 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1254/1288 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1288 variables, 1254/1307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1288 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3108 variables, 7/2934 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3108 variables, 0/2934 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 42/3150 variables, 42/2976 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3150 variables, 42/3018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 10066ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 577 transitions
Trivial Post-agglo rules discarded 577 transitions
Performed 577 trivial Post agglomeration. Transition count delta: 577
Iterating post reduction 0 with 577 rules applied. Total rules applied 577 place count 1330 transition count 1453
Reduce places removed 577 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 579 rules applied. Total rules applied 1156 place count 753 transition count 1451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1158 place count 751 transition count 1451
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 1158 place count 751 transition count 1165
Deduced a syphon composed of 286 places in 1 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 1730 place count 465 transition count 1165
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1814 place count 423 transition count 1123
Applied a total of 1814 rules in 242 ms. Remains 423 /1330 variables (removed 907) and now considering 1123/2030 (removed 907) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 423/1330 places, 1123/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 885 ms. (45 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 379008 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 7
Probabilistic random walk after 379008 steps, saw 55599 distinct states, run finished after 3006 ms. (steps per millisecond=126 ) properties seen :0
[2024-05-27 04:20:42] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
// Phase 1: matrix 913 rows 423 cols
[2024-05-27 04:20:42] [INFO ] Computed 27 invariants in 4 ms
[2024-05-27 04:20:42] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 347/381 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 347/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 913/1294 variables, 381/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 330/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 42/1336 variables, 42/1155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1336 variables, 42/1197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 6/1203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1336 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 1203 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1478 ms.
Refiners :[Domain max(s): 423/423 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 423/423 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 347/381 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 347/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 913/1294 variables, 381/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 330/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 7/1120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 42/1336 variables, 42/1162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 42/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 6/1210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 04:20:46] [INFO ] Deduced a trap composed of 42 places in 595 ms of which 67 ms to minimize.
[2024-05-27 04:20:46] [INFO ] Deduced a trap composed of 27 places in 628 ms of which 8 ms to minimize.
[2024-05-27 04:20:47] [INFO ] Deduced a trap composed of 50 places in 496 ms of which 7 ms to minimize.
[2024-05-27 04:20:47] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 6 ms to minimize.
[2024-05-27 04:20:48] [INFO ] Deduced a trap composed of 34 places in 450 ms of which 7 ms to minimize.
[2024-05-27 04:20:48] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 6 ms to minimize.
[2024-05-27 04:20:48] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 4 ms to minimize.
[2024-05-27 04:20:49] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 6 ms to minimize.
[2024-05-27 04:20:49] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 6 ms to minimize.
[2024-05-27 04:20:50] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-05-27 04:20:50] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 5 ms to minimize.
[2024-05-27 04:20:50] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 4 ms to minimize.
[2024-05-27 04:20:51] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 3 ms to minimize.
[2024-05-27 04:20:51] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 4 ms to minimize.
[2024-05-27 04:20:51] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 6 ms to minimize.
[2024-05-27 04:20:52] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 7 ms to minimize.
[2024-05-27 04:20:52] [INFO ] Deduced a trap composed of 44 places in 451 ms of which 6 ms to minimize.
[2024-05-27 04:20:53] [INFO ] Deduced a trap composed of 51 places in 444 ms of which 6 ms to minimize.
[2024-05-27 04:20:53] [INFO ] Deduced a trap composed of 10 places in 432 ms of which 5 ms to minimize.
[2024-05-27 04:20:54] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1336 variables, 20/1230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 04:20:55] [INFO ] Deduced a trap composed of 70 places in 485 ms of which 6 ms to minimize.
[2024-05-27 04:20:55] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 6 ms to minimize.
[2024-05-27 04:20:56] [INFO ] Deduced a trap composed of 89 places in 459 ms of which 6 ms to minimize.
[2024-05-27 04:20:56] [INFO ] Deduced a trap composed of 10 places in 496 ms of which 6 ms to minimize.
[2024-05-27 04:20:57] [INFO ] Deduced a trap composed of 82 places in 482 ms of which 7 ms to minimize.
[2024-05-27 04:20:57] [INFO ] Deduced a trap composed of 140 places in 473 ms of which 6 ms to minimize.
[2024-05-27 04:20:58] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:20:58] [INFO ] Deduced a trap composed of 50 places in 471 ms of which 6 ms to minimize.
[2024-05-27 04:20:59] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 6 ms to minimize.
[2024-05-27 04:20:59] [INFO ] Deduced a trap composed of 11 places in 462 ms of which 6 ms to minimize.
[2024-05-27 04:21:00] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 6 ms to minimize.
[2024-05-27 04:21:00] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 5 ms to minimize.
[2024-05-27 04:21:01] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 6 ms to minimize.
[2024-05-27 04:21:01] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 5 ms to minimize.
[2024-05-27 04:21:02] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 7 ms to minimize.
[2024-05-27 04:21:02] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 7 ms to minimize.
[2024-05-27 04:21:03] [INFO ] Deduced a trap composed of 26 places in 403 ms of which 5 ms to minimize.
[2024-05-27 04:21:03] [INFO ] Deduced a trap composed of 39 places in 359 ms of which 6 ms to minimize.
[2024-05-27 04:21:03] [INFO ] Deduced a trap composed of 34 places in 418 ms of which 5 ms to minimize.
[2024-05-27 04:21:04] [INFO ] Deduced a trap composed of 34 places in 437 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1336 variables, 20/1250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 04:21:05] [INFO ] Deduced a trap composed of 26 places in 422 ms of which 6 ms to minimize.
[2024-05-27 04:21:05] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 5 ms to minimize.
[2024-05-27 04:21:06] [INFO ] Deduced a trap composed of 101 places in 431 ms of which 6 ms to minimize.
[2024-05-27 04:21:06] [INFO ] Deduced a trap composed of 26 places in 415 ms of which 5 ms to minimize.
[2024-05-27 04:21:07] [INFO ] Deduced a trap composed of 23 places in 439 ms of which 6 ms to minimize.
[2024-05-27 04:21:07] [INFO ] Deduced a trap composed of 44 places in 411 ms of which 5 ms to minimize.
[2024-05-27 04:21:08] [INFO ] Deduced a trap composed of 31 places in 425 ms of which 5 ms to minimize.
[2024-05-27 04:21:08] [INFO ] Deduced a trap composed of 34 places in 409 ms of which 5 ms to minimize.
[2024-05-27 04:21:09] [INFO ] Deduced a trap composed of 65 places in 437 ms of which 6 ms to minimize.
[2024-05-27 04:21:09] [INFO ] Deduced a trap composed of 96 places in 442 ms of which 5 ms to minimize.
[2024-05-27 04:21:10] [INFO ] Deduced a trap composed of 86 places in 452 ms of which 7 ms to minimize.
[2024-05-27 04:21:10] [INFO ] Deduced a trap composed of 35 places in 422 ms of which 6 ms to minimize.
[2024-05-27 04:21:11] [INFO ] Deduced a trap composed of 19 places in 435 ms of which 6 ms to minimize.
[2024-05-27 04:21:11] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 6 ms to minimize.
[2024-05-27 04:21:12] [INFO ] Deduced a trap composed of 26 places in 406 ms of which 5 ms to minimize.
[2024-05-27 04:21:12] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 5 ms to minimize.
[2024-05-27 04:21:13] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 5 ms to minimize.
[2024-05-27 04:21:13] [INFO ] Deduced a trap composed of 26 places in 409 ms of which 5 ms to minimize.
[2024-05-27 04:21:14] [INFO ] Deduced a trap composed of 39 places in 417 ms of which 6 ms to minimize.
[2024-05-27 04:21:14] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1336 variables, 20/1270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 04:21:16] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 5 ms to minimize.
[2024-05-27 04:21:16] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 4 ms to minimize.
[2024-05-27 04:21:16] [INFO ] Deduced a trap composed of 50 places in 282 ms of which 4 ms to minimize.
[2024-05-27 04:21:17] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 4 ms to minimize.
[2024-05-27 04:21:17] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 4 ms to minimize.
[2024-05-27 04:21:18] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-05-27 04:21:18] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 5 ms to minimize.
[2024-05-27 04:21:18] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 4 ms to minimize.
[2024-05-27 04:21:19] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 4 ms to minimize.
[2024-05-27 04:21:19] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 4 ms to minimize.
[2024-05-27 04:21:20] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 5 ms to minimize.
[2024-05-27 04:21:20] [INFO ] Deduced a trap composed of 34 places in 357 ms of which 5 ms to minimize.
[2024-05-27 04:21:21] [INFO ] Deduced a trap composed of 60 places in 407 ms of which 6 ms to minimize.
[2024-05-27 04:21:21] [INFO ] Deduced a trap composed of 19 places in 413 ms of which 5 ms to minimize.
[2024-05-27 04:21:21] [INFO ] Deduced a trap composed of 48 places in 351 ms of which 5 ms to minimize.
[2024-05-27 04:21:22] [INFO ] Deduced a trap composed of 53 places in 347 ms of which 5 ms to minimize.
[2024-05-27 04:21:22] [INFO ] Deduced a trap composed of 37 places in 336 ms of which 4 ms to minimize.
[2024-05-27 04:21:23] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 5 ms to minimize.
[2024-05-27 04:21:23] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 4 ms to minimize.
[2024-05-27 04:21:23] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1336 variables, 20/1290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 04:21:25] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 6 ms to minimize.
[2024-05-27 04:21:25] [INFO ] Deduced a trap composed of 44 places in 492 ms of which 6 ms to minimize.
[2024-05-27 04:21:26] [INFO ] Deduced a trap composed of 33 places in 477 ms of which 6 ms to minimize.
[2024-05-27 04:21:26] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 6 ms to minimize.
[2024-05-27 04:21:27] [INFO ] Deduced a trap composed of 33 places in 469 ms of which 6 ms to minimize.
[2024-05-27 04:21:27] [INFO ] Deduced a trap composed of 44 places in 480 ms of which 6 ms to minimize.
[2024-05-27 04:21:28] [INFO ] Deduced a trap composed of 36 places in 466 ms of which 6 ms to minimize.
[2024-05-27 04:21:28] [INFO ] Deduced a trap composed of 68 places in 445 ms of which 6 ms to minimize.
SMT process timed out in 46621ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1588 ms.
Support contains 34 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1123/1123 transitions.
Applied a total of 0 rules in 38 ms. Remains 423 /423 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 423/423 places, 1123/1123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1123/1123 transitions.
Applied a total of 0 rules in 32 ms. Remains 423 /423 variables (removed 0) and now considering 1123/1123 (removed 0) transitions.
[2024-05-27 04:21:30] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
[2024-05-27 04:21:30] [INFO ] Invariant cache hit.
[2024-05-27 04:21:31] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-27 04:21:31] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
[2024-05-27 04:21:31] [INFO ] Invariant cache hit.
[2024-05-27 04:21:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:21:34] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
[2024-05-27 04:21:34] [INFO ] Redundant transitions in 104 ms returned []
Running 1116 sub problems to find dead transitions.
[2024-05-27 04:21:34] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
[2024-05-27 04:21:34] [INFO ] Invariant cache hit.
[2024-05-27 04:21:34] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 416/416 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 11/427 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 5/432 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-27 04:21:50] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 4 ms to minimize.
[2024-05-27 04:21:51] [INFO ] Deduced a trap composed of 28 places in 313 ms of which 5 ms to minimize.
[2024-05-27 04:21:51] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 4 ms to minimize.
[2024-05-27 04:21:51] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 3 ms to minimize.
[2024-05-27 04:21:51] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 3 ms to minimize.
[2024-05-27 04:21:52] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-05-27 04:21:52] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 4 ms to minimize.
[2024-05-27 04:21:52] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 3 ms to minimize.
[2024-05-27 04:21:52] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 11 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-05-27 04:21:53] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-05-27 04:21:54] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-05-27 04:21:54] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 4 ms to minimize.
[2024-05-27 04:21:54] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1336 variables, and 452 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30051 ms.
Refiners :[Domain max(s): 416/423 constraints, Positive P Invariants (semi-flows): 11/20 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/423 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 416/416 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 11/427 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 5/432 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-27 04:22:07] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 4 ms to minimize.
[2024-05-27 04:22:08] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 5 ms to minimize.
[2024-05-27 04:22:08] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 5 ms to minimize.
[2024-05-27 04:22:08] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 4 ms to minimize.
[2024-05-27 04:22:08] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 4 ms to minimize.
[2024-05-27 04:22:09] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 3 ms to minimize.
[2024-05-27 04:22:09] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-27 04:22:09] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 5 ms to minimize.
[2024-05-27 04:22:10] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 4 ms to minimize.
[2024-05-27 04:22:10] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-05-27 04:22:11] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 5 ms to minimize.
[2024-05-27 04:22:11] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-27 04:22:12] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 5 ms to minimize.
[2024-05-27 04:22:12] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 5 ms to minimize.
[2024-05-27 04:22:12] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 4 ms to minimize.
[2024-05-27 04:22:13] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-27 04:22:13] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-27 04:22:13] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-27 04:22:14] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-27 04:22:14] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-27 04:22:15] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-27 04:22:17] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-27 04:22:17] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-27 04:22:17] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-05-27 04:22:17] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 4 ms to minimize.
[2024-05-27 04:22:18] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 4 ms to minimize.
[2024-05-27 04:22:18] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-27 04:22:18] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-27 04:22:19] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 4 ms to minimize.
[2024-05-27 04:22:19] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-05-27 04:22:19] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-27 04:22:19] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-05-27 04:22:19] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-27 04:22:20] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-05-27 04:22:20] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 3 ms to minimize.
[2024-05-27 04:22:20] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 4 ms to minimize.
[2024-05-27 04:22:21] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 4 ms to minimize.
[2024-05-27 04:22:21] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 4 ms to minimize.
[2024-05-27 04:22:22] [INFO ] Deduced a trap composed of 48 places in 236 ms of which 3 ms to minimize.
[2024-05-27 04:22:22] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-27 04:22:23] [INFO ] Deduced a trap composed of 62 places in 202 ms of which 3 ms to minimize.
[2024-05-27 04:22:24] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 4 ms to minimize.
[2024-05-27 04:22:24] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-05-27 04:22:24] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-27 04:22:27] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-27 04:22:27] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 3 ms to minimize.
[2024-05-27 04:22:28] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-05-27 04:22:28] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-27 04:22:28] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-27 04:22:28] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-27 04:22:29] [INFO ] Deduced a trap composed of 33 places in 294 ms of which 4 ms to minimize.
[2024-05-27 04:22:30] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 4 ms to minimize.
[2024-05-27 04:22:30] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 3 ms to minimize.
[2024-05-27 04:22:30] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-05-27 04:22:30] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 4 ms to minimize.
[2024-05-27 04:22:31] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-05-27 04:22:31] [INFO ] Deduced a trap composed of 34 places in 300 ms of which 5 ms to minimize.
[2024-05-27 04:22:32] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 4 ms to minimize.
[2024-05-27 04:22:32] [INFO ] Deduced a trap composed of 47 places in 220 ms of which 3 ms to minimize.
[2024-05-27 04:22:32] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 1)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 1)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 1)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1336 variables, and 512 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30043 ms.
Refiners :[Domain max(s): 416/423 constraints, Positive P Invariants (semi-flows): 11/20 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/423 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 80/80 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64295 ms. Remains : 423/423 places, 1123/1123 transitions.
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' '!((p0 U (!X(X(G(X(p1)))) U p2)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 558 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:22:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:22:36] [INFO ] Computed 27 invariants in 12 ms
[2024-05-27 04:22:36] [INFO ] Implicit Places using invariants in 448 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 452 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1054 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p2), p1, p1, (OR (NOT p2) p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00
Product exploration explored 100000 steps with 393 reset in 899 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 3 ms.
FORMULA Peterson-PT-6-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 2499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 63 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:22:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:22:37] [INFO ] Invariant cache hit.
[2024-05-27 04:22:38] [INFO ] Implicit Places using invariants in 960 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 964 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 61 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1089 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 1005 ms.
Product exploration explored 100000 steps with 25000 reset in 775 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1008 steps (0 resets) in 13 ms. (72 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 58 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:22:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-27 04:22:41] [INFO ] Computed 20 invariants in 15 ms
[2024-05-27 04:22:42] [INFO ] Implicit Places using invariants in 797 ms returned []
[2024-05-27 04:22:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:22:42] [INFO ] Invariant cache hit.
[2024-05-27 04:22:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:22:46] [INFO ] Implicit Places using invariants and state equation in 4276 ms returned []
Implicit Place search using SMT with State Equation took 5074 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:22:46] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:22:46] [INFO ] Invariant cache hit.
[2024-05-27 04:22:46] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30890ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30920ms
Finished structural reductions in LTL mode , in 1 iterations and 36057 ms. Remains : 1323/1323 places, 2030/2030 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 935 steps (0 resets) in 15 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 718 ms.
Product exploration explored 100000 steps with 25000 reset in 712 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1323 transition count 2030
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 335 place count 1323 transition count 2210
Deduced a syphon composed of 588 places in 2 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 588 place count 1323 transition count 2210
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 738 place count 1173 transition count 2060
Deduced a syphon composed of 438 places in 2 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 888 place count 1173 transition count 2060
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 760 places in 2 ms
Iterating global reduction 1 with 322 rules applied. Total rules applied 1210 place count 1173 transition count 2060
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1502 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 1794 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Applied a total of 1794 rules in 755 ms. Remains 881 /1323 variables (removed 442) and now considering 1768/2030 (removed 262) transitions.
[2024-05-27 04:23:21] [INFO ] Redundant transitions in 144 ms returned []
Running 1761 sub problems to find dead transitions.
[2024-05-27 04:23:21] [INFO ] Flow matrix only has 1558 transitions (discarded 210 similar events)
// Phase 1: matrix 1558 rows 881 cols
[2024-05-27 04:23:21] [INFO ] Computed 20 invariants in 6 ms
[2024-05-27 04:23:21] [INFO ] State equation strengthened by 510 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/2439 variables, and 20 constraints, problems are : Problem set: 0 solved, 1761 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/881 constraints, ReadFeed: 0/510 constraints, PredecessorRefiner: 1761/1761 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
[2024-05-27 04:23:55] [INFO ] Deduced a trap composed of 14 places in 821 ms of which 11 ms to minimize.
[2024-05-27 04:23:56] [INFO ] Deduced a trap composed of 10 places in 881 ms of which 10 ms to minimize.
[2024-05-27 04:23:57] [INFO ] Deduced a trap composed of 19 places in 808 ms of which 10 ms to minimize.
[2024-05-27 04:23:58] [INFO ] Deduced a trap composed of 28 places in 802 ms of which 9 ms to minimize.
[2024-05-27 04:23:59] [INFO ] Deduced a trap composed of 18 places in 956 ms of which 11 ms to minimize.
[2024-05-27 04:24:00] [INFO ] Deduced a trap composed of 47 places in 858 ms of which 12 ms to minimize.
[2024-05-27 04:24:01] [INFO ] Deduced a trap composed of 53 places in 793 ms of which 11 ms to minimize.
[2024-05-27 04:24:02] [INFO ] Deduced a trap composed of 73 places in 946 ms of which 11 ms to minimize.
[2024-05-27 04:24:03] [INFO ] Deduced a trap composed of 30 places in 912 ms of which 11 ms to minimize.
[2024-05-27 04:24:03] [INFO ] Deduced a trap composed of 30 places in 884 ms of which 11 ms to minimize.
[2024-05-27 04:24:04] [INFO ] Deduced a trap composed of 54 places in 918 ms of which 10 ms to minimize.
[2024-05-27 04:24:05] [INFO ] Deduced a trap composed of 20 places in 842 ms of which 10 ms to minimize.
[2024-05-27 04:24:06] [INFO ] Deduced a trap composed of 18 places in 865 ms of which 11 ms to minimize.
[2024-05-27 04:24:07] [INFO ] Deduced a trap composed of 63 places in 815 ms of which 9 ms to minimize.
[2024-05-27 04:24:08] [INFO ] Deduced a trap composed of 24 places in 792 ms of which 9 ms to minimize.
[2024-05-27 04:24:09] [INFO ] Deduced a trap composed of 43 places in 705 ms of which 9 ms to minimize.
[2024-05-27 04:24:09] [INFO ] Deduced a trap composed of 26 places in 892 ms of which 11 ms to minimize.
[2024-05-27 04:24:10] [INFO ] Deduced a trap composed of 18 places in 822 ms of which 9 ms to minimize.
[2024-05-27 04:24:11] [INFO ] Deduced a trap composed of 18 places in 848 ms of which 11 ms to minimize.
[2024-05-27 04:24:12] [INFO ] Deduced a trap composed of 18 places in 889 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/881 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
[2024-05-27 04:24:13] [INFO ] Deduced a trap composed of 10 places in 450 ms of which 6 ms to minimize.
[2024-05-27 04:24:14] [INFO ] Deduced a trap composed of 10 places in 559 ms of which 9 ms to minimize.
[2024-05-27 04:24:15] [INFO ] Deduced a trap composed of 34 places in 736 ms of which 9 ms to minimize.
[2024-05-27 04:24:15] [INFO ] Deduced a trap composed of 13 places in 678 ms of which 9 ms to minimize.
[2024-05-27 04:24:16] [INFO ] Deduced a trap composed of 10 places in 711 ms of which 9 ms to minimize.
[2024-05-27 04:24:17] [INFO ] Deduced a trap composed of 27 places in 705 ms of which 9 ms to minimize.
[2024-05-27 04:24:18] [INFO ] Deduced a trap composed of 10 places in 699 ms of which 10 ms to minimize.
[2024-05-27 04:24:18] [INFO ] Deduced a trap composed of 29 places in 674 ms of which 9 ms to minimize.
[2024-05-27 04:24:19] [INFO ] Deduced a trap composed of 31 places in 750 ms of which 9 ms to minimize.
[2024-05-27 04:24:20] [INFO ] Deduced a trap composed of 31 places in 751 ms of which 9 ms to minimize.
[2024-05-27 04:24:21] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 10 ms to minimize.
[2024-05-27 04:24:21] [INFO ] Deduced a trap composed of 10 places in 508 ms of which 7 ms to minimize.
[2024-05-27 04:24:22] [INFO ] Deduced a trap composed of 55 places in 679 ms of which 9 ms to minimize.
[2024-05-27 04:24:22] [INFO ] Deduced a trap composed of 31 places in 519 ms of which 7 ms to minimize.
SMT process timed out in 61017ms, After SMT, problems are : Problem set: 0 solved, 1761 unsolved
Search for dead transitions found 0 dead transitions in 61039ms
Starting structural reductions in SI_LTL mode, iteration 1 : 881/1323 places, 1768/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61950 ms. Remains : 881/1323 places, 1768/2030 transitions.
Built C files in :
/tmp/ltsmin1636708650617597636
[2024-05-27 04:24:23] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1636708650617597636
Running compilation step : cd /tmp/ltsmin1636708650617597636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1636708650617597636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1636708650617597636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 46 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:24:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-27 04:24:26] [INFO ] Computed 20 invariants in 7 ms
[2024-05-27 04:24:26] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-05-27 04:24:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:24:26] [INFO ] Invariant cache hit.
[2024-05-27 04:24:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:24:34] [INFO ] Implicit Places using invariants and state equation in 7380 ms returned []
Implicit Place search using SMT with State Equation took 8218 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:24:34] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:24:34] [INFO ] Invariant cache hit.
[2024-05-27 04:24:34] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30894ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30918ms
Finished structural reductions in LTL mode , in 1 iterations and 39187 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin14329465250457952348
[2024-05-27 04:25:05] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14329465250457952348
Running compilation step : cd /tmp/ltsmin14329465250457952348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14329465250457952348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14329465250457952348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 04:25:08] [INFO ] Flatten gal took : 96 ms
[2024-05-27 04:25:08] [INFO ] Flatten gal took : 99 ms
[2024-05-27 04:25:08] [INFO ] Time to serialize gal into /tmp/LTL11559853538176672540.gal : 31 ms
[2024-05-27 04:25:08] [INFO ] Time to serialize properties into /tmp/LTL15620745066440927716.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11559853538176672540.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14857055437862938179.hoa' '-atoms' '/tmp/LTL15620745066440927716.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15620745066440927716.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14857055437862938179.hoa
Detected timeout of ITS tools.
[2024-05-27 04:25:24] [INFO ] Flatten gal took : 126 ms
[2024-05-27 04:25:24] [INFO ] Flatten gal took : 115 ms
[2024-05-27 04:25:24] [INFO ] Time to serialize gal into /tmp/LTL17544344147482108484.gal : 36 ms
[2024-05-27 04:25:24] [INFO ] Time to serialize properties into /tmp/LTL8408825595386890099.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17544344147482108484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8408825595386890099.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(...12419
Formula 0 simplified : G!"(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(Te...12405
Detected timeout of ITS tools.
[2024-05-27 04:25:39] [INFO ] Flatten gal took : 60 ms
[2024-05-27 04:25:39] [INFO ] Applying decomposition
[2024-05-27 04:25:39] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2521441758302616580.txt' '-o' '/tmp/graph2521441758302616580.bin' '-w' '/tmp/graph2521441758302616580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2521441758302616580.bin' '-l' '-1' '-v' '-w' '/tmp/graph2521441758302616580.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:25:39] [INFO ] Decomposing Gal with order
[2024-05-27 04:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:25:40] [INFO ] Removed a total of 1792 redundant transitions.
[2024-05-27 04:25:40] [INFO ] Flatten gal took : 244 ms
[2024-05-27 04:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-27 04:25:40] [INFO ] Time to serialize gal into /tmp/LTL11446376835406411898.gal : 37 ms
[2024-05-27 04:25:40] [INFO ] Time to serialize properties into /tmp/LTL7873390896589076825.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11446376835406411898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7873390896589076825.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((i11.u283.WantSection_5_T==0)||(i19.i0.i0.u507.TestAlone_4_5_5==0))&&((i11.u283.WantSection_5_T==0)||(i0.u235.TestAlo...18943
Formula 0 simplified : G!"(((((((((((i11.u283.WantSection_5_T==0)||(i19.i0.i0.u507.TestAlone_4_5_5==0))&&((i11.u283.WantSection_5_T==0)||(i0.u235.TestAlone...18929
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 198133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 28 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:25:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:25:56] [INFO ] Computed 27 invariants in 12 ms
[2024-05-27 04:25:57] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-05-27 04:25:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:25:57] [INFO ] Invariant cache hit.
[2024-05-27 04:25:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:26:02] [INFO ] Implicit Places using invariants and state equation in 5447 ms returned []
Implicit Place search using SMT with State Equation took 6598 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:26:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:26:02] [INFO ] Invariant cache hit.
[2024-05-27 04:26:02] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30887ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30914ms
Finished structural reductions in LTL mode , in 1 iterations and 37557 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 415 ms.
Stack based approach found an accepted trace after 429 steps with 0 reset with depth 430 and stack size 430 in 5 ms.
FORMULA Peterson-PT-6-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 38182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 136 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2024-05-27 04:26:34] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2024-05-27 04:26:34] [INFO ] Computed 27 invariants in 5 ms
[2024-05-27 04:26:35] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-27 04:26:35] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-05-27 04:26:35] [INFO ] Invariant cache hit.
[2024-05-27 04:26:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:26:38] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned []
Implicit Place search using SMT with State Equation took 3845 ms to find 0 implicit places.
[2024-05-27 04:26:38] [INFO ] Redundant transitions in 39 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-27 04:26:38] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-05-27 04:26:38] [INFO ] Invariant cache hit.
[2024-05-27 04:26:38] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 6/405 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
SMT process timed out in 30632ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1330 places, 1106/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34684 ms. Remains : 406/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 486 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 35259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 65 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:27:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:27:09] [INFO ] Computed 27 invariants in 14 ms
[2024-05-27 04:27:10] [INFO ] Implicit Places using invariants in 1195 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1198 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 63 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1330 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, p0, p0, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 1527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:27:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:27:11] [INFO ] Invariant cache hit.
[2024-05-27 04:27:11] [INFO ] Implicit Places using invariants in 961 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 963 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1039 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-06
Product exploration explored 100000 steps with 4116 reset in 4020 ms.
Product exploration explored 100000 steps with 4119 reset in 4038 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 88 steps (0 resets) in 23 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 04:27:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-27 04:27:21] [INFO ] Computed 20 invariants in 10 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:27:36] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:27:36] [INFO ] Invariant cache hit.
[2024-05-27 04:27:37] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-05-27 04:27:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:27:37] [INFO ] Invariant cache hit.
[2024-05-27 04:27:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:27:41] [INFO ] Implicit Places using invariants and state equation in 4501 ms returned []
Implicit Place search using SMT with State Equation took 5341 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:27:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:27:41] [INFO ] Invariant cache hit.
[2024-05-27 04:27:41] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31055ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31081ms
Finished structural reductions in LTL mode , in 1 iterations and 36466 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 90 steps (0 resets) in 32 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 04:28:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:28:14] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4099 reset in 6047 ms.
Product exploration explored 100000 steps with 4058 reset in 5712 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1323 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 84 place count 1323 transition count 2030
Deduced a syphon composed of 343 places in 2 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 343 place count 1323 transition count 2030
Discarding 114 places :
Symmetric choice reduction at 1 with 114 rule applications. Total rules 457 place count 1209 transition count 1916
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 571 place count 1209 transition count 1916
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 648 place count 1209 transition count 1916
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 689 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 730 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 1 ms
Applied a total of 730 rules in 268 ms. Remains 1168 /1323 variables (removed 155) and now considering 1875/2030 (removed 155) transitions.
[2024-05-27 04:28:42] [INFO ] Redundant transitions in 41 ms returned []
Running 1868 sub problems to find dead transitions.
[2024-05-27 04:28:42] [INFO ] Flow matrix only has 1665 transitions (discarded 210 similar events)
// Phase 1: matrix 1665 rows 1168 cols
[2024-05-27 04:28:42] [INFO ] Computed 20 invariants in 14 ms
[2024-05-27 04:28:42] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/2833 variables, and 20 constraints, problems are : Problem set: 0 solved, 1868 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1168 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1868/1868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
[2024-05-27 04:29:15] [INFO ] Deduced a trap composed of 12 places in 1173 ms of which 10 ms to minimize.
[2024-05-27 04:29:16] [INFO ] Deduced a trap composed of 49 places in 915 ms of which 10 ms to minimize.
[2024-05-27 04:29:17] [INFO ] Deduced a trap composed of 35 places in 1001 ms of which 15 ms to minimize.
[2024-05-27 04:29:19] [INFO ] Deduced a trap composed of 42 places in 1302 ms of which 14 ms to minimize.
[2024-05-27 04:29:20] [INFO ] Deduced a trap composed of 84 places in 1308 ms of which 15 ms to minimize.
[2024-05-27 04:29:21] [INFO ] Deduced a trap composed of 42 places in 1169 ms of which 13 ms to minimize.
[2024-05-27 04:29:22] [INFO ] Deduced a trap composed of 107 places in 1038 ms of which 13 ms to minimize.
[2024-05-27 04:29:23] [INFO ] Deduced a trap composed of 80 places in 1047 ms of which 12 ms to minimize.
[2024-05-27 04:29:25] [INFO ] Deduced a trap composed of 74 places in 1019 ms of which 13 ms to minimize.
[2024-05-27 04:29:26] [INFO ] Deduced a trap composed of 61 places in 1101 ms of which 13 ms to minimize.
[2024-05-27 04:29:27] [INFO ] Deduced a trap composed of 58 places in 1125 ms of which 14 ms to minimize.
[2024-05-27 04:29:28] [INFO ] Deduced a trap composed of 147 places in 849 ms of which 11 ms to minimize.
[2024-05-27 04:29:28] [INFO ] Deduced a trap composed of 128 places in 696 ms of which 10 ms to minimize.
[2024-05-27 04:29:29] [INFO ] Deduced a trap composed of 147 places in 838 ms of which 10 ms to minimize.
[2024-05-27 04:29:30] [INFO ] Deduced a trap composed of 195 places in 815 ms of which 11 ms to minimize.
[2024-05-27 04:29:31] [INFO ] Deduced a trap composed of 122 places in 813 ms of which 10 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-27 04:29:32] [INFO ] Deduced a trap composed of 67 places in 980 ms of which 10 ms to minimize.
[2024-05-27 04:29:33] [INFO ] Deduced a trap composed of 67 places in 934 ms of which 9 ms to minimize.
[2024-05-27 04:29:34] [INFO ] Deduced a trap composed of 64 places in 1220 ms of which 13 ms to minimize.
[2024-05-27 04:29:35] [INFO ] Deduced a trap composed of 81 places in 1097 ms of which 12 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1843 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1168 variables, 20/40 constraints. Problems are: Problem set: 37 solved, 1831 unsolved
[2024-05-27 04:29:38] [INFO ] Deduced a trap composed of 34 places in 1449 ms of which 16 ms to minimize.
[2024-05-27 04:29:39] [INFO ] Deduced a trap composed of 37 places in 1346 ms of which 15 ms to minimize.
[2024-05-27 04:29:41] [INFO ] Deduced a trap composed of 37 places in 1435 ms of which 16 ms to minimize.
[2024-05-27 04:29:42] [INFO ] Deduced a trap composed of 33 places in 1311 ms of which 16 ms to minimize.
[2024-05-27 04:29:43] [INFO ] Deduced a trap composed of 97 places in 1365 ms of which 15 ms to minimize.
SMT process timed out in 61675ms, After SMT, problems are : Problem set: 37 solved, 1831 unsolved
Search for dead transitions found 37 dead transitions in 61694ms
Found 37 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 37 transitions
Dead transitions reduction (with SMT) removed 37 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1323 places, 1838/2030 transitions.
Graph (complete) has 3630 edges and 1168 vertex of which 1131 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.8 ms
Discarding 37 places :
Also discarding 0 output transitions
Deduced a syphon composed of 228 places in 1 ms
Applied a total of 1 rules in 54 ms. Remains 1131 /1168 variables (removed 37) and now considering 1838/1838 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1131/1323 places, 1838/2030 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62075 ms. Remains : 1131/1323 places, 1838/2030 transitions.
Built C files in :
/tmp/ltsmin12207387891835747521
[2024-05-27 04:29:43] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12207387891835747521
Running compilation step : cd /tmp/ltsmin12207387891835747521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12207387891835747521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12207387891835747521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:29:46] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-27 04:29:46] [INFO ] Computed 20 invariants in 9 ms
[2024-05-27 04:29:47] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-27 04:29:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:29:47] [INFO ] Invariant cache hit.
[2024-05-27 04:29:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:29:51] [INFO ] Implicit Places using invariants and state equation in 3835 ms returned []
Implicit Place search using SMT with State Equation took 4710 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-05-27 04:29:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:29:51] [INFO ] Invariant cache hit.
[2024-05-27 04:29:51] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30760ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30782ms
Finished structural reductions in LTL mode , in 1 iterations and 35532 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Built C files in :
/tmp/ltsmin11552451293501809145
[2024-05-27 04:30:22] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11552451293501809145
Running compilation step : cd /tmp/ltsmin11552451293501809145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11552451293501809145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11552451293501809145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 04:30:25] [INFO ] Flatten gal took : 60 ms
[2024-05-27 04:30:25] [INFO ] Flatten gal took : 64 ms
[2024-05-27 04:30:25] [INFO ] Time to serialize gal into /tmp/LTL3838247985455739866.gal : 9 ms
[2024-05-27 04:30:25] [INFO ] Time to serialize properties into /tmp/LTL16938648482861424341.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3838247985455739866.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12681576977284719075.hoa' '-atoms' '/tmp/LTL16938648482861424341.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16938648482861424341.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12681576977284719075.hoa
Detected timeout of ITS tools.
[2024-05-27 04:30:40] [INFO ] Flatten gal took : 54 ms
[2024-05-27 04:30:40] [INFO ] Flatten gal took : 52 ms
[2024-05-27 04:30:40] [INFO ] Time to serialize gal into /tmp/LTL3165387148281120496.gal : 9 ms
[2024-05-27 04:30:40] [INFO ] Time to serialize properties into /tmp/LTL7901360712764850452.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3165387148281120496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7901360712764850452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((((((((G("(((((((((TestIdentity_2_0_0==1)||(TestIdentity_6_3_2==1))||((TestIdentity_0_3_3==1)||(TestIdentity_0_4_1==1)))||((...18968
Formula 0 simplified : XXG(!"(((((((((WantSection_2_T==1)&&(TestAlone_5_5_2==1))||((WantSection_0_T==1)&&(TestAlone_2_3_0==1)))||(((WantSection_5_T==1)&&(T...18944
Detected timeout of ITS tools.
[2024-05-27 04:30:56] [INFO ] Flatten gal took : 49 ms
[2024-05-27 04:30:56] [INFO ] Applying decomposition
[2024-05-27 04:30:56] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10124556748937710628.txt' '-o' '/tmp/graph10124556748937710628.bin' '-w' '/tmp/graph10124556748937710628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10124556748937710628.bin' '-l' '-1' '-v' '-w' '/tmp/graph10124556748937710628.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:30:56] [INFO ] Decomposing Gal with order
[2024-05-27 04:30:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:30:56] [INFO ] Removed a total of 1792 redundant transitions.
[2024-05-27 04:30:56] [INFO ] Flatten gal took : 183 ms
[2024-05-27 04:30:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-27 04:30:57] [INFO ] Time to serialize gal into /tmp/LTL12022427286993472271.gal : 22 ms
[2024-05-27 04:30:57] [INFO ] Time to serialize properties into /tmp/LTL11834869194656410707.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12022427286993472271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11834869194656410707.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((((((((G("(((((((((i41.i0.i1.u383.TestIdentity_2_0_0==1)||(i32.i1.i0.u471.TestIdentity_6_3_2==1))||((i14.i1.i1.u231.TestIden...28996
Formula 0 simplified : XXG(!"(((((((((i23.i1.i1.u289.WantSection_2_T==1)&&(i36.u475.TestAlone_5_5_2==1))||((i22.i0.u291.WantSection_0_T==1)&&(i14.i0.i0.u43...28972
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 241279 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)) U (X(p2)||p1)))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:31:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:31:12] [INFO ] Computed 27 invariants in 7 ms
[2024-05-27 04:31:13] [INFO ] Implicit Places using invariants in 795 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 797 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 845 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-07 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(G(p1))&&F((G(!p2)||(!p2&&F(p3)))))))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Iterating post reduction 1 with 585 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 1170 place count 745 transition count 1152
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1756 place count 452 transition count 1152
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1840 place count 410 transition count 1110
Applied a total of 1840 rules in 88 ms. Remains 410 /1330 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
[2024-05-27 04:31:13] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2024-05-27 04:31:13] [INFO ] Computed 27 invariants in 3 ms
[2024-05-27 04:31:14] [INFO ] Implicit Places using invariants in 821 ms returned [390, 391, 393, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 830 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1330 places, 1110/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 943 ms. Remains : 403/1330 places, 1110/2030 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 413 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-08 finished in 1611 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)&&X(X(G(p1))))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 65 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:31:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:31:14] [INFO ] Computed 27 invariants in 9 ms
[2024-05-27 04:31:16] [INFO ] Implicit Places using invariants in 1340 ms returned [1205, 1206, 1208, 1302, 1303, 1304]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1343 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 65 ms. Remains 1324 /1324 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1480 ms. Remains : 1324/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-09 finished in 1728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X((X(F(!p0)) U p1))||p2)))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 65 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:31:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:31:16] [INFO ] Invariant cache hit.
[2024-05-27 04:31:17] [INFO ] Implicit Places using invariants in 1107 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1109 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 64 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1239 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 444 ms.
Stack based approach found an accepted trace after 3018 steps with 1 reset with depth 3013 and stack size 3013 in 14 ms.
FORMULA Peterson-PT-6-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-10 finished in 2018 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||G(p1))) U G((X(p0)||p2)))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 71 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:31:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:31:18] [INFO ] Invariant cache hit.
[2024-05-27 04:31:19] [INFO ] Implicit Places using invariants in 1071 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 41 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1186 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 302 ms.
Product exploration explored 100000 steps with 1 reset in 398 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) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 131 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, true, (NOT p1)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
[2024-05-27 04:31:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-27 04:31:21] [INFO ] Computed 20 invariants in 6 ms
[2024-05-27 04:31:21] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 543/546 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 543/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/549 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 780/1329 variables, 549/1104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1329 variables, 60/1164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1329 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 186/1515 variables, 42/1206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1515 variables, 42/1248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1515 variables, 6/1254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1515 variables, 6/1260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1515 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 288/1803 variables, 48/1308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1803 variables, 48/1356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1803 variables, 264/1620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1803 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 680/2483 variables, 4/1624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2483 variables, 680/2304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2483 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 4/2487 variables, 4/2308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2487 variables, 4/2312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2487 variables, 0/2312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 656/3143 variables, 684/2996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3687 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Problem apf0 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 543/546 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 543/549 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/549 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/549 variables, 3/552 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 3/555 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/555 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 780/1329 variables, 549/1104 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1329 variables, 60/1164 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1329 variables, 3/1167 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1329 variables, 0/1167 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 186/1515 variables, 42/1209 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1515 variables, 42/1251 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1515 variables, 6/1257 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1515 variables, 6/1263 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-27 04:31:27] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 6 ms to minimize.
[2024-05-27 04:31:27] [INFO ] Deduced a trap composed of 65 places in 490 ms of which 6 ms to minimize.
[2024-05-27 04:31:28] [INFO ] Deduced a trap composed of 72 places in 603 ms of which 8 ms to minimize.
[2024-05-27 04:31:28] [INFO ] Deduced a trap composed of 42 places in 513 ms of which 8 ms to minimize.
[2024-05-27 04:31:29] [INFO ] Deduced a trap composed of 35 places in 502 ms of which 7 ms to minimize.
[2024-05-27 04:31:30] [INFO ] Deduced a trap composed of 107 places in 467 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1515 variables, 6/1269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1515 variables, 0/1269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 288/1803 variables, 48/1317 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1803 variables, 48/1365 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SMT process timed out in 8725ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 584 transitions
Trivial Post-agglo rules discarded 584 transitions
Performed 584 trivial Post agglomeration. Transition count delta: 584
Iterating post reduction 0 with 584 rules applied. Total rules applied 584 place count 1323 transition count 1446
Reduce places removed 584 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 585 rules applied. Total rules applied 1169 place count 739 transition count 1445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1170 place count 738 transition count 1445
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 1170 place count 738 transition count 1152
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1756 place count 445 transition count 1152
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1840 place count 403 transition count 1110
Applied a total of 1840 rules in 126 ms. Remains 403 /1323 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 403/1323 places, 1110/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 1677 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 479720 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 3
Probabilistic random walk after 479720 steps, saw 66366 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2024-05-27 04:31:34] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2024-05-27 04:31:34] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 04:31:34] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 102/104 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 260/366 variables, 106/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 222/588 variables, 42/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 42/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 360/948 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/948 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 300/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 190/1138 variables, 5/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1138 variables, 190/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1138 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 5/1143 variables, 5/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1143 variables, 5/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1143 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 160/1303 variables, 195/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1303 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 1156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1098 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 403/403 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 102/104 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 260/366 variables, 106/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 222/588 variables, 42/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 42/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 04:31:36] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-27 04:31:36] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2024-05-27 04:31:36] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-27 04:31:36] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-27 04:31:36] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 360/948 variables, 60/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 60/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 300/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 04:31:37] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-27 04:31:37] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/948 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/948 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 190/1138 variables, 5/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1138 variables, 190/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 04:31:37] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-05-27 04:31:38] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 4 ms to minimize.
[2024-05-27 04:31:38] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1138 variables, 3/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1138 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 5/1143 variables, 5/969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1143 variables, 5/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1143 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 160/1303 variables, 195/1169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-27 04:31:39] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 5 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1303 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1303 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/1303 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 1170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4260 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 403/403 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 5372ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 330 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 29 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 24 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2024-05-27 04:31:40] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-27 04:31:40] [INFO ] Invariant cache hit.
[2024-05-27 04:31:41] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-27 04:31:41] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-27 04:31:41] [INFO ] Invariant cache hit.
[2024-05-27 04:31:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:31:43] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned []
Implicit Place search using SMT with State Equation took 3258 ms to find 0 implicit places.
[2024-05-27 04:31:43] [INFO ] Redundant transitions in 20 ms returned []
Running 1103 sub problems to find dead transitions.
[2024-05-27 04:31:43] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-05-27 04:31:43] [INFO ] Invariant cache hit.
[2024-05-27 04:31:43] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 403/403 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-27 04:31:59] [INFO ] Deduced a trap composed of 11 places in 483 ms of which 6 ms to minimize.
[2024-05-27 04:31:59] [INFO ] Deduced a trap composed of 18 places in 420 ms of which 5 ms to minimize.
[2024-05-27 04:32:00] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 5 ms to minimize.
[2024-05-27 04:32:00] [INFO ] Deduced a trap composed of 37 places in 403 ms of which 6 ms to minimize.
[2024-05-27 04:32:01] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 5 ms to minimize.
[2024-05-27 04:32:01] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 5 ms to minimize.
[2024-05-27 04:32:02] [INFO ] Deduced a trap composed of 30 places in 490 ms of which 6 ms to minimize.
[2024-05-27 04:32:02] [INFO ] Deduced a trap composed of 53 places in 473 ms of which 7 ms to minimize.
[2024-05-27 04:32:02] [INFO ] Deduced a trap composed of 29 places in 367 ms of which 6 ms to minimize.
[2024-05-27 04:32:03] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 6 ms to minimize.
[2024-05-27 04:32:03] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 4 ms to minimize.
[2024-05-27 04:32:04] [INFO ] Deduced a trap composed of 10 places in 436 ms of which 9 ms to minimize.
[2024-05-27 04:32:04] [INFO ] Deduced a trap composed of 12 places in 440 ms of which 5 ms to minimize.
[2024-05-27 04:32:04] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 3 ms to minimize.
[2024-05-27 04:32:05] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 4 ms to minimize.
[2024-05-27 04:32:05] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 4 ms to minimize.
[2024-05-27 04:32:05] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 3 ms to minimize.
[2024-05-27 04:32:05] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-27 04:32:06] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 4 ms to minimize.
[2024-05-27 04:32:06] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-05-27 04:32:07] [INFO ] Deduced a trap composed of 18 places in 512 ms of which 7 ms to minimize.
[2024-05-27 04:32:07] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 5 ms to minimize.
[2024-05-27 04:32:08] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 4 ms to minimize.
[2024-05-27 04:32:08] [INFO ] Deduced a trap composed of 27 places in 354 ms of which 4 ms to minimize.
[2024-05-27 04:32:09] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 3 ms to minimize.
[2024-05-27 04:32:09] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 4 ms to minimize.
[2024-05-27 04:32:09] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 4 ms to minimize.
[2024-05-27 04:32:10] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 4 ms to minimize.
[2024-05-27 04:32:10] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 3 ms to minimize.
[2024-05-27 04:32:10] [INFO ] Deduced a trap composed of 51 places in 342 ms of which 3 ms to minimize.
[2024-05-27 04:32:11] [INFO ] Deduced a trap composed of 20 places in 352 ms of which 4 ms to minimize.
[2024-05-27 04:32:11] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 4 ms to minimize.
[2024-05-27 04:32:12] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 5 ms to minimize.
[2024-05-27 04:32:12] [INFO ] Deduced a trap composed of 50 places in 334 ms of which 4 ms to minimize.
[2024-05-27 04:32:12] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 5 ms to minimize.
[2024-05-27 04:32:13] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 4 ms to minimize.
[2024-05-27 04:32:13] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 3 ms to minimize.
[2024-05-27 04:32:13] [INFO ] Deduced a trap composed of 18 places in 443 ms of which 5 ms to minimize.
[2024-05-27 04:32:14] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 5 ms to minimize.
SMT process timed out in 30784ms, After SMT, problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 30803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34120 ms. Remains : 403/403 places, 1110/1110 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 403 vertex of which 288 / 403 are part of one of the 42 SCC in 6 ms
Free SCC test removed 246 places
Drop transitions (Empty/Sink Transition effects.) removed 492 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 742 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 157 transition count 328
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 117 transition count 328
Performed 6 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 93 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 118 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions (Output transitions of discarded places.) removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 177 place count 12 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 305 place count 12 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 311 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 6 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 320 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 320 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 324 place count 4 transition count 4
Applied a total of 324 rules in 39 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-27 04:32:14] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 04:32:14] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 04:32:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 04:32:14] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-27 04:32:14] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-27 04:32:14] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 142 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p2), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 23 factoid took 357 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLFireability-11 finished in 56207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1)) U (F(p3)&&p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 48 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:32:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:32:14] [INFO ] Computed 27 invariants in 14 ms
[2024-05-27 04:32:16] [INFO ] Implicit Places using invariants in 1182 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1185 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 48 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1283 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-12 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 54 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:32:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-27 04:32:16] [INFO ] Invariant cache hit.
[2024-05-27 04:32:17] [INFO ] Implicit Places using invariants in 994 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 997 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1098 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 277 ms.
Product exploration explored 100000 steps with 0 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 311064 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 311064 steps, saw 193151 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-27 04:32:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-05-27 04:32:21] [INFO ] Computed 20 invariants in 5 ms
[2024-05-27 04:32:21] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/365 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 363/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/366 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 520/886 variables, 366/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 36/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/1108 variables, 42/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1108 variables, 42/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1108 variables, 6/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1108 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/1468 variables, 60/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1468 variables, 60/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1468 variables, 294/1276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1468 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 850/2318 variables, 5/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2318 variables, 850/2131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2318 variables, 0/2131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/2323 variables, 5/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2323 variables, 5/2141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2323 variables, 0/2141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 820/3143 variables, 855/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1596 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/365 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 363/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/366 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 520/886 variables, 366/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 36/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/1108 variables, 42/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1108 variables, 42/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1108 variables, 6/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:32:23] [INFO ] Deduced a trap composed of 117 places in 209 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/1468 variables, 60/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1468 variables, 60/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1468 variables, 294/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1468 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 850/2318 variables, 5/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2318 variables, 850/2133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:32:25] [INFO ] Deduced a trap composed of 15 places in 1270 ms of which 11 ms to minimize.
[2024-05-27 04:32:26] [INFO ] Deduced a trap composed of 19 places in 1234 ms of which 11 ms to minimize.
[2024-05-27 04:32:28] [INFO ] Deduced a trap composed of 98 places in 1131 ms of which 11 ms to minimize.
SMT process timed out in 6627ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1323 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 736 transition count 1149
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 68 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 400/1323 places, 1107/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 722152 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 1
Probabilistic random walk after 722152 steps, saw 96957 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-05-27 04:32:31] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-27 04:32:31] [INFO ] Computed 20 invariants in 3 ms
[2024-05-27 04:32:31] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 819 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:32:32] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-27 04:32:32] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:32:33] [INFO ] Deduced a trap composed of 62 places in 412 ms of which 6 ms to minimize.
[2024-05-27 04:32:33] [INFO ] Deduced a trap composed of 37 places in 413 ms of which 6 ms to minimize.
[2024-05-27 04:32:34] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 4 ms to minimize.
[2024-05-27 04:32:34] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 4 ms to minimize.
[2024-05-27 04:32:35] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 6 ms to minimize.
[2024-05-27 04:32:35] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 6 ms to minimize.
[2024-05-27 04:32:35] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 6 ms to minimize.
[2024-05-27 04:32:36] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 6 ms to minimize.
[2024-05-27 04:32:36] [INFO ] Deduced a trap composed of 88 places in 408 ms of which 6 ms to minimize.
[2024-05-27 04:32:37] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 5 ms to minimize.
[2024-05-27 04:32:37] [INFO ] Deduced a trap composed of 37 places in 470 ms of which 6 ms to minimize.
[2024-05-27 04:32:38] [INFO ] Deduced a trap composed of 14 places in 444 ms of which 6 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 12/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1297 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6469 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 7307ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 29 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 28 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:32:38] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:32:38] [INFO ] Invariant cache hit.
[2024-05-27 04:32:39] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-05-27 04:32:39] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:32:39] [INFO ] Invariant cache hit.
[2024-05-27 04:32:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:32:41] [INFO ] Implicit Places using invariants and state equation in 2513 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2024-05-27 04:32:41] [INFO ] Redundant transitions in 12 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:32:41] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:32:41] [INFO ] Invariant cache hit.
[2024-05-27 04:32:41] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:32:55] [INFO ] Deduced a trap composed of 46 places in 414 ms of which 6 ms to minimize.
[2024-05-27 04:32:56] [INFO ] Deduced a trap composed of 29 places in 418 ms of which 6 ms to minimize.
[2024-05-27 04:32:56] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 6 ms to minimize.
[2024-05-27 04:32:56] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 6 ms to minimize.
[2024-05-27 04:32:57] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 5 ms to minimize.
[2024-05-27 04:32:57] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 5 ms to minimize.
[2024-05-27 04:32:58] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 5 ms to minimize.
[2024-05-27 04:32:58] [INFO ] Deduced a trap composed of 10 places in 423 ms of which 6 ms to minimize.
[2024-05-27 04:32:58] [INFO ] Deduced a trap composed of 55 places in 471 ms of which 6 ms to minimize.
[2024-05-27 04:32:59] [INFO ] Deduced a trap composed of 11 places in 479 ms of which 6 ms to minimize.
[2024-05-27 04:32:59] [INFO ] Deduced a trap composed of 21 places in 408 ms of which 6 ms to minimize.
[2024-05-27 04:33:00] [INFO ] Deduced a trap composed of 29 places in 443 ms of which 6 ms to minimize.
[2024-05-27 04:33:00] [INFO ] Deduced a trap composed of 29 places in 449 ms of which 5 ms to minimize.
[2024-05-27 04:33:01] [INFO ] Deduced a trap composed of 27 places in 450 ms of which 5 ms to minimize.
[2024-05-27 04:33:01] [INFO ] Deduced a trap composed of 29 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:33:02] [INFO ] Deduced a trap composed of 56 places in 413 ms of which 5 ms to minimize.
[2024-05-27 04:33:02] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 5 ms to minimize.
[2024-05-27 04:33:02] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 5 ms to minimize.
[2024-05-27 04:33:03] [INFO ] Deduced a trap composed of 21 places in 429 ms of which 5 ms to minimize.
[2024-05-27 04:33:03] [INFO ] Deduced a trap composed of 51 places in 434 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:33:04] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 5 ms to minimize.
[2024-05-27 04:33:05] [INFO ] Deduced a trap composed of 60 places in 431 ms of which 6 ms to minimize.
[2024-05-27 04:33:05] [INFO ] Deduced a trap composed of 14 places in 406 ms of which 6 ms to minimize.
[2024-05-27 04:33:06] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 6 ms to minimize.
[2024-05-27 04:33:06] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 5 ms to minimize.
[2024-05-27 04:33:06] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 4 ms to minimize.
[2024-05-27 04:33:07] [INFO ] Deduced a trap composed of 36 places in 420 ms of which 5 ms to minimize.
[2024-05-27 04:33:07] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 5 ms to minimize.
[2024-05-27 04:33:08] [INFO ] Deduced a trap composed of 52 places in 365 ms of which 5 ms to minimize.
[2024-05-27 04:33:08] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 6 ms to minimize.
[2024-05-27 04:33:08] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 4 ms to minimize.
[2024-05-27 04:33:09] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 4 ms to minimize.
[2024-05-27 04:33:09] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 4 ms to minimize.
[2024-05-27 04:33:09] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 3 ms to minimize.
[2024-05-27 04:33:09] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 3 ms to minimize.
[2024-05-27 04:33:10] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 3 ms to minimize.
[2024-05-27 04:33:10] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 4 ms to minimize.
[2024-05-27 04:33:10] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 4 ms to minimize.
[2024-05-27 04:33:11] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 3 ms to minimize.
[2024-05-27 04:33:11] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30032 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:33:14] [INFO ] Deduced a trap composed of 26 places in 476 ms of which 6 ms to minimize.
[2024-05-27 04:33:15] [INFO ] Deduced a trap composed of 10 places in 482 ms of which 6 ms to minimize.
[2024-05-27 04:33:15] [INFO ] Deduced a trap composed of 51 places in 450 ms of which 6 ms to minimize.
[2024-05-27 04:33:16] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 6 ms to minimize.
[2024-05-27 04:33:16] [INFO ] Deduced a trap composed of 19 places in 455 ms of which 6 ms to minimize.
[2024-05-27 04:33:17] [INFO ] Deduced a trap composed of 19 places in 436 ms of which 6 ms to minimize.
[2024-05-27 04:33:17] [INFO ] Deduced a trap composed of 30 places in 422 ms of which 5 ms to minimize.
[2024-05-27 04:33:17] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 4 ms to minimize.
[2024-05-27 04:33:18] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 4 ms to minimize.
[2024-05-27 04:33:18] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 3 ms to minimize.
[2024-05-27 04:33:18] [INFO ] Deduced a trap composed of 70 places in 285 ms of which 4 ms to minimize.
[2024-05-27 04:33:19] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 7 ms to minimize.
[2024-05-27 04:33:19] [INFO ] Deduced a trap composed of 30 places in 409 ms of which 5 ms to minimize.
[2024-05-27 04:33:19] [INFO ] Deduced a trap composed of 50 places in 323 ms of which 5 ms to minimize.
[2024-05-27 04:33:20] [INFO ] Deduced a trap composed of 51 places in 311 ms of which 4 ms to minimize.
[2024-05-27 04:33:20] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-27 04:33:20] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 6 ms to minimize.
[2024-05-27 04:33:21] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 6 ms to minimize.
[2024-05-27 04:33:21] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 4 ms to minimize.
[2024-05-27 04:33:21] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:33:23] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 6 ms to minimize.
[2024-05-27 04:33:23] [INFO ] Deduced a trap composed of 10 places in 377 ms of which 5 ms to minimize.
[2024-05-27 04:33:24] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 5 ms to minimize.
[2024-05-27 04:33:24] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 4 ms to minimize.
[2024-05-27 04:33:24] [INFO ] Deduced a trap composed of 73 places in 289 ms of which 5 ms to minimize.
[2024-05-27 04:33:24] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 4 ms to minimize.
[2024-05-27 04:33:25] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 4 ms to minimize.
[2024-05-27 04:33:25] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 4 ms to minimize.
[2024-05-27 04:33:25] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 4 ms to minimize.
[2024-05-27 04:33:26] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 5 ms to minimize.
[2024-05-27 04:33:27] [INFO ] Deduced a trap composed of 76 places in 316 ms of which 5 ms to minimize.
[2024-05-27 04:33:27] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 5 ms to minimize.
[2024-05-27 04:33:28] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-05-27 04:33:28] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 5 ms to minimize.
[2024-05-27 04:33:29] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 4 ms to minimize.
[2024-05-27 04:33:29] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 4 ms to minimize.
[2024-05-27 04:33:29] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 4 ms to minimize.
[2024-05-27 04:33:30] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 4 ms to minimize.
[2024-05-27 04:33:30] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 4 ms to minimize.
[2024-05-27 04:33:31] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:33:32] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
[2024-05-27 04:33:32] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 2 ms to minimize.
[2024-05-27 04:33:32] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 4 ms to minimize.
[2024-05-27 04:33:33] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 3 ms to minimize.
[2024-05-27 04:33:33] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 4 ms to minimize.
[2024-05-27 04:33:33] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 3 ms to minimize.
[2024-05-27 04:33:33] [INFO ] Deduced a trap composed of 30 places in 326 ms of which 4 ms to minimize.
[2024-05-27 04:33:34] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 4 ms to minimize.
[2024-05-27 04:33:34] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 3 ms to minimize.
[2024-05-27 04:33:34] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 3 ms to minimize.
[2024-05-27 04:33:35] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 3 ms to minimize.
[2024-05-27 04:33:35] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 3 ms to minimize.
[2024-05-27 04:33:35] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2024-05-27 04:33:36] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 5 ms to minimize.
[2024-05-27 04:33:36] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 4 ms to minimize.
[2024-05-27 04:33:36] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
[2024-05-27 04:33:37] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 5 ms to minimize.
[2024-05-27 04:33:37] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 5 ms to minimize.
[2024-05-27 04:33:38] [INFO ] Deduced a trap composed of 40 places in 335 ms of which 5 ms to minimize.
[2024-05-27 04:33:38] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:33:40] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 4 ms to minimize.
[2024-05-27 04:33:40] [INFO ] Deduced a trap composed of 37 places in 341 ms of which 4 ms to minimize.
[2024-05-27 04:33:40] [INFO ] Deduced a trap composed of 34 places in 343 ms of which 5 ms to minimize.
[2024-05-27 04:33:41] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 4 ms to minimize.
[2024-05-27 04:33:41] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-27 04:33:41] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1297 variables, and 526 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30038 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 106/106 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63788 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 25 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-27 04:33:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-27 04:33:42] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 04:33:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-27 04:33:42] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 04:33:42] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 04:33:42] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 175 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1323 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 736 transition count 1149
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 123 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2024-05-27 04:33:42] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-27 04:33:42] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 04:33:43] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-05-27 04:33:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:33:43] [INFO ] Invariant cache hit.
[2024-05-27 04:33:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:33:46] [INFO ] Implicit Places using invariants and state equation in 3088 ms returned []
Implicit Place search using SMT with State Equation took 3931 ms to find 0 implicit places.
[2024-05-27 04:33:46] [INFO ] Redundant transitions in 27 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:33:46] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:33:46] [INFO ] Invariant cache hit.
[2024-05-27 04:33:46] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:34:03] [INFO ] Deduced a trap composed of 46 places in 494 ms of which 7 ms to minimize.
[2024-05-27 04:34:03] [INFO ] Deduced a trap composed of 29 places in 495 ms of which 6 ms to minimize.
[2024-05-27 04:34:04] [INFO ] Deduced a trap composed of 51 places in 478 ms of which 6 ms to minimize.
[2024-05-27 04:34:04] [INFO ] Deduced a trap composed of 19 places in 481 ms of which 6 ms to minimize.
[2024-05-27 04:34:05] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 6 ms to minimize.
[2024-05-27 04:34:05] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 5 ms to minimize.
[2024-05-27 04:34:06] [INFO ] Deduced a trap composed of 13 places in 474 ms of which 6 ms to minimize.
[2024-05-27 04:34:06] [INFO ] Deduced a trap composed of 10 places in 475 ms of which 5 ms to minimize.
[2024-05-27 04:34:07] [INFO ] Deduced a trap composed of 55 places in 478 ms of which 6 ms to minimize.
[2024-05-27 04:34:07] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 6 ms to minimize.
[2024-05-27 04:34:08] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 5 ms to minimize.
[2024-05-27 04:34:08] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 6 ms to minimize.
[2024-05-27 04:34:09] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 6 ms to minimize.
[2024-05-27 04:34:09] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 5 ms to minimize.
[2024-05-27 04:34:10] [INFO ] Deduced a trap composed of 29 places in 422 ms of which 5 ms to minimize.
[2024-05-27 04:34:10] [INFO ] Deduced a trap composed of 56 places in 396 ms of which 5 ms to minimize.
[2024-05-27 04:34:10] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 4 ms to minimize.
[2024-05-27 04:34:11] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 6 ms to minimize.
[2024-05-27 04:34:11] [INFO ] Deduced a trap composed of 21 places in 436 ms of which 5 ms to minimize.
[2024-05-27 04:34:12] [INFO ] Deduced a trap composed of 51 places in 420 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:34:13] [INFO ] Deduced a trap composed of 62 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:34:13] [INFO ] Deduced a trap composed of 60 places in 495 ms of which 6 ms to minimize.
[2024-05-27 04:34:14] [INFO ] Deduced a trap composed of 14 places in 453 ms of which 6 ms to minimize.
[2024-05-27 04:34:14] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 5 ms to minimize.
[2024-05-27 04:34:15] [INFO ] Deduced a trap composed of 21 places in 449 ms of which 5 ms to minimize.
[2024-05-27 04:34:15] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 6 ms to minimize.
[2024-05-27 04:34:16] [INFO ] Deduced a trap composed of 36 places in 429 ms of which 5 ms to minimize.
[2024-05-27 04:34:16] [INFO ] Deduced a trap composed of 22 places in 404 ms of which 6 ms to minimize.
[2024-05-27 04:34:17] [INFO ] Deduced a trap composed of 52 places in 420 ms of which 5 ms to minimize.
[2024-05-27 04:34:17] [INFO ] Deduced a trap composed of 27 places in 414 ms of which 6 ms to minimize.
[2024-05-27 04:34:17] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 5 ms to minimize.
SMT process timed out in 31003ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 31024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1323 places, 1107/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35115 ms. Remains : 400/1323 places, 1107/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 67 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 571048 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 571048 steps, saw 75622 distinct states, run finished after 3002 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-27 04:34:21] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:34:21] [INFO ] Invariant cache hit.
[2024-05-27 04:34:21] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 783 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:34:22] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 3 ms to minimize.
[2024-05-27 04:34:22] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
[2024-05-27 04:34:22] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:34:23] [INFO ] Deduced a trap composed of 19 places in 514 ms of which 7 ms to minimize.
[2024-05-27 04:34:24] [INFO ] Deduced a trap composed of 31 places in 515 ms of which 6 ms to minimize.
[2024-05-27 04:34:24] [INFO ] Deduced a trap composed of 10 places in 490 ms of which 6 ms to minimize.
[2024-05-27 04:34:25] [INFO ] Deduced a trap composed of 64 places in 452 ms of which 5 ms to minimize.
[2024-05-27 04:34:25] [INFO ] Deduced a trap composed of 27 places in 459 ms of which 6 ms to minimize.
[2024-05-27 04:34:26] [INFO ] Deduced a trap composed of 52 places in 476 ms of which 6 ms to minimize.
[2024-05-27 04:34:26] [INFO ] Deduced a trap composed of 19 places in 459 ms of which 5 ms to minimize.
[2024-05-27 04:34:27] [INFO ] Deduced a trap composed of 21 places in 456 ms of which 5 ms to minimize.
SMT process timed out in 5911ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 24 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 670968 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 670968 steps, saw 89587 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2024-05-27 04:34:30] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:34:30] [INFO ] Invariant cache hit.
[2024-05-27 04:34:30] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 537 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:34:31] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
[2024-05-27 04:34:31] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 3 ms to minimize.
[2024-05-27 04:34:31] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:34:32] [INFO ] Deduced a trap composed of 19 places in 514 ms of which 6 ms to minimize.
[2024-05-27 04:34:32] [INFO ] Deduced a trap composed of 31 places in 514 ms of which 6 ms to minimize.
[2024-05-27 04:34:33] [INFO ] Deduced a trap composed of 10 places in 495 ms of which 7 ms to minimize.
[2024-05-27 04:34:33] [INFO ] Deduced a trap composed of 64 places in 469 ms of which 5 ms to minimize.
[2024-05-27 04:34:34] [INFO ] Deduced a trap composed of 27 places in 469 ms of which 5 ms to minimize.
[2024-05-27 04:34:34] [INFO ] Deduced a trap composed of 52 places in 462 ms of which 5 ms to minimize.
[2024-05-27 04:34:35] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 5 ms to minimize.
[2024-05-27 04:34:35] [INFO ] Deduced a trap composed of 21 places in 454 ms of which 6 ms to minimize.
[2024-05-27 04:34:36] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:34:37] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6439 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 6988ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 23 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 23 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:34:37] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:34:37] [INFO ] Invariant cache hit.
[2024-05-27 04:34:38] [INFO ] Implicit Places using invariants in 766 ms returned []
[2024-05-27 04:34:38] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:34:38] [INFO ] Invariant cache hit.
[2024-05-27 04:34:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:34:41] [INFO ] Implicit Places using invariants and state equation in 3061 ms returned []
Implicit Place search using SMT with State Equation took 3830 ms to find 0 implicit places.
[2024-05-27 04:34:41] [INFO ] Redundant transitions in 21 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:34:41] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:34:41] [INFO ] Invariant cache hit.
[2024-05-27 04:34:41] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:34:57] [INFO ] Deduced a trap composed of 46 places in 523 ms of which 7 ms to minimize.
[2024-05-27 04:34:57] [INFO ] Deduced a trap composed of 29 places in 488 ms of which 6 ms to minimize.
[2024-05-27 04:34:58] [INFO ] Deduced a trap composed of 51 places in 479 ms of which 6 ms to minimize.
[2024-05-27 04:34:58] [INFO ] Deduced a trap composed of 19 places in 475 ms of which 6 ms to minimize.
[2024-05-27 04:34:59] [INFO ] Deduced a trap composed of 12 places in 530 ms of which 4 ms to minimize.
[2024-05-27 04:34:59] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 6 ms to minimize.
[2024-05-27 04:35:00] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 5 ms to minimize.
[2024-05-27 04:35:00] [INFO ] Deduced a trap composed of 10 places in 430 ms of which 6 ms to minimize.
[2024-05-27 04:35:01] [INFO ] Deduced a trap composed of 55 places in 473 ms of which 6 ms to minimize.
[2024-05-27 04:35:01] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 6 ms to minimize.
[2024-05-27 04:35:02] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 5 ms to minimize.
[2024-05-27 04:35:02] [INFO ] Deduced a trap composed of 29 places in 444 ms of which 6 ms to minimize.
[2024-05-27 04:35:03] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 5 ms to minimize.
[2024-05-27 04:35:03] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 6 ms to minimize.
[2024-05-27 04:35:04] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 6 ms to minimize.
[2024-05-27 04:35:04] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 6 ms to minimize.
[2024-05-27 04:35:04] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 5 ms to minimize.
[2024-05-27 04:35:05] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 5 ms to minimize.
[2024-05-27 04:35:05] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 6 ms to minimize.
[2024-05-27 04:35:06] [INFO ] Deduced a trap composed of 51 places in 419 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:35:07] [INFO ] Deduced a trap composed of 62 places in 296 ms of which 4 ms to minimize.
[2024-05-27 04:35:07] [INFO ] Deduced a trap composed of 60 places in 483 ms of which 6 ms to minimize.
[2024-05-27 04:35:08] [INFO ] Deduced a trap composed of 14 places in 464 ms of which 6 ms to minimize.
[2024-05-27 04:35:08] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 6 ms to minimize.
[2024-05-27 04:35:09] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 6 ms to minimize.
[2024-05-27 04:35:09] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 6 ms to minimize.
[2024-05-27 04:35:09] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 6 ms to minimize.
[2024-05-27 04:35:10] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 5 ms to minimize.
[2024-05-27 04:35:10] [INFO ] Deduced a trap composed of 52 places in 416 ms of which 5 ms to minimize.
[2024-05-27 04:35:11] [INFO ] Deduced a trap composed of 27 places in 432 ms of which 6 ms to minimize.
[2024-05-27 04:35:11] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 5 ms to minimize.
SMT process timed out in 30611ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34517 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 27 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-27 04:35:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-27 04:35:11] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 04:35:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-27 04:35:11] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 04:35:11] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 04:35:11] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 151 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 309 ms.
Built C files in :
/tmp/ltsmin17051205302664853937
[2024-05-27 04:35:12] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-27 04:35:12] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:35:12] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-27 04:35:12] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:35:13] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-27 04:35:13] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:35:13] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17051205302664853937
Running compilation step : cd /tmp/ltsmin17051205302664853937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17051205302664853937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17051205302664853937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:35:16] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-27 04:35:16] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 04:35:16] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-27 04:35:16] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:35:16] [INFO ] Invariant cache hit.
[2024-05-27 04:35:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:35:18] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
[2024-05-27 04:35:18] [INFO ] Redundant transitions in 20 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:35:18] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:35:18] [INFO ] Invariant cache hit.
[2024-05-27 04:35:18] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:35:35] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 6 ms to minimize.
[2024-05-27 04:35:35] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 6 ms to minimize.
[2024-05-27 04:35:36] [INFO ] Deduced a trap composed of 51 places in 468 ms of which 6 ms to minimize.
[2024-05-27 04:35:36] [INFO ] Deduced a trap composed of 19 places in 482 ms of which 6 ms to minimize.
[2024-05-27 04:35:37] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 6 ms to minimize.
[2024-05-27 04:35:37] [INFO ] Deduced a trap composed of 11 places in 452 ms of which 6 ms to minimize.
[2024-05-27 04:35:37] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 5 ms to minimize.
[2024-05-27 04:35:38] [INFO ] Deduced a trap composed of 10 places in 447 ms of which 5 ms to minimize.
[2024-05-27 04:35:38] [INFO ] Deduced a trap composed of 55 places in 427 ms of which 5 ms to minimize.
[2024-05-27 04:35:39] [INFO ] Deduced a trap composed of 11 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:35:39] [INFO ] Deduced a trap composed of 21 places in 440 ms of which 6 ms to minimize.
[2024-05-27 04:35:40] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 6 ms to minimize.
[2024-05-27 04:35:40] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 6 ms to minimize.
[2024-05-27 04:35:41] [INFO ] Deduced a trap composed of 27 places in 430 ms of which 6 ms to minimize.
[2024-05-27 04:35:41] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 5 ms to minimize.
[2024-05-27 04:35:41] [INFO ] Deduced a trap composed of 56 places in 385 ms of which 5 ms to minimize.
[2024-05-27 04:35:42] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 4 ms to minimize.
[2024-05-27 04:35:42] [INFO ] Deduced a trap composed of 22 places in 398 ms of which 5 ms to minimize.
[2024-05-27 04:35:43] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 5 ms to minimize.
[2024-05-27 04:35:43] [INFO ] Deduced a trap composed of 51 places in 417 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:35:44] [INFO ] Deduced a trap composed of 62 places in 457 ms of which 6 ms to minimize.
[2024-05-27 04:35:45] [INFO ] Deduced a trap composed of 60 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:35:45] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 6 ms to minimize.
[2024-05-27 04:35:46] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 6 ms to minimize.
[2024-05-27 04:35:46] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 6 ms to minimize.
[2024-05-27 04:35:47] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 6 ms to minimize.
[2024-05-27 04:35:47] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 6 ms to minimize.
[2024-05-27 04:35:47] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 6 ms to minimize.
[2024-05-27 04:35:48] [INFO ] Deduced a trap composed of 52 places in 408 ms of which 5 ms to minimize.
[2024-05-27 04:35:48] [INFO ] Deduced a trap composed of 27 places in 401 ms of which 6 ms to minimize.
[2024-05-27 04:35:49] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 5 ms to minimize.
[2024-05-27 04:35:49] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 5 ms to minimize.
SMT process timed out in 30775ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33397 ms. Remains : 400/400 places, 1107/1107 transitions.
Built C files in :
/tmp/ltsmin5163220986837951552
[2024-05-27 04:35:49] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-27 04:35:49] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:35:49] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-27 04:35:49] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:35:49] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-27 04:35:50] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:35:50] [INFO ] Built C files in 418ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5163220986837951552
Running compilation step : cd /tmp/ltsmin5163220986837951552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5163220986837951552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5163220986837951552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 04:35:53] [INFO ] Flatten gal took : 27 ms
[2024-05-27 04:35:53] [INFO ] Flatten gal took : 29 ms
[2024-05-27 04:35:53] [INFO ] Time to serialize gal into /tmp/LTL17458526070309293521.gal : 5 ms
[2024-05-27 04:35:53] [INFO ] Time to serialize properties into /tmp/LTL2451128599147074815.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17458526070309293521.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3392331543993127686.hoa' '-atoms' '/tmp/LTL2451128599147074815.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2451128599147074815.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3392331543993127686.hoa
Detected timeout of ITS tools.
[2024-05-27 04:36:08] [INFO ] Flatten gal took : 26 ms
[2024-05-27 04:36:08] [INFO ] Flatten gal took : 26 ms
[2024-05-27 04:36:08] [INFO ] Time to serialize gal into /tmp/LTL15480831452434105037.gal : 5 ms
[2024-05-27 04:36:08] [INFO ] Time to serialize properties into /tmp/LTL281141925272985846.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15480831452434105037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL281141925272985846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((WantSection_3_F==0)||(TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((WantSection_3_F==0)||(TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
[2024-05-27 04:36:23] [INFO ] Flatten gal took : 26 ms
[2024-05-27 04:36:23] [INFO ] Applying decomposition
[2024-05-27 04:36:23] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10716517080453706793.txt' '-o' '/tmp/graph10716517080453706793.bin' '-w' '/tmp/graph10716517080453706793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10716517080453706793.bin' '-l' '-1' '-v' '-w' '/tmp/graph10716517080453706793.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:36:23] [INFO ] Decomposing Gal with order
[2024-05-27 04:36:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:36:23] [INFO ] Removed a total of 1577 redundant transitions.
[2024-05-27 04:36:23] [INFO ] Flatten gal took : 67 ms
[2024-05-27 04:36:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 650 labels/synchronizations in 53 ms.
[2024-05-27 04:36:23] [INFO ] Time to serialize gal into /tmp/LTL6853648581706453721.gal : 9 ms
[2024-05-27 04:36:23] [INFO ] Time to serialize properties into /tmp/LTL2335969958571184970.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6853648581706453721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2335969958571184970.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G("((i10.i0.u21.WantSection_3_F==0)||(i6.u0.TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((i10.i0.u21.WantSection_3_F==0)||(i6.u0.TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 262343 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))))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-27 04:36:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-27 04:36:38] [INFO ] Computed 27 invariants in 5 ms
[2024-05-27 04:36:39] [INFO ] Implicit Places using invariants in 1095 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1098 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 63 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1201 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 597 ms.
Stack based approach found an accepted trace after 1554 steps with 0 reset with depth 1555 and stack size 1555 in 14 ms.
FORMULA Peterson-PT-6-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-15 finished in 1975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Found a Shortening insensitive property : Peterson-PT-6-LTLFireability-01
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1330 transition count 1695
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 670 place count 995 transition count 1695
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 288 Pre rules applied. Total rules applied 670 place count 995 transition count 1407
Deduced a syphon composed of 288 places in 0 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1246 place count 707 transition count 1407
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1316 place count 672 transition count 1372
Applied a total of 1316 rules in 64 ms. Remains 672 /1330 variables (removed 658) and now considering 1372/2030 (removed 658) transitions.
[2024-05-27 04:36:41] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 672 cols
[2024-05-27 04:36:41] [INFO ] Computed 27 invariants in 3 ms
[2024-05-27 04:36:41] [INFO ] Implicit Places using invariants in 536 ms returned [646, 647, 649, 657, 658, 659, 660]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 542 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 665/1330 places, 1372/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 628 ms. Remains : 665/1330 places, 1372/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 911 ms.
Product exploration explored 100000 steps with 25000 reset in 666 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 699 steps (0 resets) in 5 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-05-27 04:36:43] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-05-27 04:36:43] [INFO ] Computed 20 invariants in 4 ms
[2024-05-27 04:36:44] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-27 04:36:44] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-27 04:36:44] [INFO ] Invariant cache hit.
[2024-05-27 04:36:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:36:46] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-05-27 04:36:46] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-27 04:36:46] [INFO ] Invariant cache hit.
[2024-05-27 04:36:46] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-05-27 04:37:15] [INFO ] Deduced a trap composed of 11 places in 787 ms of which 10 ms to minimize.
[2024-05-27 04:37:16] [INFO ] Deduced a trap composed of 31 places in 730 ms of which 9 ms to minimize.
[2024-05-27 04:37:16] [INFO ] Deduced a trap composed of 25 places in 715 ms of which 9 ms to minimize.
SMT process timed out in 30714ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30736ms
Finished structural reductions in LTL mode , in 1 iterations and 33117 ms. Remains : 665/665 places, 1372/1372 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 697 steps (0 resets) in 8 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 555 ms.
Product exploration explored 100000 steps with 25000 reset in 407 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 252 Pre rules applied. Total rules applied 0 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 1 ms
Iterating global reduction 0 with 252 rules applied. Total rules applied 252 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 1 ms
Applied a total of 252 rules in 73 ms. Remains 665 /665 variables (removed 0) and now considering 1624/1372 (removed -252) transitions.
[2024-05-27 04:37:19] [INFO ] Redundant transitions in 53 ms returned []
Running 1617 sub problems to find dead transitions.
[2024-05-27 04:37:19] [INFO ] Flow matrix only has 1414 transitions (discarded 210 similar events)
// Phase 1: matrix 1414 rows 665 cols
[2024-05-27 04:37:19] [INFO ] Computed 20 invariants in 5 ms
[2024-05-27 04:37:19] [INFO ] State equation strengthened by 582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
SMT process timed out in 30988ms, After SMT, problems are : Problem set: 0 solved, 1617 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Starting structural reductions in SI_LTL mode, iteration 1 : 665/665 places, 1624/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31158 ms. Remains : 665/665 places, 1624/1372 transitions.
Built C files in :
/tmp/ltsmin3836474689929436767
[2024-05-27 04:37:50] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3836474689929436767
Running compilation step : cd /tmp/ltsmin3836474689929436767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3836474689929436767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3836474689929436767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-05-27 04:37:53] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-05-27 04:37:53] [INFO ] Computed 20 invariants in 5 ms
[2024-05-27 04:37:54] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-27 04:37:54] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-27 04:37:54] [INFO ] Invariant cache hit.
[2024-05-27 04:37:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:37:58] [INFO ] Implicit Places using invariants and state equation in 3934 ms returned []
Implicit Place search using SMT with State Equation took 4638 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-05-27 04:37:58] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-05-27 04:37:58] [INFO ] Invariant cache hit.
[2024-05-27 04:37:58] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-05-27 04:38:27] [INFO ] Deduced a trap composed of 11 places in 543 ms of which 9 ms to minimize.
[2024-05-27 04:38:28] [INFO ] Deduced a trap composed of 31 places in 722 ms of which 9 ms to minimize.
[2024-05-27 04:38:28] [INFO ] Deduced a trap composed of 25 places in 717 ms of which 8 ms to minimize.
SMT process timed out in 30649ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30666ms
Finished structural reductions in LTL mode , in 1 iterations and 35317 ms. Remains : 665/665 places, 1372/1372 transitions.
Built C files in :
/tmp/ltsmin18433326729913783433
[2024-05-27 04:38:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18433326729913783433
Running compilation step : cd /tmp/ltsmin18433326729913783433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18433326729913783433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18433326729913783433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 04:38:31] [INFO ] Flatten gal took : 32 ms
[2024-05-27 04:38:31] [INFO ] Flatten gal took : 33 ms
[2024-05-27 04:38:31] [INFO ] Time to serialize gal into /tmp/LTL12841498695402405143.gal : 9 ms
[2024-05-27 04:38:31] [INFO ] Time to serialize properties into /tmp/LTL14518273030616122482.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12841498695402405143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13512139618676084188.hoa' '-atoms' '/tmp/LTL14518273030616122482.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14518273030616122482.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13512139618676084188.hoa
Detected timeout of ITS tools.
[2024-05-27 04:38:47] [INFO ] Flatten gal took : 35 ms
[2024-05-27 04:38:47] [INFO ] Flatten gal took : 35 ms
[2024-05-27 04:38:47] [INFO ] Time to serialize gal into /tmp/LTL15629030018935618972.gal : 5 ms
[2024-05-27 04:38:47] [INFO ] Time to serialize properties into /tmp/LTL12573520976880445601.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15629030018935618972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12573520976880445601.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(...12419
Formula 0 simplified : G!"(((((((((((WantSection_5_T==0)||(TestAlone_4_5_5==0))&&((WantSection_5_T==0)||(TestAlone_3_1_5==0)))&&(((WantSection_0_T==0)||(Te...12405
Detected timeout of ITS tools.
[2024-05-27 04:39:02] [INFO ] Flatten gal took : 35 ms
[2024-05-27 04:39:02] [INFO ] Applying decomposition
[2024-05-27 04:39:02] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3673430717435778842.txt' '-o' '/tmp/graph3673430717435778842.bin' '-w' '/tmp/graph3673430717435778842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3673430717435778842.bin' '-l' '-1' '-v' '-w' '/tmp/graph3673430717435778842.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:39:02] [INFO ] Decomposing Gal with order
[2024-05-27 04:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:39:02] [INFO ] Removed a total of 2072 redundant transitions.
[2024-05-27 04:39:02] [INFO ] Flatten gal took : 75 ms
[2024-05-27 04:39:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-27 04:39:02] [INFO ] Time to serialize gal into /tmp/LTL438487207911769363.gal : 28 ms
[2024-05-27 04:39:02] [INFO ] Time to serialize properties into /tmp/LTL11392006352615336866.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL438487207911769363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11392006352615336866.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((i6.i1.u156.WantSection_5_T==0)||(i10.u272.TestAlone_4_5_5==0))&&((i6.i1.u156.WantSection_5_T==0)||(i16.i1.u275.TestA...17487
Formula 0 simplified : G!"(((((((((((i6.i1.u156.WantSection_5_T==0)||(i10.u272.TestAlone_4_5_5==0))&&((i6.i1.u156.WantSection_5_T==0)||(i16.i1.u275.TestAlo...17473
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 156913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||p0)))))'
Found a Shortening insensitive property : Peterson-PT-6-LTLFireability-06
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1330 transition count 1910
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 1210 transition count 1910
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 240 place count 1210 transition count 1652
Deduced a syphon composed of 258 places in 0 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 756 place count 952 transition count 1652
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 840 place count 910 transition count 1610
Applied a total of 840 rules in 88 ms. Remains 910 /1330 variables (removed 420) and now considering 1610/2030 (removed 420) transitions.
[2024-05-27 04:39:17] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 910 cols
[2024-05-27 04:39:17] [INFO ] Computed 27 invariants in 5 ms
[2024-05-27 04:39:18] [INFO ] Implicit Places using invariants in 547 ms returned [836, 837, 839, 902, 903, 904, 905]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 549 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 903/1330 places, 1610/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 654 ms. Remains : 903/1330 places, 1610/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-06
Product exploration explored 100000 steps with 4438 reset in 4275 ms.
Product exploration explored 100000 steps with 4420 reset in 4270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 79 steps (0 resets) in 16 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 04:39:27] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 903 cols
[2024-05-27 04:39:28] [INFO ] Computed 20 invariants in 6 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-27 04:39:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 6 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-05-27 04:39:43] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:39:43] [INFO ] Invariant cache hit.
[2024-05-27 04:39:44] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-27 04:39:44] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:39:44] [INFO ] Invariant cache hit.
[2024-05-27 04:39:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:39:46] [INFO ] Implicit Places using invariants and state equation in 2371 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-05-27 04:39:46] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:39:46] [INFO ] Invariant cache hit.
[2024-05-27 04:39:46] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 903/903 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
SMT process timed out in 30674ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 30699ms
Finished structural reductions in LTL mode , in 1 iterations and 33543 ms. Remains : 903/903 places, 1610/1610 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 74 steps (0 resets) in 21 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-27 04:40:18] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:40:18] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4451 reset in 6197 ms.
Product exploration explored 100000 steps with 4472 reset in 6049 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 28 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-05-27 04:40:46] [INFO ] Redundant transitions in 44 ms returned []
Running 1603 sub problems to find dead transitions.
[2024-05-27 04:40:46] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:40:46] [INFO ] Invariant cache hit.
[2024-05-27 04:40:46] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 903/903 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
SMT process timed out in 30819ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 30847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30932 ms. Remains : 903/903 places, 1610/1610 transitions.
Built C files in :
/tmp/ltsmin12460554541220749639
[2024-05-27 04:41:17] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12460554541220749639
Running compilation step : cd /tmp/ltsmin12460554541220749639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12460554541220749639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12460554541220749639;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 7 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-05-27 04:41:20] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:41:20] [INFO ] Invariant cache hit.
[2024-05-27 04:41:20] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-27 04:41:20] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:41:20] [INFO ] Invariant cache hit.
[2024-05-27 04:41:21] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:41:23] [INFO ] Implicit Places using invariants and state equation in 2573 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-05-27 04:41:23] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-05-27 04:41:23] [INFO ] Invariant cache hit.
[2024-05-27 04:41:23] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 903/903 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
SMT process timed out in 30836ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 30870ms
Finished structural reductions in LTL mode , in 1 iterations and 33866 ms. Remains : 903/903 places, 1610/1610 transitions.
Built C files in :
/tmp/ltsmin904857835205919969
[2024-05-27 04:41:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin904857835205919969
Running compilation step : cd /tmp/ltsmin904857835205919969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin904857835205919969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin904857835205919969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 04:41:57] [INFO ] Flatten gal took : 36 ms
[2024-05-27 04:41:57] [INFO ] Flatten gal took : 37 ms
[2024-05-27 04:41:57] [INFO ] Time to serialize gal into /tmp/LTL11427749920610140427.gal : 6 ms
[2024-05-27 04:41:57] [INFO ] Time to serialize properties into /tmp/LTL10267587414553221139.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11427749920610140427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1825787488598605679.hoa' '-atoms' '/tmp/LTL10267587414553221139.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10267587414553221139.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1825787488598605679.hoa
Detected timeout of ITS tools.
[2024-05-27 04:42:12] [INFO ] Flatten gal took : 38 ms
[2024-05-27 04:42:12] [INFO ] Flatten gal took : 38 ms
[2024-05-27 04:42:12] [INFO ] Time to serialize gal into /tmp/LTL792558071472830595.gal : 6 ms
[2024-05-27 04:42:12] [INFO ] Time to serialize properties into /tmp/LTL9804159966672748909.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL792558071472830595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9804159966672748909.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((((((((G("(((((((((TestIdentity_2_0_0==1)||(TestIdentity_6_3_2==1))||((TestIdentity_0_3_3==1)||(TestIdentity_0_4_1==1)))||((...18968
Formula 0 simplified : XXG(!"(((((((((WantSection_2_T==1)&&(TestAlone_5_5_2==1))||((WantSection_0_T==1)&&(TestAlone_2_3_0==1)))||(((WantSection_5_T==1)&&(T...18944
Detected timeout of ITS tools.
[2024-05-27 04:42:27] [INFO ] Flatten gal took : 37 ms
[2024-05-27 04:42:27] [INFO ] Applying decomposition
[2024-05-27 04:42:27] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8343539583726140720.txt' '-o' '/tmp/graph8343539583726140720.bin' '-w' '/tmp/graph8343539583726140720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8343539583726140720.bin' '-l' '-1' '-v' '-w' '/tmp/graph8343539583726140720.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:42:27] [INFO ] Decomposing Gal with order
[2024-05-27 04:42:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:42:27] [INFO ] Removed a total of 2072 redundant transitions.
[2024-05-27 04:42:27] [INFO ] Flatten gal took : 72 ms
[2024-05-27 04:42:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-27 04:42:27] [INFO ] Time to serialize gal into /tmp/LTL6865883456213291575.gal : 14 ms
[2024-05-27 04:42:27] [INFO ] Time to serialize properties into /tmp/LTL13198216983652127515.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6865883456213291575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13198216983652127515.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((((((((G("(((((((((i16.u126.TestIdentity_2_0_0==1)||(i9.i0.u22.TestIdentity_6_3_2==1))||((i1.i1.u186.TestIdentity_0_3_3==1)|...26182
Formula 0 simplified : XXG(!"(((((((((i10.i1.u116.WantSection_2_T==1)&&(i8.u234.TestAlone_5_5_2==1))||((i6.u114.WantSection_0_T==1)&&(i6.u178.TestAlone_2_3...26158
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 205422 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)))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLFireability-13
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 743 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 743 transition count 1149
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 449 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 407 transition count 1107
Applied a total of 1846 rules in 88 ms. Remains 407 /1330 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2024-05-27 04:42:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 407 cols
[2024-05-27 04:42:43] [INFO ] Computed 27 invariants in 3 ms
[2024-05-27 04:42:44] [INFO ] Implicit Places using invariants in 902 ms returned [388, 389, 391, 399, 400, 401, 402]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 904 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/1330 places, 1107/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1011 ms. Remains : 400/1330 places, 1107/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 0 reset in 412 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 687280 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 1
Probabilistic random walk after 687280 steps, saw 91031 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
[2024-05-27 04:42:48] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-27 04:42:48] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 04:42:48] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:42:49] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2024-05-27 04:42:49] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:42:50] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 4 ms to minimize.
[2024-05-27 04:42:50] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 3 ms to minimize.
[2024-05-27 04:42:50] [INFO ] Deduced a trap composed of 21 places in 353 ms of which 4 ms to minimize.
[2024-05-27 04:42:51] [INFO ] Deduced a trap composed of 44 places in 353 ms of which 4 ms to minimize.
[2024-05-27 04:42:51] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 6 ms to minimize.
[2024-05-27 04:42:52] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 6 ms to minimize.
[2024-05-27 04:42:52] [INFO ] Deduced a trap composed of 15 places in 541 ms of which 7 ms to minimize.
[2024-05-27 04:42:53] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 5 ms to minimize.
[2024-05-27 04:42:53] [INFO ] Deduced a trap composed of 88 places in 376 ms of which 5 ms to minimize.
[2024-05-27 04:42:53] [INFO ] Deduced a trap composed of 26 places in 363 ms of which 5 ms to minimize.
SMT process timed out in 5649ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 25 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 595016 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 595016 steps, saw 78479 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-05-27 04:42:57] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:42:57] [INFO ] Invariant cache hit.
[2024-05-27 04:42:57] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:42:57] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-27 04:42:57] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-27 04:42:58] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:42:58] [INFO ] Deduced a trap composed of 19 places in 494 ms of which 6 ms to minimize.
[2024-05-27 04:42:59] [INFO ] Deduced a trap composed of 31 places in 500 ms of which 6 ms to minimize.
[2024-05-27 04:42:59] [INFO ] Deduced a trap composed of 10 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:43:00] [INFO ] Deduced a trap composed of 64 places in 455 ms of which 5 ms to minimize.
[2024-05-27 04:43:00] [INFO ] Deduced a trap composed of 27 places in 470 ms of which 5 ms to minimize.
[2024-05-27 04:43:01] [INFO ] Deduced a trap composed of 52 places in 463 ms of which 6 ms to minimize.
[2024-05-27 04:43:01] [INFO ] Deduced a trap composed of 19 places in 474 ms of which 6 ms to minimize.
[2024-05-27 04:43:02] [INFO ] Deduced a trap composed of 21 places in 486 ms of which 6 ms to minimize.
[2024-05-27 04:43:02] [INFO ] Deduced a trap composed of 22 places in 389 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:43:03] [INFO ] Deduced a trap composed of 13 places in 376 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6022 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 6561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:43:03] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:43:03] [INFO ] Invariant cache hit.
[2024-05-27 04:43:04] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-05-27 04:43:04] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:43:04] [INFO ] Invariant cache hit.
[2024-05-27 04:43:05] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:43:07] [INFO ] Implicit Places using invariants and state equation in 2710 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2024-05-27 04:43:07] [INFO ] Redundant transitions in 15 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:43:07] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:43:07] [INFO ] Invariant cache hit.
[2024-05-27 04:43:07] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:43:22] [INFO ] Deduced a trap composed of 46 places in 441 ms of which 6 ms to minimize.
[2024-05-27 04:43:23] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 6 ms to minimize.
[2024-05-27 04:43:23] [INFO ] Deduced a trap composed of 51 places in 469 ms of which 6 ms to minimize.
[2024-05-27 04:43:24] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 6 ms to minimize.
[2024-05-27 04:43:24] [INFO ] Deduced a trap composed of 12 places in 458 ms of which 6 ms to minimize.
[2024-05-27 04:43:25] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 6 ms to minimize.
[2024-05-27 04:43:25] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 6 ms to minimize.
[2024-05-27 04:43:26] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 6 ms to minimize.
[2024-05-27 04:43:26] [INFO ] Deduced a trap composed of 55 places in 464 ms of which 6 ms to minimize.
[2024-05-27 04:43:27] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 5 ms to minimize.
[2024-05-27 04:43:27] [INFO ] Deduced a trap composed of 21 places in 423 ms of which 6 ms to minimize.
[2024-05-27 04:43:28] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 6 ms to minimize.
[2024-05-27 04:43:28] [INFO ] Deduced a trap composed of 29 places in 431 ms of which 6 ms to minimize.
[2024-05-27 04:43:29] [INFO ] Deduced a trap composed of 27 places in 438 ms of which 6 ms to minimize.
[2024-05-27 04:43:29] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 5 ms to minimize.
[2024-05-27 04:43:29] [INFO ] Deduced a trap composed of 56 places in 407 ms of which 5 ms to minimize.
[2024-05-27 04:43:30] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 4 ms to minimize.
[2024-05-27 04:43:30] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 5 ms to minimize.
[2024-05-27 04:43:31] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 6 ms to minimize.
[2024-05-27 04:43:31] [INFO ] Deduced a trap composed of 51 places in 407 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:43:32] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 3 ms to minimize.
[2024-05-27 04:43:32] [INFO ] Deduced a trap composed of 60 places in 288 ms of which 4 ms to minimize.
[2024-05-27 04:43:33] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 4 ms to minimize.
[2024-05-27 04:43:33] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 4 ms to minimize.
[2024-05-27 04:43:33] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 4 ms to minimize.
[2024-05-27 04:43:33] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 3 ms to minimize.
[2024-05-27 04:43:34] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 4 ms to minimize.
[2024-05-27 04:43:34] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 4 ms to minimize.
[2024-05-27 04:43:34] [INFO ] Deduced a trap composed of 52 places in 359 ms of which 5 ms to minimize.
[2024-05-27 04:43:35] [INFO ] Deduced a trap composed of 27 places in 412 ms of which 5 ms to minimize.
[2024-05-27 04:43:35] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 6 ms to minimize.
[2024-05-27 04:43:36] [INFO ] Deduced a trap composed of 51 places in 405 ms of which 6 ms to minimize.
[2024-05-27 04:43:36] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 5 ms to minimize.
[2024-05-27 04:43:36] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 4 ms to minimize.
[2024-05-27 04:43:37] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 4 ms to minimize.
[2024-05-27 04:43:37] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 5 ms to minimize.
SMT process timed out in 30489ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30503ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34080 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 25 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-27 04:43:37] [INFO ] Computed 9 invariants in 0 ms
[2024-05-27 04:43:37] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 04:43:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-27 04:43:37] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 04:43:37] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 04:43:37] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 167 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:43:38] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-27 04:43:38] [INFO ] Computed 20 invariants in 4 ms
[2024-05-27 04:43:38] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-27 04:43:38] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:43:38] [INFO ] Invariant cache hit.
[2024-05-27 04:43:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:43:40] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2718 ms to find 0 implicit places.
[2024-05-27 04:43:40] [INFO ] Redundant transitions in 20 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:43:40] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:43:40] [INFO ] Invariant cache hit.
[2024-05-27 04:43:40] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:43:56] [INFO ] Deduced a trap composed of 46 places in 452 ms of which 10 ms to minimize.
[2024-05-27 04:43:57] [INFO ] Deduced a trap composed of 29 places in 476 ms of which 6 ms to minimize.
[2024-05-27 04:43:57] [INFO ] Deduced a trap composed of 51 places in 477 ms of which 6 ms to minimize.
[2024-05-27 04:43:58] [INFO ] Deduced a trap composed of 19 places in 476 ms of which 5 ms to minimize.
[2024-05-27 04:43:58] [INFO ] Deduced a trap composed of 12 places in 448 ms of which 6 ms to minimize.
[2024-05-27 04:43:59] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 6 ms to minimize.
[2024-05-27 04:43:59] [INFO ] Deduced a trap composed of 13 places in 465 ms of which 6 ms to minimize.
[2024-05-27 04:44:00] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 5 ms to minimize.
[2024-05-27 04:44:00] [INFO ] Deduced a trap composed of 55 places in 473 ms of which 6 ms to minimize.
[2024-05-27 04:44:01] [INFO ] Deduced a trap composed of 11 places in 385 ms of which 6 ms to minimize.
[2024-05-27 04:44:01] [INFO ] Deduced a trap composed of 21 places in 444 ms of which 5 ms to minimize.
[2024-05-27 04:44:01] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 5 ms to minimize.
[2024-05-27 04:44:02] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 6 ms to minimize.
[2024-05-27 04:44:02] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 5 ms to minimize.
[2024-05-27 04:44:03] [INFO ] Deduced a trap composed of 29 places in 440 ms of which 6 ms to minimize.
[2024-05-27 04:44:03] [INFO ] Deduced a trap composed of 56 places in 416 ms of which 5 ms to minimize.
[2024-05-27 04:44:04] [INFO ] Deduced a trap composed of 38 places in 332 ms of which 4 ms to minimize.
[2024-05-27 04:44:04] [INFO ] Deduced a trap composed of 22 places in 399 ms of which 5 ms to minimize.
[2024-05-27 04:44:04] [INFO ] Deduced a trap composed of 21 places in 406 ms of which 5 ms to minimize.
[2024-05-27 04:44:05] [INFO ] Deduced a trap composed of 51 places in 390 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:44:06] [INFO ] Deduced a trap composed of 62 places in 440 ms of which 6 ms to minimize.
[2024-05-27 04:44:06] [INFO ] Deduced a trap composed of 60 places in 478 ms of which 6 ms to minimize.
[2024-05-27 04:44:07] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 6 ms to minimize.
[2024-05-27 04:44:07] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 6 ms to minimize.
[2024-05-27 04:44:08] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 5 ms to minimize.
[2024-05-27 04:44:08] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 5 ms to minimize.
[2024-05-27 04:44:09] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 6 ms to minimize.
[2024-05-27 04:44:09] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 5 ms to minimize.
[2024-05-27 04:44:09] [INFO ] Deduced a trap composed of 52 places in 442 ms of which 5 ms to minimize.
[2024-05-27 04:44:10] [INFO ] Deduced a trap composed of 27 places in 421 ms of which 5 ms to minimize.
[2024-05-27 04:44:10] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 5 ms to minimize.
[2024-05-27 04:44:11] [INFO ] Deduced a trap composed of 51 places in 415 ms of which 6 ms to minimize.
[2024-05-27 04:44:11] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 5 ms to minimize.
SMT process timed out in 30799ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30816ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33586 ms. Remains : 400/400 places, 1107/1107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 63 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 662512 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 662512 steps, saw 88720 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
[2024-05-27 04:44:15] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:44:15] [INFO ] Invariant cache hit.
[2024-05-27 04:44:15] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 702 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:44:16] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-27 04:44:16] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 3 ms to minimize.
[2024-05-27 04:44:16] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:44:17] [INFO ] Deduced a trap composed of 19 places in 491 ms of which 6 ms to minimize.
[2024-05-27 04:44:17] [INFO ] Deduced a trap composed of 31 places in 501 ms of which 6 ms to minimize.
[2024-05-27 04:44:18] [INFO ] Deduced a trap composed of 10 places in 473 ms of which 5 ms to minimize.
[2024-05-27 04:44:18] [INFO ] Deduced a trap composed of 64 places in 368 ms of which 5 ms to minimize.
[2024-05-27 04:44:19] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 6 ms to minimize.
[2024-05-27 04:44:19] [INFO ] Deduced a trap composed of 52 places in 457 ms of which 5 ms to minimize.
[2024-05-27 04:44:20] [INFO ] Deduced a trap composed of 19 places in 443 ms of which 5 ms to minimize.
[2024-05-27 04:44:20] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 5 ms to minimize.
[2024-05-27 04:44:21] [INFO ] Deduced a trap composed of 22 places in 381 ms of which 5 ms to minimize.
SMT process timed out in 6034ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 23 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 678392 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 1
Probabilistic random walk after 678392 steps, saw 90279 distinct states, run finished after 3004 ms. (steps per millisecond=225 ) properties seen :0
[2024-05-27 04:44:24] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:44:24] [INFO ] Invariant cache hit.
[2024-05-27 04:44:24] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 766 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:44:25] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 2 ms to minimize.
[2024-05-27 04:44:25] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
[2024-05-27 04:44:25] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:44:26] [INFO ] Deduced a trap composed of 19 places in 504 ms of which 6 ms to minimize.
[2024-05-27 04:44:27] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 6 ms to minimize.
[2024-05-27 04:44:27] [INFO ] Deduced a trap composed of 10 places in 491 ms of which 6 ms to minimize.
[2024-05-27 04:44:28] [INFO ] Deduced a trap composed of 64 places in 436 ms of which 5 ms to minimize.
[2024-05-27 04:44:28] [INFO ] Deduced a trap composed of 27 places in 459 ms of which 6 ms to minimize.
[2024-05-27 04:44:28] [INFO ] Deduced a trap composed of 52 places in 448 ms of which 6 ms to minimize.
[2024-05-27 04:44:29] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 6 ms to minimize.
[2024-05-27 04:44:29] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 6 ms to minimize.
[2024-05-27 04:44:30] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 04:44:30] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 5 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6176 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 6962ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:44:31] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:44:31] [INFO ] Invariant cache hit.
[2024-05-27 04:44:31] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-27 04:44:31] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:44:31] [INFO ] Invariant cache hit.
[2024-05-27 04:44:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:44:34] [INFO ] Implicit Places using invariants and state equation in 2632 ms returned []
Implicit Place search using SMT with State Equation took 3446 ms to find 0 implicit places.
[2024-05-27 04:44:34] [INFO ] Redundant transitions in 22 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:44:34] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:44:34] [INFO ] Invariant cache hit.
[2024-05-27 04:44:34] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:44:50] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 4 ms to minimize.
[2024-05-27 04:44:50] [INFO ] Deduced a trap composed of 29 places in 304 ms of which 4 ms to minimize.
[2024-05-27 04:44:51] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 5 ms to minimize.
[2024-05-27 04:44:51] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 5 ms to minimize.
[2024-05-27 04:44:51] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 6 ms to minimize.
[2024-05-27 04:44:52] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 6 ms to minimize.
[2024-05-27 04:44:52] [INFO ] Deduced a trap composed of 13 places in 462 ms of which 5 ms to minimize.
[2024-05-27 04:44:53] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 6 ms to minimize.
[2024-05-27 04:44:53] [INFO ] Deduced a trap composed of 55 places in 464 ms of which 6 ms to minimize.
[2024-05-27 04:44:54] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 5 ms to minimize.
[2024-05-27 04:44:54] [INFO ] Deduced a trap composed of 21 places in 430 ms of which 6 ms to minimize.
[2024-05-27 04:44:55] [INFO ] Deduced a trap composed of 29 places in 420 ms of which 6 ms to minimize.
[2024-05-27 04:44:55] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 6 ms to minimize.
[2024-05-27 04:44:56] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 5 ms to minimize.
[2024-05-27 04:44:56] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 6 ms to minimize.
[2024-05-27 04:44:56] [INFO ] Deduced a trap composed of 56 places in 418 ms of which 5 ms to minimize.
[2024-05-27 04:44:57] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 4 ms to minimize.
[2024-05-27 04:44:57] [INFO ] Deduced a trap composed of 22 places in 431 ms of which 5 ms to minimize.
[2024-05-27 04:44:58] [INFO ] Deduced a trap composed of 21 places in 423 ms of which 6 ms to minimize.
[2024-05-27 04:44:58] [INFO ] Deduced a trap composed of 51 places in 405 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:44:59] [INFO ] Deduced a trap composed of 62 places in 462 ms of which 6 ms to minimize.
[2024-05-27 04:45:00] [INFO ] Deduced a trap composed of 60 places in 470 ms of which 6 ms to minimize.
[2024-05-27 04:45:00] [INFO ] Deduced a trap composed of 14 places in 469 ms of which 6 ms to minimize.
[2024-05-27 04:45:01] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 5 ms to minimize.
[2024-05-27 04:45:01] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 6 ms to minimize.
[2024-05-27 04:45:02] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 5 ms to minimize.
[2024-05-27 04:45:02] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 6 ms to minimize.
[2024-05-27 04:45:03] [INFO ] Deduced a trap composed of 22 places in 449 ms of which 6 ms to minimize.
[2024-05-27 04:45:03] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 3 ms to minimize.
[2024-05-27 04:45:03] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 5 ms to minimize.
[2024-05-27 04:45:04] [INFO ] Deduced a trap composed of 33 places in 384 ms of which 5 ms to minimize.
[2024-05-27 04:45:04] [INFO ] Deduced a trap composed of 51 places in 400 ms of which 6 ms to minimize.
[2024-05-27 04:45:05] [INFO ] Deduced a trap composed of 19 places in 408 ms of which 5 ms to minimize.
[2024-05-27 04:45:05] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 5 ms to minimize.
SMT process timed out in 30821ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34341 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 24 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-05-27 04:45:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-27 04:45:05] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 04:45:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-27 04:45:05] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 04:45:05] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 04:45:05] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 151 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 253 ms.
Product exploration explored 100000 steps with 0 reset in 309 ms.
Built C files in :
/tmp/ltsmin13343901454271378610
[2024-05-27 04:45:06] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-27 04:45:06] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:45:06] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-27 04:45:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:45:06] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-27 04:45:06] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:45:06] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13343901454271378610
Running compilation step : cd /tmp/ltsmin13343901454271378610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13343901454271378610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13343901454271378610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-05-27 04:45:09] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-05-27 04:45:09] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 04:45:10] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-27 04:45:10] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:45:10] [INFO ] Invariant cache hit.
[2024-05-27 04:45:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-27 04:45:12] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2024-05-27 04:45:12] [INFO ] Redundant transitions in 19 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-05-27 04:45:12] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-05-27 04:45:12] [INFO ] Invariant cache hit.
[2024-05-27 04:45:12] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:45:27] [INFO ] Deduced a trap composed of 46 places in 376 ms of which 6 ms to minimize.
[2024-05-27 04:45:27] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 3 ms to minimize.
[2024-05-27 04:45:27] [INFO ] Deduced a trap composed of 51 places in 343 ms of which 4 ms to minimize.
[2024-05-27 04:45:28] [INFO ] Deduced a trap composed of 19 places in 462 ms of which 6 ms to minimize.
[2024-05-27 04:45:28] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 4 ms to minimize.
[2024-05-27 04:45:28] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 5 ms to minimize.
[2024-05-27 04:45:29] [INFO ] Deduced a trap composed of 13 places in 348 ms of which 4 ms to minimize.
[2024-05-27 04:45:29] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 4 ms to minimize.
[2024-05-27 04:45:30] [INFO ] Deduced a trap composed of 55 places in 482 ms of which 6 ms to minimize.
[2024-05-27 04:45:30] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 6 ms to minimize.
[2024-05-27 04:45:31] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 5 ms to minimize.
[2024-05-27 04:45:31] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 5 ms to minimize.
[2024-05-27 04:45:32] [INFO ] Deduced a trap composed of 29 places in 447 ms of which 6 ms to minimize.
[2024-05-27 04:45:32] [INFO ] Deduced a trap composed of 27 places in 446 ms of which 5 ms to minimize.
[2024-05-27 04:45:32] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 5 ms to minimize.
[2024-05-27 04:45:33] [INFO ] Deduced a trap composed of 56 places in 431 ms of which 5 ms to minimize.
[2024-05-27 04:45:33] [INFO ] Deduced a trap composed of 38 places in 346 ms of which 4 ms to minimize.
[2024-05-27 04:45:34] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 5 ms to minimize.
[2024-05-27 04:45:34] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 6 ms to minimize.
[2024-05-27 04:45:35] [INFO ] Deduced a trap composed of 51 places in 406 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-05-27 04:45:36] [INFO ] Deduced a trap composed of 62 places in 474 ms of which 6 ms to minimize.
[2024-05-27 04:45:36] [INFO ] Deduced a trap composed of 60 places in 499 ms of which 6 ms to minimize.
[2024-05-27 04:45:37] [INFO ] Deduced a trap composed of 14 places in 451 ms of which 5 ms to minimize.
[2024-05-27 04:45:37] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 5 ms to minimize.
[2024-05-27 04:45:38] [INFO ] Deduced a trap composed of 21 places in 424 ms of which 5 ms to minimize.
[2024-05-27 04:45:38] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 5 ms to minimize.
[2024-05-27 04:45:39] [INFO ] Deduced a trap composed of 36 places in 455 ms of which 6 ms to minimize.
[2024-05-27 04:45:39] [INFO ] Deduced a trap composed of 22 places in 430 ms of which 5 ms to minimize.
[2024-05-27 04:45:39] [INFO ] Deduced a trap composed of 52 places in 416 ms of which 5 ms to minimize.
[2024-05-27 04:45:40] [INFO ] Deduced a trap composed of 27 places in 414 ms of which 6 ms to minimize.
[2024-05-27 04:45:40] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 6 ms to minimize.
[2024-05-27 04:45:41] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 6 ms to minimize.
[2024-05-27 04:45:41] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 5 ms to minimize.
[2024-05-27 04:45:42] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 5 ms to minimize.
[2024-05-27 04:45:42] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 5 ms to minimize.
[2024-05-27 04:45:42] [INFO ] Deduced a trap composed of 40 places in 383 ms of which 5 ms to minimize.
[2024-05-27 04:45:43] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 5 ms to minimize.
SMT process timed out in 30737ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 30755ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33405 ms. Remains : 400/400 places, 1107/1107 transitions.
Built C files in :
/tmp/ltsmin2803669881673482023
[2024-05-27 04:45:43] [INFO ] Computing symmetric may disable matrix : 1107 transitions.
[2024-05-27 04:45:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:45:43] [INFO ] Computing symmetric may enable matrix : 1107 transitions.
[2024-05-27 04:45:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:45:43] [INFO ] Computing Do-Not-Accords matrix : 1107 transitions.
[2024-05-27 04:45:43] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 04:45:43] [INFO ] Built C files in 348ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2803669881673482023
Running compilation step : cd /tmp/ltsmin2803669881673482023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2803669881673482023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2803669881673482023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-27 04:45:46] [INFO ] Flatten gal took : 26 ms
[2024-05-27 04:45:46] [INFO ] Flatten gal took : 25 ms
[2024-05-27 04:45:46] [INFO ] Time to serialize gal into /tmp/LTL16075230944508477204.gal : 4 ms
[2024-05-27 04:45:46] [INFO ] Time to serialize properties into /tmp/LTL12234158461718733927.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16075230944508477204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7684128248415280591.hoa' '-atoms' '/tmp/LTL12234158461718733927.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12234158461718733927.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7684128248415280591.hoa
Detected timeout of ITS tools.
[2024-05-27 04:46:01] [INFO ] Flatten gal took : 25 ms
[2024-05-27 04:46:01] [INFO ] Flatten gal took : 25 ms
[2024-05-27 04:46:01] [INFO ] Time to serialize gal into /tmp/LTL11392955626926679761.gal : 4 ms
[2024-05-27 04:46:01] [INFO ] Time to serialize properties into /tmp/LTL227540109419135016.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11392955626926679761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL227540109419135016.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("((WantSection_3_F==0)||(TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((WantSection_3_F==0)||(TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
[2024-05-27 04:46:16] [INFO ] Flatten gal took : 26 ms
[2024-05-27 04:46:16] [INFO ] Applying decomposition
[2024-05-27 04:46:16] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2663735118973681520.txt' '-o' '/tmp/graph2663735118973681520.bin' '-w' '/tmp/graph2663735118973681520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2663735118973681520.bin' '-l' '-1' '-v' '-w' '/tmp/graph2663735118973681520.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:46:16] [INFO ] Decomposing Gal with order
[2024-05-27 04:46:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:46:16] [INFO ] Removed a total of 1577 redundant transitions.
[2024-05-27 04:46:16] [INFO ] Flatten gal took : 50 ms
[2024-05-27 04:46:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 652 labels/synchronizations in 35 ms.
[2024-05-27 04:46:17] [INFO ] Time to serialize gal into /tmp/LTL6598489738574910361.gal : 8 ms
[2024-05-27 04:46:17] [INFO ] Time to serialize properties into /tmp/LTL10899903097483841338.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6598489738574910361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10899903097483841338.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((i7.u28.WantSection_3_F==0)||(i4.u31.TestAlone_4_3_3==0))"))))
Formula 0 simplified : XF!"((i7.u28.WantSection_3_F==0)||(i4.u31.TestAlone_4_3_3==0))"
Detected timeout of ITS tools.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 229083 ms.
[2024-05-27 04:46:32] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8065970416739686112
[2024-05-27 04:46:32] [INFO ] Too many transitions (2030) to apply POR reductions. Disabling POR matrices.
[2024-05-27 04:46:32] [INFO ] Applying decomposition
[2024-05-27 04:46:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8065970416739686112
Running compilation step : cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 04:46:32] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13333472127506134501.txt' '-o' '/tmp/graph13333472127506134501.bin' '-w' '/tmp/graph13333472127506134501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13333472127506134501.bin' '-l' '-1' '-v' '-w' '/tmp/graph13333472127506134501.weights' '-q' '0' '-e' '0.001'
[2024-05-27 04:46:32] [INFO ] Decomposing Gal with order
[2024-05-27 04:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 04:46:32] [INFO ] Removed a total of 1786 redundant transitions.
[2024-05-27 04:46:32] [INFO ] Flatten gal took : 83 ms
[2024-05-27 04:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-27 04:46:32] [INFO ] Time to serialize gal into /tmp/LTLFireability8312392619280014908.gal : 13 ms
[2024-05-27 04:46:32] [INFO ] Time to serialize properties into /tmp/LTLFireability1637419817586597144.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8312392619280014908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1637419817586597144.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !(((F("(((((((((((i34.u125.WantSection_5_T==0)||(i2.u127.TestAlone_4_5_5==0))&&((i34.u125.WantSection_5_T==0)||(i17.u330.TestAlone_3_1...17313
Formula 0 simplified : G!"(((((((((((i34.u125.WantSection_5_T==0)||(i2.u127.TestAlone_4_5_5==0))&&((i34.u125.WantSection_5_T==0)||(i17.u330.TestAlone_3_1_5...17299
Compilation finished in 8607 ms.
Running link step : cd /tmp/ltsmin8065970416739686112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 1306 ms.
FORMULA Peterson-PT-6-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin8065970416739686112;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp3==true))||(LTLAPp2==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-27 05:13:10] [INFO ] Applying decomposition
[2024-05-27 05:13:10] [INFO ] Flatten gal took : 131 ms
[2024-05-27 05:13:10] [INFO ] Decomposing Gal with order
[2024-05-27 05:13:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 05:13:11] [INFO ] Removed a total of 1330 redundant transitions.
[2024-05-27 05:13:11] [INFO ] Flatten gal took : 329 ms
[2024-05-27 05:13:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 56 ms.
[2024-05-27 05:13:11] [INFO ] Time to serialize gal into /tmp/LTLFireability13852640831665503519.gal : 28 ms
[2024-05-27 05:13:11] [INFO ] Time to serialize properties into /tmp/LTLFireability12321536787357625641.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13852640831665503519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12321536787357625641.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(F(("(((((((((u22.WantSection_5_T==1)&&(u4.TestAlone_4_5_5==1))||((u22.WantSection_5_T==1)&&(u1.TestAlone_3_1_5==1)))||(((u19.Wa...21480
Formula 0 simplified : XXG(!"(((((((((u22.WantSection_5_T==1)&&(u4.TestAlone_4_5_5==1))||((u22.WantSection_5_T==1)&&(u1.TestAlone_3_1_5==1)))||(((u19.WantS...21460
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="Peterson-PT-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407300284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;