About the Execution of GreatSPN+red for ASLink-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7450.867 | 989919.00 | 1599871.00 | 3390.10 | ?FTFTFFFT?FFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r003-smll-171620116800028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116800028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716227993588
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 17:59:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-20 17:59:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 17:59:55] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-20 17:59:55] [INFO ] Transformed 626 places.
[2024-05-20 17:59:55] [INFO ] Transformed 1008 transitions.
[2024-05-20 17:59:55] [INFO ] Found NUPN structural information;
[2024-05-20 17:59:55] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 615 transition count 998
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 609 transition count 982
Ensure Unique test removed 1 places
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 608 transition count 982
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 608 transition count 980
Applied a total of 26 rules in 147 ms. Remains 608 /626 variables (removed 18) and now considering 980/998 (removed 18) transitions.
// Phase 1: matrix 980 rows 608 cols
[2024-05-20 17:59:56] [INFO ] Computed 106 invariants in 79 ms
[2024-05-20 17:59:57] [INFO ] Implicit Places using invariants in 1300 ms returned [1, 23, 33, 51, 69, 198, 215, 220, 221, 222, 240, 258, 387, 392, 404, 409, 410, 411, 448, 451, 469, 470, 471, 472, 489, 497, 505, 511, 517, 523, 529, 537, 543, 549, 557]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1348 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 573/626 places, 980/998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 560 transition count 967
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 560 transition count 967
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 550 transition count 957
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 550 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 545 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 545 transition count 952
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 543 transition count 950
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 543 transition count 950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 541 transition count 948
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 541 transition count 948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 540 transition count 947
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 540 transition count 947
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 539 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 539 transition count 946
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 538 transition count 945
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 538 transition count 945
Applied a total of 70 rules in 193 ms. Remains 538 /573 variables (removed 35) and now considering 945/980 (removed 35) transitions.
// Phase 1: matrix 945 rows 538 cols
[2024-05-20 17:59:57] [INFO ] Computed 71 invariants in 21 ms
[2024-05-20 17:59:58] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-20 17:59:58] [INFO ] Invariant cache hit.
[2024-05-20 17:59:59] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 538/626 places, 945/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3634 ms. Remains : 538/626 places, 945/998 transitions.
Support contains 47 out of 538 places after structural reductions.
[2024-05-20 18:00:00] [INFO ] Flatten gal took : 151 ms
[2024-05-20 18:00:00] [INFO ] Flatten gal took : 97 ms
[2024-05-20 18:00:00] [INFO ] Input system was already deterministic with 945 transitions.
Support contains 45 out of 538 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (457 resets) in 2624 ms. (15 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (124 resets) in 308 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (131 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (127 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (136 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (125 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (133 resets) in 201 ms. (198 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (126 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (142 resets) in 136 ms. (291 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (137 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (129 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (129 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (134 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (122 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
[2024-05-20 18:00:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 175/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 80/282 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 256/538 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 18:00:03] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 33 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 945/1483 variables, 538/610 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 18:00:04] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 3 ms to minimize.
[2024-05-20 18:00:04] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/1483 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 612 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3212 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 175/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 80/282 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 18:00:05] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 256/538 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-20 18:00:06] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 11 (OVERLAPS) 945/1483 variables, 538/614 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1483 variables, 5/619 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/619 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/619 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 619 constraints, problems are : Problem set: 8 solved, 5 unsolved in 4627 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 5/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 7913ms problems are : Problem set: 8 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1871 ms.
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 945/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 538 transition count 862
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 455 transition count 862
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 166 place count 455 transition count 799
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 147 rules applied. Total rules applied 313 place count 371 transition count 799
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 315 place count 370 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 369 transition count 798
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 316 place count 369 transition count 790
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 332 place count 361 transition count 790
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 335 place count 358 transition count 779
Iterating global reduction 4 with 3 rules applied. Total rules applied 338 place count 358 transition count 779
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 17 rules applied. Total rules applied 355 place count 354 transition count 766
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 368 place count 341 transition count 766
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 368 place count 341 transition count 765
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 370 place count 340 transition count 765
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 374 place count 336 transition count 754
Iterating global reduction 6 with 4 rules applied. Total rules applied 378 place count 336 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 381 place count 336 transition count 751
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 382 place count 335 transition count 743
Iterating global reduction 7 with 1 rules applied. Total rules applied 383 place count 335 transition count 743
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 384 place count 334 transition count 735
Iterating global reduction 7 with 1 rules applied. Total rules applied 385 place count 334 transition count 735
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 386 place count 333 transition count 727
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 333 transition count 727
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 388 place count 332 transition count 719
Iterating global reduction 7 with 1 rules applied. Total rules applied 389 place count 332 transition count 719
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 390 place count 331 transition count 711
Iterating global reduction 7 with 1 rules applied. Total rules applied 391 place count 331 transition count 711
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 392 place count 330 transition count 703
Iterating global reduction 7 with 1 rules applied. Total rules applied 393 place count 330 transition count 703
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 394 place count 329 transition count 695
Iterating global reduction 7 with 1 rules applied. Total rules applied 395 place count 329 transition count 695
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 396 place count 328 transition count 687
Iterating global reduction 7 with 1 rules applied. Total rules applied 397 place count 328 transition count 687
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 398 place count 327 transition count 679
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 327 transition count 679
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 400 place count 326 transition count 671
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 326 transition count 671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 402 place count 325 transition count 663
Iterating global reduction 7 with 1 rules applied. Total rules applied 403 place count 325 transition count 663
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 404 place count 324 transition count 655
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 324 transition count 655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 406 place count 323 transition count 647
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 323 transition count 647
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 408 place count 322 transition count 639
Iterating global reduction 7 with 1 rules applied. Total rules applied 409 place count 322 transition count 639
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 410 place count 321 transition count 631
Iterating global reduction 7 with 1 rules applied. Total rules applied 411 place count 321 transition count 631
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 8 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 465 place count 294 transition count 604
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 466 place count 294 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 467 place count 293 transition count 603
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 478 place count 293 transition count 592
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 490 place count 281 transition count 592
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 491 place count 281 transition count 591
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 498 place count 281 transition count 591
Applied a total of 498 rules in 418 ms. Remains 281 /538 variables (removed 257) and now considering 591/945 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 281/538 places, 591/945 transitions.
RANDOM walk for 40000 steps (851 resets) in 519 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (332 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (295 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (303 resets) in 117 ms. (338 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (330 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (289 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 45357 steps, run visited all 5 properties in 279 ms. (steps per millisecond=162 )
Probabilistic random walk after 45357 steps, saw 29934 distinct states, run finished after 285 ms. (steps per millisecond=159 ) properties seen :5
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-02a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-02a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)||G(F((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))))'
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Applied a total of 1 rules in 24 ms. Remains 537 /538 variables (removed 1) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 537 cols
[2024-05-20 18:00:13] [INFO ] Computed 70 invariants in 14 ms
[2024-05-20 18:00:14] [INFO ] Implicit Places using invariants in 457 ms returned [18, 19, 427]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 463 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 534/538 places, 945/945 transitions.
Applied a total of 0 rules in 11 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 534/538 places, 945/945 transitions.
Stuttering acceptance computed with spot in 528 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-00
Product exploration explored 100000 steps with 1563 reset in 421 ms.
Product exploration explored 100000 steps with 1554 reset in 404 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 521 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p1 p2), (AND p1 p2)]
RANDOM walk for 40000 steps (451 resets) in 499 ms. (80 steps per ms) remains 9/16 properties
BEST_FIRST walk for 40003 steps (131 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (127 resets) in 175 ms. (227 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (127 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (125 resets) in 380 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (141 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (114 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (135 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (138 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (128 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
// Phase 1: matrix 945 rows 534 cols
[2024-05-20 18:00:16] [INFO ] Computed 67 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 149/268 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 5 (OVERLAPS) 265/533 variables, 48/66 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 945/1479 variables, 534/601 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1479 variables, 0/601 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1479 variables, 0/601 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1479/1479 variables, and 601 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 149/268 variables, 14/18 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 265/533 variables, 48/66 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-20 18:00:18] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-05-20 18:00:18] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 2/68 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/68 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/534 variables, 1/69 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 945/1479 variables, 534/603 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1479 variables, 6/609 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1479 variables, 0/609 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1479 variables, 0/609 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1479/1479 variables, and 609 constraints, problems are : Problem set: 2 solved, 6 unsolved in 3182 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 4284ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9294 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 945/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 534 transition count 855
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 444 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 443 transition count 854
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 182 place count 443 transition count 790
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 331 place count 358 transition count 790
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 333 place count 357 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 356 transition count 789
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 334 place count 356 transition count 781
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 350 place count 348 transition count 781
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 352 place count 346 transition count 779
Iterating global reduction 5 with 2 rules applied. Total rules applied 354 place count 346 transition count 779
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 346 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 345 transition count 778
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 356 place count 345 transition count 777
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 344 transition count 777
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 436 place count 305 transition count 738
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 437 place count 305 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 438 place count 304 transition count 737
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 444 place count 304 transition count 731
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 450 place count 298 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 451 place count 298 transition count 730
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 462 place count 298 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 297 transition count 729
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 465 place count 295 transition count 729
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 465 place count 295 transition count 725
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 475 place count 289 transition count 725
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 477 place count 287 transition count 723
Iterating global reduction 10 with 2 rules applied. Total rules applied 479 place count 287 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 287 transition count 721
Applied a total of 481 rules in 168 ms. Remains 287 /534 variables (removed 247) and now considering 721/945 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 287/534 places, 721/945 transitions.
RANDOM walk for 40000 steps (807 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (309 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (315 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (318 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (278 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (313 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (330 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 503963 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :5 out of 6
Probabilistic random walk after 503963 steps, saw 197830 distinct states, run finished after 3006 ms. (steps per millisecond=167 ) properties seen :5
// Phase 1: matrix 721 rows 287 cols
[2024-05-20 18:00:34] [INFO ] Computed 41 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/177 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:00:34] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/197 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/273 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/278 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/287 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 721/1008 variables, 287/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1008 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1008 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 329 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/177 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/197 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/273 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/278 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/287 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 721/1008 variables, 287/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1008 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1008 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1008 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 6 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 721/721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 287 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 719
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 719
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 284 transition count 719
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 283 transition count 718
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 283 transition count 717
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 10 place count 282 transition count 716
Applied a total of 10 rules in 39 ms. Remains 282 /287 variables (removed 5) and now considering 716/721 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 282/287 places, 716/721 transitions.
RANDOM walk for 40000 steps (872 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (339 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523625 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523625 steps, saw 239828 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
// Phase 1: matrix 716 rows 282 cols
[2024-05-20 18:00:38] [INFO ] Computed 40 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/175 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:00:38] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/195 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/268 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/273 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/274 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/282 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 716/998 variables, 282/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/998 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/998 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/175 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/195 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/268 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/273 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/274 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/282 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 716/998 variables, 282/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/998 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/998 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/998 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1061ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 716/716 transitions.
Applied a total of 0 rules in 12 ms. Remains 282 /282 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 282/282 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 716/716 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2024-05-20 18:00:39] [INFO ] Invariant cache hit.
[2024-05-20 18:00:40] [INFO ] Implicit Places using invariants in 377 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187, 266, 269, 273, 276, 279]
[2024-05-20 18:00:40] [INFO ] Actually due to overlaps returned [187, 88, 94, 99, 175, 181, 186, 266, 273, 276, 279, 71, 100, 158, 269]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 380 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 267/282 places, 716/716 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 267 transition count 712
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 263 transition count 712
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 19 place count 252 transition count 699
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 252 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 252 transition count 697
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 250 transition count 695
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 250 transition count 695
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 245 transition count 690
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 53 place count 245 transition count 683
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 60 place count 238 transition count 683
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 238 transition count 681
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 236 transition count 681
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 65 place count 236 transition count 681
Applied a total of 65 rules in 55 ms. Remains 236 /267 variables (removed 31) and now considering 681/716 (removed 35) transitions.
// Phase 1: matrix 681 rows 236 cols
[2024-05-20 18:00:40] [INFO ] Computed 25 invariants in 6 ms
[2024-05-20 18:00:40] [INFO ] Implicit Places using invariants in 271 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 274 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 234/282 places, 681/716 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 728 ms. Remains : 234/282 places, 681/716 transitions.
RANDOM walk for 40000 steps (794 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (334 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 574751 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 574751 steps, saw 250980 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 681 rows 234 cols
[2024-05-20 18:00:43] [INFO ] Computed 23 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/171 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/201 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/234 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 681/915 variables, 234/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/915 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/915 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 915/915 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:00:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/171 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/201 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/234 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 681/915 variables, 234/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/915 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/915 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/915 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 915/915 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 848ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 681/681 transitions.
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 234/234 places, 681/681 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 681/681 transitions.
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-20 18:00:44] [INFO ] Invariant cache hit.
[2024-05-20 18:00:44] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-20 18:00:44] [INFO ] Invariant cache hit.
[2024-05-20 18:00:45] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-20 18:00:45] [INFO ] Redundant transitions in 41 ms returned []
Running 666 sub problems to find dead transitions.
[2024-05-20 18:00:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (OVERLAPS) 1/234 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-20 18:01:00] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 3 ms to minimize.
[2024-05-20 18:01:01] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2024-05-20 18:01:03] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
[2024-05-20 18:01:04] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 3 ms to minimize.
Problem TDEAD656 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 7 (OVERLAPS) 681/915 variables, 234/261 constraints. Problems are: Problem set: 7 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 261 constraints, problems are : Problem set: 7 solved, 659 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 7 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 13/17 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 3 (OVERLAPS) 1/234 variables, 3/20 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/23 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 659 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 7 (OVERLAPS) 681/915 variables, 234/261 constraints. Problems are: Problem set: 238 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 689 constraints, problems are : Problem set: 238 solved, 428 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 428/666 constraints, Known Traps: 4/4 constraints]
After SMT, in 60754ms problems are : Problem set: 238 solved, 428 unsolved
Search for dead transitions found 238 dead transitions in 60767ms
Found 238 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 238 transitions
Dead transitions reduction (with SMT) removed 238 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/234 places, 443/681 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-05-20 18:01:46] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61896 ms. Remains : 234/234 places, 443/681 transitions.
RANDOM walk for 40000 steps (838 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (344 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 779774 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 779774 steps, saw 326199 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
// Phase 1: matrix 443 rows 234 cols
[2024-05-20 18:01:49] [INFO ] Computed 24 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/167 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/196 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:01:49] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/200 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/234 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 443/677 variables, 234/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/677 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/677 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:01:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 127/167 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/196 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:01:49] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-05-20 18:01:49] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/200 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/234 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 443/677 variables, 234/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/677 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/677 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/677 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 443/443 transitions.
Applied a total of 0 rules in 9 ms. Remains 234 /234 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 234/234 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-05-20 18:01:50] [INFO ] Invariant cache hit.
[2024-05-20 18:01:50] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-20 18:01:50] [INFO ] Invariant cache hit.
[2024-05-20 18:01:51] [INFO ] Implicit Places using invariants and state equation in 691 ms returned [1, 21, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 68, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136]
Discarding 29 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 959 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/234 places, 441/443 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 205 transition count 439
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 4 place count 203 transition count 439
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 17 place count 203 transition count 437
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 30 place count 190 transition count 437
Applied a total of 30 rules in 18 ms. Remains 190 /205 variables (removed 15) and now considering 437/441 (removed 4) transitions.
// Phase 1: matrix 437 rows 190 cols
[2024-05-20 18:01:51] [INFO ] Computed 18 invariants in 4 ms
[2024-05-20 18:01:51] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-20 18:01:51] [INFO ] Invariant cache hit.
[2024-05-20 18:01:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-20 18:01:52] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 190/234 places, 437/443 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1706 ms. Remains : 190/234 places, 437/443 transitions.
RANDOM walk for 40000 steps (857 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (314 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5051 steps, run visited all 1 properties in 25 ms. (steps per millisecond=202 )
Probabilistic random walk after 5051 steps, saw 2767 distinct states, run finished after 25 ms. (steps per millisecond=202 ) properties seen :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (G (OR (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p3) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p2))), (F p1), (F (NOT (OR p1 (NOT p3) p2))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p3)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p3), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 530 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 945/945 transitions.
Applied a total of 0 rules in 11 ms. Remains 534 /534 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 534 cols
[2024-05-20 18:01:53] [INFO ] Computed 67 invariants in 7 ms
[2024-05-20 18:01:53] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-20 18:01:53] [INFO ] Invariant cache hit.
[2024-05-20 18:01:55] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1863 ms to find 0 implicit places.
Running 944 sub problems to find dead transitions.
[2024-05-20 18:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1479 variables, and 67 constraints, problems are : Problem set: 0 solved, 944 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 944/944 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 944 unsolved
[2024-05-20 18:02:46] [INFO ] Deduced a trap composed of 79 places in 292 ms of which 4 ms to minimize.
[2024-05-20 18:02:49] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 6 ms to minimize.
[2024-05-20 18:02:51] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
Problem TDEAD727 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
[2024-05-20 18:02:51] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 3 ms to minimize.
Problem TDEAD767 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
[2024-05-20 18:02:52] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 3 ms to minimize.
[2024-05-20 18:02:52] [INFO ] Deduced a trap composed of 106 places in 302 ms of which 4 ms to minimize.
[2024-05-20 18:02:53] [INFO ] Deduced a trap composed of 98 places in 312 ms of which 3 ms to minimize.
[2024-05-20 18:02:53] [INFO ] Deduced a trap composed of 112 places in 303 ms of which 5 ms to minimize.
[2024-05-20 18:02:54] [INFO ] Deduced a trap composed of 111 places in 302 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1479 variables, and 76 constraints, problems are : Problem set: 9 solved, 935 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/944 constraints, Known Traps: 9/9 constraints]
After SMT, in 60653ms problems are : Problem set: 9 solved, 935 unsolved
Search for dead transitions found 9 dead transitions in 60665ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 534/534 places, 936/945 transitions.
Applied a total of 0 rules in 8 ms. Remains 534 /534 variables (removed 0) and now considering 936/936 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62551 ms. Remains : 534/534 places, 936/945 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
RANDOM walk for 40000 steps (479 resets) in 411 ms. (97 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40003 steps (113 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (131 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (127 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (114 resets) in 206 ms. (193 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (124 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (135 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (134 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
// Phase 1: matrix 936 rows 534 cols
[2024-05-20 18:02:57] [INFO ] Computed 68 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 149/243 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 290/533 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 936/1470 variables, 534/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1470 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1470 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1470/1470 variables, and 602 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 149/243 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 290/533 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/534 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 936/1470 variables, 534/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1470 variables, 6/608 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-20 18:03:00] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1470 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1470 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1470 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1470/1470 variables, and 609 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 4497ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12861 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 936/936 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 534 transition count 842
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 440 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 439 transition count 841
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 190 place count 439 transition count 777
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 339 place count 354 transition count 777
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 348 place count 349 transition count 773
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 356 place count 345 transition count 769
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 360 place count 341 transition count 769
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 360 place count 341 transition count 761
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 376 place count 333 transition count 761
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 380 place count 329 transition count 757
Iterating global reduction 6 with 4 rules applied. Total rules applied 384 place count 329 transition count 757
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 387 place count 329 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 388 place count 328 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 388 place count 328 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 390 place count 327 transition count 753
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 454 place count 295 transition count 721
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 456 place count 295 transition count 719
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 458 place count 293 transition count 719
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 464 place count 293 transition count 713
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 470 place count 287 transition count 713
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 471 place count 287 transition count 712
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 478 place count 287 transition count 712
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 479 place count 286 transition count 711
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 284 transition count 711
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 481 place count 284 transition count 707
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 491 place count 278 transition count 707
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 493 place count 276 transition count 705
Iterating global reduction 11 with 2 rules applied. Total rules applied 495 place count 276 transition count 705
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 497 place count 276 transition count 703
Applied a total of 497 rules in 148 ms. Remains 276 /534 variables (removed 258) and now considering 703/936 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 276/534 places, 703/936 transitions.
RANDOM walk for 40000 steps (817 resets) in 614 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (291 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (321 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (348 resets) in 390 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (331 resets) in 468 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (382 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (317 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 421451 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :5 out of 6
Probabilistic random walk after 421451 steps, saw 159092 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :5
// Phase 1: matrix 703 rows 276 cols
[2024-05-20 18:03:18] [INFO ] Computed 38 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/164 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/184 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/262 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/267 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/268 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/276 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 703/979 variables, 276/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/979 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/979 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 979/979 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/164 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/184 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/262 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/267 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/268 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/276 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 703/979 variables, 276/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/979 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/979 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/979 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 979/979 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1228ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 703/703 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 275 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 274 transition count 701
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 273 transition count 701
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 272 transition count 700
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 272 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 272 transition count 699
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 10 place count 271 transition count 698
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 11 place count 271 transition count 697
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 13 place count 270 transition count 696
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 14 place count 270 transition count 695
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 16 place count 268 transition count 695
Applied a total of 16 rules in 70 ms. Remains 268 /276 variables (removed 8) and now considering 695/703 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 268/276 places, 695/703 transitions.
RANDOM walk for 40000 steps (808 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (345 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 406281 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 406281 steps, saw 163457 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
// Phase 1: matrix 695 rows 268 cols
[2024-05-20 18:03:23] [INFO ] Computed 36 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 121/159 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/179 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/254 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/259 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/260 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/268 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 695/963 variables, 268/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/963 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/963 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 268/268 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:03:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 121/159 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/179 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/254 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/259 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/260 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/268 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 695/963 variables, 268/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/963 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/963 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/963 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 695/695 transitions.
Applied a total of 0 rules in 11 ms. Remains 268 /268 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 268/268 places, 695/695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 268 /268 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2024-05-20 18:03:24] [INFO ] Invariant cache hit.
[2024-05-20 18:03:24] [INFO ] Implicit Places using invariants in 450 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 175, 181, 184, 186, 187]
[2024-05-20 18:03:24] [INFO ] Actually due to overlaps returned [187, 88, 94, 99, 175, 181, 186, 71, 100, 158]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 453 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 258/268 places, 695/695 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 249 transition count 686
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 249 transition count 686
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 247 transition count 684
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 247 transition count 684
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 30 place count 243 transition count 680
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 243 transition count 674
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 237 transition count 674
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 237 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 235 transition count 672
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 235 transition count 672
Applied a total of 47 rules in 58 ms. Remains 235 /258 variables (removed 23) and now considering 672/695 (removed 23) transitions.
// Phase 1: matrix 672 rows 235 cols
[2024-05-20 18:03:24] [INFO ] Computed 26 invariants in 7 ms
[2024-05-20 18:03:25] [INFO ] Implicit Places using invariants in 382 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 384 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/268 places, 672/695 transitions.
Applied a total of 0 rules in 9 ms. Remains 233 /233 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 916 ms. Remains : 233/268 places, 672/695 transitions.
RANDOM walk for 40000 steps (821 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (329 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 375203 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 375203 steps, saw 158965 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 672 rows 233 cols
[2024-05-20 18:03:28] [INFO ] Computed 24 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:03:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 132/170 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/200 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/233 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 672/905 variables, 233/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/905 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/905 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 905/905 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 132/170 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/200 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 33/233 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 672/905 variables, 233/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/905 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/905 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/905 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 905/905 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1085ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 233 /233 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 233/233 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 233 /233 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-05-20 18:03:29] [INFO ] Invariant cache hit.
[2024-05-20 18:03:29] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-20 18:03:29] [INFO ] Invariant cache hit.
[2024-05-20 18:03:30] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2024-05-20 18:03:30] [INFO ] Redundant transitions in 8 ms returned []
Running 658 sub problems to find dead transitions.
[2024-05-20 18:03:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (OVERLAPS) 1/233 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
[2024-05-20 18:03:57] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 3 ms to minimize.
[2024-05-20 18:03:59] [INFO ] Deduced a trap composed of 78 places in 404 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 233/905 variables, and 26 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/233 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (OVERLAPS) 1/233 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 7 (OVERLAPS) 672/905 variables, 233/259 constraints. Problems are: Problem set: 171 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/905 variables, and 746 constraints, problems are : Problem set: 171 solved, 487 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 487/658 constraints, Known Traps: 2/2 constraints]
After SMT, in 60897ms problems are : Problem set: 171 solved, 487 unsolved
Search for dead transitions found 171 dead transitions in 60911ms
Found 171 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 171 transitions
Dead transitions reduction (with SMT) removed 171 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/233 places, 501/672 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-20 18:04:31] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62527 ms. Remains : 233/233 places, 501/672 transitions.
RANDOM walk for 40000 steps (825 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (314 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 481764 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 481764 steps, saw 192186 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 501 rows 233 cols
[2024-05-20 18:04:35] [INFO ] Computed 24 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/62 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/170 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/200 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/233 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:04:35] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 501/734 variables, 233/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/734 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/62 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/170 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/200 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/233 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 18:04:36] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 3 ms to minimize.
[2024-05-20 18:04:36] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 501/734 variables, 233/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/734 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/734 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/734 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 501/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 233/233 places, 501/501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 501/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-20 18:04:36] [INFO ] Invariant cache hit.
[2024-05-20 18:04:37] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-20 18:04:37] [INFO ] Invariant cache hit.
[2024-05-20 18:04:38] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned [21, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136]
Discarding 25 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1792 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/233 places, 500/501 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 499
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 499
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 207 transition count 498
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 200 transition count 498
Applied a total of 16 rules in 22 ms. Remains 200 /208 variables (removed 8) and now considering 498/500 (removed 2) transitions.
// Phase 1: matrix 498 rows 200 cols
[2024-05-20 18:04:38] [INFO ] Computed 19 invariants in 7 ms
[2024-05-20 18:04:38] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-20 18:04:38] [INFO ] Invariant cache hit.
[2024-05-20 18:04:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 18:04:39] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 200/233 places, 498/501 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3133 ms. Remains : 200/233 places, 498/501 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p3) p2))), (F p2), (F p3), (F (NOT (OR p0 p1 (NOT p3)))), (F p1), (F (NOT (OR p1 (NOT p3)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 628 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Stuttering acceptance computed with spot in 449 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (AND p2 p3 p1), (AND p2 p3 p1)]
Product exploration explored 100000 steps with 1549 reset in 347 ms.
Product exploration explored 100000 steps with 1545 reset in 550 ms.
Support contains 7 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 936/936 transitions.
Applied a total of 0 rules in 15 ms. Remains 534 /534 variables (removed 0) and now considering 936/936 (removed 0) transitions.
// Phase 1: matrix 936 rows 534 cols
[2024-05-20 18:04:43] [INFO ] Computed 68 invariants in 12 ms
[2024-05-20 18:04:43] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-20 18:04:43] [INFO ] Invariant cache hit.
[2024-05-20 18:04:45] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
Running 935 sub problems to find dead transitions.
[2024-05-20 18:04:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 935 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 935 unsolved
SMT process timed out in 30692ms, After SMT, problems are : Problem set: 0 solved, 935 unsolved
Search for dead transitions found 0 dead transitions in 30705ms
Finished structural reductions in LTL mode , in 1 iterations and 33483 ms. Remains : 534/534 places, 936/936 transitions.
Treatment of property ASLink-PT-02a-LTLFireability-00 finished in 303303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 536 transition count 856
Reduce places removed 90 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 446 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 183 place count 444 transition count 786
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 340 place count 355 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 350 place count 350 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 355 place count 345 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 355 place count 345 transition count 772
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 373 place count 336 transition count 772
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 378 place count 331 transition count 759
Iterating global reduction 5 with 5 rules applied. Total rules applied 383 place count 331 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 19 rules applied. Total rules applied 402 place count 327 transition count 744
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 415 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 415 place count 314 transition count 743
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 417 place count 313 transition count 743
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 421 place count 309 transition count 732
Iterating global reduction 7 with 4 rules applied. Total rules applied 425 place count 309 transition count 732
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 428 place count 309 transition count 729
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 429 place count 308 transition count 721
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 308 transition count 721
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 431 place count 307 transition count 713
Iterating global reduction 8 with 1 rules applied. Total rules applied 432 place count 307 transition count 713
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 433 place count 306 transition count 705
Iterating global reduction 8 with 1 rules applied. Total rules applied 434 place count 306 transition count 705
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 435 place count 305 transition count 697
Iterating global reduction 8 with 1 rules applied. Total rules applied 436 place count 305 transition count 697
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 437 place count 304 transition count 689
Iterating global reduction 8 with 1 rules applied. Total rules applied 438 place count 304 transition count 689
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 439 place count 303 transition count 681
Iterating global reduction 8 with 1 rules applied. Total rules applied 440 place count 303 transition count 681
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 441 place count 302 transition count 673
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 302 transition count 673
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 443 place count 301 transition count 665
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 301 transition count 665
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 445 place count 300 transition count 657
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 300 transition count 657
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 447 place count 299 transition count 649
Iterating global reduction 8 with 1 rules applied. Total rules applied 448 place count 299 transition count 649
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 449 place count 298 transition count 641
Iterating global reduction 8 with 1 rules applied. Total rules applied 450 place count 298 transition count 641
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 451 place count 297 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 452 place count 297 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 453 place count 296 transition count 625
Iterating global reduction 8 with 1 rules applied. Total rules applied 454 place count 296 transition count 625
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 455 place count 295 transition count 617
Iterating global reduction 8 with 1 rules applied. Total rules applied 456 place count 295 transition count 617
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 457 place count 294 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 458 place count 294 transition count 609
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 510 place count 268 transition count 583
Applied a total of 510 rules in 133 ms. Remains 268 /538 variables (removed 270) and now considering 583/945 (removed 362) transitions.
// Phase 1: matrix 583 rows 268 cols
[2024-05-20 18:05:16] [INFO ] Computed 38 invariants in 4 ms
[2024-05-20 18:05:17] [INFO ] Implicit Places using invariants in 293 ms returned [17, 18, 77, 94, 100, 105, 164, 181, 187, 192, 194, 223, 265]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 295 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/538 places, 583/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 253 transition count 581
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 253 transition count 579
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 251 transition count 579
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 247 transition count 575
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 247 transition count 575
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 243 transition count 571
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 243 transition count 571
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 241 transition count 569
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 241 transition count 569
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 230 transition count 558
Applied a total of 50 rules in 33 ms. Remains 230 /255 variables (removed 25) and now considering 558/583 (removed 25) transitions.
// Phase 1: matrix 558 rows 230 cols
[2024-05-20 18:05:17] [INFO ] Computed 25 invariants in 4 ms
[2024-05-20 18:05:17] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-20 18:05:17] [INFO ] Invariant cache hit.
[2024-05-20 18:05:18] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/538 places, 558/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1578 ms. Remains : 230/538 places, 558/945 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-01 finished in 1656 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(p1))&&X(G(!p2))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 536 transition count 936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 536 transition count 936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 535 transition count 928
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 534 transition count 920
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 533 transition count 912
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 532 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 531 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 530 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 529 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 528 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 527 transition count 864
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 526 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 525 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 524 transition count 840
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 523 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 522 transition count 824
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 521 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 520 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 520 transition count 808
Applied a total of 35 rules in 130 ms. Remains 520 /538 variables (removed 18) and now considering 808/945 (removed 137) transitions.
// Phase 1: matrix 808 rows 520 cols
[2024-05-20 18:05:18] [INFO ] Computed 70 invariants in 9 ms
[2024-05-20 18:05:19] [INFO ] Implicit Places using invariants in 620 ms returned [19, 410]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 621 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 518/538 places, 808/945 transitions.
Applied a total of 0 rules in 8 ms. Remains 518 /518 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 518/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), p2, (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-03
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-03 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 536 transition count 936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 536 transition count 936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 535 transition count 928
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 534 transition count 920
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 534 transition count 920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 533 transition count 912
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 533 transition count 912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 532 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 532 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 531 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 531 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 530 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 530 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 529 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 529 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 528 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 528 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 527 transition count 864
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 527 transition count 864
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 526 transition count 856
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 526 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 525 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 525 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 524 transition count 840
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 524 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 523 transition count 832
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 523 transition count 832
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 522 transition count 824
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 522 transition count 824
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 521 transition count 816
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 521 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 520 transition count 808
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 520 transition count 808
Applied a total of 35 rules in 213 ms. Remains 520 /538 variables (removed 18) and now considering 808/945 (removed 137) transitions.
[2024-05-20 18:05:19] [INFO ] Invariant cache hit.
[2024-05-20 18:05:20] [INFO ] Implicit Places using invariants in 645 ms returned [18, 19, 410]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 647 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/538 places, 808/945 transitions.
Applied a total of 0 rules in 10 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 871 ms. Remains : 517/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-07
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-07 finished in 962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 536 transition count 857
Reduce places removed 89 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 179 place count 447 transition count 855
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 445 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 183 place count 444 transition count 786
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 157 rules applied. Total rules applied 340 place count 355 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 10 rules applied. Total rules applied 350 place count 350 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 355 place count 345 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 355 place count 345 transition count 772
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 373 place count 336 transition count 772
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 378 place count 331 transition count 759
Iterating global reduction 6 with 5 rules applied. Total rules applied 383 place count 331 transition count 759
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 19 rules applied. Total rules applied 402 place count 327 transition count 744
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 415 place count 314 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 415 place count 314 transition count 743
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 313 transition count 743
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 421 place count 309 transition count 732
Iterating global reduction 8 with 4 rules applied. Total rules applied 425 place count 309 transition count 732
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 428 place count 309 transition count 729
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 429 place count 308 transition count 721
Iterating global reduction 9 with 1 rules applied. Total rules applied 430 place count 308 transition count 721
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 431 place count 307 transition count 713
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 307 transition count 713
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 433 place count 306 transition count 705
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 306 transition count 705
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 435 place count 305 transition count 697
Iterating global reduction 9 with 1 rules applied. Total rules applied 436 place count 305 transition count 697
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 437 place count 304 transition count 689
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 304 transition count 689
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 303 transition count 681
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 303 transition count 681
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 441 place count 302 transition count 673
Iterating global reduction 9 with 1 rules applied. Total rules applied 442 place count 302 transition count 673
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 301 transition count 665
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 301 transition count 665
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 445 place count 300 transition count 657
Iterating global reduction 9 with 1 rules applied. Total rules applied 446 place count 300 transition count 657
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 447 place count 299 transition count 649
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 299 transition count 649
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 449 place count 298 transition count 641
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 298 transition count 641
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 297 transition count 633
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 297 transition count 633
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 296 transition count 625
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 296 transition count 625
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 295 transition count 617
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 295 transition count 617
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 457 place count 294 transition count 609
Iterating global reduction 9 with 1 rules applied. Total rules applied 458 place count 294 transition count 609
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 508 place count 269 transition count 584
Applied a total of 508 rules in 146 ms. Remains 269 /538 variables (removed 269) and now considering 584/945 (removed 361) transitions.
// Phase 1: matrix 584 rows 269 cols
[2024-05-20 18:05:20] [INFO ] Computed 38 invariants in 4 ms
[2024-05-20 18:05:21] [INFO ] Implicit Places using invariants in 466 ms returned [17, 18, 77, 94, 100, 106, 165, 182, 188, 193, 195, 224, 266]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 469 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 256/538 places, 584/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 256 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 254 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 254 transition count 580
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 252 transition count 580
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 248 transition count 576
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 248 transition count 576
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 244 transition count 572
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 244 transition count 572
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 242 transition count 570
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 242 transition count 570
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 231 transition count 559
Applied a total of 50 rules in 44 ms. Remains 231 /256 variables (removed 25) and now considering 559/584 (removed 25) transitions.
// Phase 1: matrix 559 rows 231 cols
[2024-05-20 18:05:21] [INFO ] Computed 25 invariants in 6 ms
[2024-05-20 18:05:21] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-20 18:05:21] [INFO ] Invariant cache hit.
[2024-05-20 18:05:22] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/538 places, 559/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1770 ms. Remains : 231/538 places, 559/945 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-09
Product exploration explored 100000 steps with 2191 reset in 234 ms.
Product exploration explored 100000 steps with 2192 reset in 258 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 based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 1378 steps (33 resets) in 8 ms. (153 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 559/559 transitions.
Applied a total of 0 rules in 12 ms. Remains 231 /231 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2024-05-20 18:05:23] [INFO ] Invariant cache hit.
[2024-05-20 18:05:23] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-20 18:05:23] [INFO ] Invariant cache hit.
[2024-05-20 18:05:24] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2024-05-20 18:05:24] [INFO ] Redundant transitions in 8 ms returned []
Running 543 sub problems to find dead transitions.
[2024-05-20 18:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-20 18:05:42] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-20 18:05:44] [INFO ] Deduced a trap composed of 88 places in 204 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 7 (OVERLAPS) 559/790 variables, 231/258 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/790 variables, and 258 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
At refinement iteration 7 (OVERLAPS) 559/790 variables, 231/258 constraints. Problems are: Problem set: 154 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/790 variables, and 647 constraints, problems are : Problem set: 154 solved, 389 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 389/543 constraints, Known Traps: 2/2 constraints]
After SMT, in 60500ms problems are : Problem set: 154 solved, 389 unsolved
Search for dead transitions found 154 dead transitions in 60508ms
Found 154 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 154 transitions
Dead transitions reduction (with SMT) removed 154 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 231/231 places, 405/559 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 223 transition count 405
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 8 place count 223 transition count 397
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 24 place count 215 transition count 397
Applied a total of 24 rules in 13 ms. Remains 215 /231 variables (removed 16) and now considering 397/405 (removed 8) transitions.
// Phase 1: matrix 397 rows 215 cols
[2024-05-20 18:06:24] [INFO ] Computed 24 invariants in 3 ms
[2024-05-20 18:06:25] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-20 18:06:25] [INFO ] Invariant cache hit.
[2024-05-20 18:06:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 18:06:25] [INFO ] Implicit Places using invariants and state equation in 880 ms returned [48, 49, 50, 52, 53, 54]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1260 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/231 places, 397/559 transitions.
Applied a total of 0 rules in 7 ms. Remains 209 /209 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 62779 ms. Remains : 209/231 places, 397/559 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 927 steps (18 resets) in 7 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2163 reset in 316 ms.
Product exploration explored 100000 steps with 2232 reset in 300 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 397/397 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 397/397 (removed 0) transitions.
// Phase 1: matrix 397 rows 209 cols
[2024-05-20 18:06:27] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 18:06:27] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-20 18:06:27] [INFO ] Invariant cache hit.
[2024-05-20 18:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 18:06:27] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-05-20 18:06:27] [INFO ] Redundant transitions in 7 ms returned []
Running 381 sub problems to find dead transitions.
[2024-05-20 18:06:27] [INFO ] Invariant cache hit.
[2024-05-20 18:06:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 12/18 constraints. Problems are: Problem set: 7 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 3/21 constraints. Problems are: Problem set: 7 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/22 constraints. Problems are: Problem set: 7 solved, 374 unsolved
[2024-05-20 18:06:37] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/23 constraints. Problems are: Problem set: 7 solved, 374 unsolved
[2024-05-20 18:06:39] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-20 18:06:39] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/25 constraints. Problems are: Problem set: 7 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 374 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 8 (OVERLAPS) 397/606 variables, 209/234 constraints. Problems are: Problem set: 53 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 1/235 constraints. Problems are: Problem set: 53 solved, 328 unsolved
[2024-05-20 18:06:48] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 1/236 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 0/236 constraints. Problems are: Problem set: 54 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/606 variables, and 236 constraints, problems are : Problem set: 54 solved, 327 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 209/209 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 54 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 6/6 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 12/18 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 1/19 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/19 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/209 variables, 3/22 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/23 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 3/26 constraints. Problems are: Problem set: 54 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/26 constraints. Problems are: Problem set: 54 solved, 327 unsolved
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 8 (OVERLAPS) 397/606 variables, 209/235 constraints. Problems are: Problem set: 166 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 1/236 constraints. Problems are: Problem set: 166 solved, 215 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 215/451 constraints. Problems are: Problem set: 171 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 0/451 constraints. Problems are: Problem set: 171 solved, 210 unsolved
[2024-05-20 18:07:23] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/606 variables, 1/452 constraints. Problems are: Problem set: 171 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 452 constraints, problems are : Problem set: 171 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 209/209 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 215/381 constraints, Known Traps: 5/5 constraints]
After SMT, in 60178ms problems are : Problem set: 171 solved, 210 unsolved
Search for dead transitions found 171 dead transitions in 60182ms
Found 171 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 171 transitions
Dead transitions reduction (with SMT) removed 171 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 209/209 places, 226/397 transitions.
Ensure Unique test removed 24 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 185 transition count 196
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 155 transition count 196
Applied a total of 60 rules in 5 ms. Remains 155 /209 variables (removed 54) and now considering 196/226 (removed 30) transitions.
// Phase 1: matrix 196 rows 155 cols
[2024-05-20 18:07:28] [INFO ] Computed 23 invariants in 1 ms
[2024-05-20 18:07:28] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-20 18:07:28] [INFO ] Invariant cache hit.
[2024-05-20 18:07:28] [INFO ] Implicit Places using invariants and state equation in 432 ms returned [1, 2, 38]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 624 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 152/209 places, 196/397 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61637 ms. Remains : 152/209 places, 196/397 transitions.
Treatment of property ASLink-PT-02a-LTLFireability-09 finished in 128355 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)&&F(G(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 536 transition count 856
Reduce places removed 90 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 181 place count 446 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 444 transition count 854
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 183 place count 444 transition count 787
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 338 place count 356 transition count 787
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 348 place count 351 transition count 782
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 346 transition count 782
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 353 place count 346 transition count 773
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 371 place count 337 transition count 773
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 376 place count 332 transition count 760
Iterating global reduction 5 with 5 rules applied. Total rules applied 381 place count 332 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 15 rules applied. Total rules applied 396 place count 328 transition count 749
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 13 rules applied. Total rules applied 409 place count 319 transition count 745
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 413 place count 315 transition count 745
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 413 place count 315 transition count 744
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 415 place count 314 transition count 744
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 419 place count 310 transition count 733
Iterating global reduction 8 with 4 rules applied. Total rules applied 423 place count 310 transition count 733
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 426 place count 310 transition count 730
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 427 place count 309 transition count 722
Iterating global reduction 9 with 1 rules applied. Total rules applied 428 place count 309 transition count 722
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 429 place count 308 transition count 714
Iterating global reduction 9 with 1 rules applied. Total rules applied 430 place count 308 transition count 714
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 431 place count 307 transition count 706
Iterating global reduction 9 with 1 rules applied. Total rules applied 432 place count 307 transition count 706
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 433 place count 306 transition count 698
Iterating global reduction 9 with 1 rules applied. Total rules applied 434 place count 306 transition count 698
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 435 place count 305 transition count 690
Iterating global reduction 9 with 1 rules applied. Total rules applied 436 place count 305 transition count 690
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 437 place count 304 transition count 682
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 304 transition count 682
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 303 transition count 674
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 303 transition count 674
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 441 place count 302 transition count 666
Iterating global reduction 9 with 1 rules applied. Total rules applied 442 place count 302 transition count 666
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 443 place count 301 transition count 658
Iterating global reduction 9 with 1 rules applied. Total rules applied 444 place count 301 transition count 658
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 445 place count 300 transition count 650
Iterating global reduction 9 with 1 rules applied. Total rules applied 446 place count 300 transition count 650
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 447 place count 299 transition count 642
Iterating global reduction 9 with 1 rules applied. Total rules applied 448 place count 299 transition count 642
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 449 place count 298 transition count 634
Iterating global reduction 9 with 1 rules applied. Total rules applied 450 place count 298 transition count 634
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 297 transition count 626
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 297 transition count 626
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 453 place count 296 transition count 618
Iterating global reduction 9 with 1 rules applied. Total rules applied 454 place count 296 transition count 618
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 295 transition count 610
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 295 transition count 610
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 506 place count 270 transition count 585
Applied a total of 506 rules in 213 ms. Remains 270 /538 variables (removed 268) and now considering 585/945 (removed 360) transitions.
// Phase 1: matrix 585 rows 270 cols
[2024-05-20 18:07:28] [INFO ] Computed 38 invariants in 6 ms
[2024-05-20 18:07:29] [INFO ] Implicit Places using invariants in 331 ms returned [17, 18, 77, 94, 100, 105, 164, 181, 187, 192, 194, 223, 266]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 334 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 257/538 places, 585/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 255 transition count 583
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 255 transition count 581
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 253 transition count 581
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 249 transition count 577
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 249 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 245 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 245 transition count 573
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 243 transition count 571
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 243 transition count 571
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 232 transition count 560
Applied a total of 50 rules in 35 ms. Remains 232 /257 variables (removed 25) and now considering 560/585 (removed 25) transitions.
// Phase 1: matrix 560 rows 232 cols
[2024-05-20 18:07:29] [INFO ] Computed 25 invariants in 4 ms
[2024-05-20 18:07:29] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-20 18:07:29] [INFO ] Invariant cache hit.
[2024-05-20 18:07:30] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 232/538 places, 560/945 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1608 ms. Remains : 232/538 places, 560/945 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-11
Product exploration explored 100000 steps with 2220 reset in 221 ms.
Stack based approach found an accepted trace after 56494 steps with 1270 reset with depth 171 and stack size 171 in 141 ms.
FORMULA ASLink-PT-02a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLFireability-11 finished in 2143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 8 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 537 transition count 936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 537 transition count 936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 536 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 536 transition count 928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 535 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 535 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 534 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 534 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 533 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 533 transition count 904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 532 transition count 896
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 532 transition count 896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 531 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 531 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 530 transition count 880
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 530 transition count 880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 529 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 529 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 528 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 528 transition count 864
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 527 transition count 856
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 527 transition count 856
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 526 transition count 848
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 526 transition count 848
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 525 transition count 840
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 525 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 524 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 524 transition count 832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 523 transition count 824
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 523 transition count 824
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 522 transition count 816
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 522 transition count 816
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 521 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 521 transition count 808
Applied a total of 34 rules in 198 ms. Remains 521 /538 variables (removed 17) and now considering 808/945 (removed 137) transitions.
// Phase 1: matrix 808 rows 521 cols
[2024-05-20 18:07:31] [INFO ] Computed 71 invariants in 8 ms
[2024-05-20 18:07:31] [INFO ] Implicit Places using invariants in 689 ms returned [18, 411]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 692 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 519/538 places, 808/945 transitions.
Applied a total of 0 rules in 13 ms. Remains 519 /519 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 903 ms. Remains : 519/538 places, 808/945 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 659 ms.
Product exploration explored 100000 steps with 50000 reset in 652 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLFireability-13 finished in 2369 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||G(p1))))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 945/945 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 537 transition count 857
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 449 transition count 857
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 177 place count 449 transition count 794
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 323 place count 366 transition count 794
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 326 place count 364 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 363 transition count 793
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 327 place count 363 transition count 785
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 343 place count 355 transition count 785
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 346 place count 352 transition count 774
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 352 transition count 774
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 17 rules applied. Total rules applied 366 place count 348 transition count 761
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 379 place count 335 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 379 place count 335 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 334 transition count 760
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 385 place count 330 transition count 749
Iterating global reduction 6 with 4 rules applied. Total rules applied 389 place count 330 transition count 749
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 392 place count 330 transition count 746
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 329 transition count 738
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 329 transition count 738
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 395 place count 328 transition count 730
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 328 transition count 730
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 397 place count 327 transition count 722
Iterating global reduction 7 with 1 rules applied. Total rules applied 398 place count 327 transition count 722
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 399 place count 326 transition count 714
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 326 transition count 714
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 401 place count 325 transition count 706
Iterating global reduction 7 with 1 rules applied. Total rules applied 402 place count 325 transition count 706
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 403 place count 324 transition count 698
Iterating global reduction 7 with 1 rules applied. Total rules applied 404 place count 324 transition count 698
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 405 place count 323 transition count 690
Iterating global reduction 7 with 1 rules applied. Total rules applied 406 place count 323 transition count 690
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 407 place count 322 transition count 682
Iterating global reduction 7 with 1 rules applied. Total rules applied 408 place count 322 transition count 682
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 409 place count 321 transition count 674
Iterating global reduction 7 with 1 rules applied. Total rules applied 410 place count 321 transition count 674
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 411 place count 320 transition count 666
Iterating global reduction 7 with 1 rules applied. Total rules applied 412 place count 320 transition count 666
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 413 place count 319 transition count 658
Iterating global reduction 7 with 1 rules applied. Total rules applied 414 place count 319 transition count 658
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 415 place count 318 transition count 650
Iterating global reduction 7 with 1 rules applied. Total rules applied 416 place count 318 transition count 650
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 417 place count 317 transition count 642
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 317 transition count 642
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 419 place count 316 transition count 634
Iterating global reduction 7 with 1 rules applied. Total rules applied 420 place count 316 transition count 634
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 421 place count 315 transition count 626
Iterating global reduction 7 with 1 rules applied. Total rules applied 422 place count 315 transition count 626
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 472 place count 290 transition count 601
Applied a total of 472 rules in 127 ms. Remains 290 /538 variables (removed 248) and now considering 601/945 (removed 344) transitions.
// Phase 1: matrix 601 rows 290 cols
[2024-05-20 18:07:33] [INFO ] Computed 44 invariants in 4 ms
[2024-05-20 18:07:33] [INFO ] Implicit Places using invariants in 505 ms returned [18, 19, 95, 101, 106, 122, 193, 199, 204, 224, 242, 284, 287]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 510 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/538 places, 601/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 599
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 275 transition count 594
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 270 transition count 594
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 269 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 269 transition count 593
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 268 transition count 593
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 263 transition count 588
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 263 transition count 588
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 31 place count 259 transition count 584
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 259 transition count 584
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 257 transition count 582
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 257 transition count 582
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 63 place count 245 transition count 570
Applied a total of 63 rules in 36 ms. Remains 245 /277 variables (removed 32) and now considering 570/601 (removed 31) transitions.
// Phase 1: matrix 570 rows 245 cols
[2024-05-20 18:07:33] [INFO ] Computed 30 invariants in 4 ms
[2024-05-20 18:07:34] [INFO ] Implicit Places using invariants in 453 ms returned [94, 177, 180]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 455 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/538 places, 570/945 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 240 transition count 568
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 238 transition count 566
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 238 transition count 566
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 238 transition count 564
Applied a total of 10 rules in 22 ms. Remains 238 /242 variables (removed 4) and now considering 564/570 (removed 6) transitions.
// Phase 1: matrix 564 rows 238 cols
[2024-05-20 18:07:34] [INFO ] Computed 27 invariants in 6 ms
[2024-05-20 18:07:34] [INFO ] Implicit Places using invariants in 427 ms returned [73, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 430 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 236/538 places, 564/945 transitions.
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 4 place count 234 transition count 562
Applied a total of 4 rules in 17 ms. Remains 234 /236 variables (removed 2) and now considering 562/564 (removed 2) transitions.
// Phase 1: matrix 562 rows 234 cols
[2024-05-20 18:07:34] [INFO ] Computed 25 invariants in 6 ms
[2024-05-20 18:07:35] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-20 18:07:35] [INFO ] Invariant cache hit.
[2024-05-20 18:07:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 18:07:36] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 234/538 places, 562/945 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3080 ms. Remains : 234/538 places, 562/945 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-15 finished in 3211 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)||G(F((!p1 U (G(!p1)||(!p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))))))'
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)))'
[2024-05-20 18:07:37] [INFO ] Flatten gal took : 100 ms
[2024-05-20 18:07:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-20 18:07:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 538 places, 945 transitions and 3381 arcs took 17 ms.
Total runtime 461926 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ASLink-PT-02a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 538
TRANSITIONS: 945
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.040s, Sys 0.004s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1473
MODEL NAME: /home/mcc/execution/415/model
538 places, 945 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-02a-LTLFireability-00 CANNOT_COMPUTE
FORMULA ASLink-PT-02a-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716228983507
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="ASLink-PT-02a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-02a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620116800028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;