About the Execution of GreatSPN+red for ShieldIIPs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12475.632 | 3600000.00 | 11336318.00 | 2618.80 | TF?FT?FFTFF?TT?F | 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.r355-tall-171683758000107.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 ShieldIIPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758000107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 332K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716896201020
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 11:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 11:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:36:42] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-28 11:36:42] [INFO ] Transformed 1203 places.
[2024-05-28 11:36:42] [INFO ] Transformed 1183 transitions.
[2024-05-28 11:36:42] [INFO ] Found NUPN structural information;
[2024-05-28 11:36:42] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 138 place count 1065 transition count 1045
Iterating global reduction 0 with 138 rules applied. Total rules applied 276 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 277 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 278 place count 1064 transition count 1044
Applied a total of 278 rules in 262 ms. Remains 1064 /1203 variables (removed 139) and now considering 1044/1183 (removed 139) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-05-28 11:36:43] [INFO ] Computed 181 invariants in 33 ms
[2024-05-28 11:36:43] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 11:36:43] [INFO ] Invariant cache hit.
[2024-05-28 11:36:44] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-28 11:36:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
SMT process timed out in 30347ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30391ms
Starting structural reductions in LTL mode, iteration 1 : 1064/1203 places, 1044/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32236 ms. Remains : 1064/1203 places, 1044/1183 transitions.
Support contains 19 out of 1064 places after structural reductions.
[2024-05-28 11:37:15] [INFO ] Flatten gal took : 206 ms
[2024-05-28 11:37:15] [INFO ] Flatten gal took : 77 ms
[2024-05-28 11:37:15] [INFO ] Input system was already deterministic with 1044 transitions.
RANDOM walk for 5996 steps (0 resets) in 580 ms. (10 steps per ms) remains 0/12 properties
Computed a total of 240 stabilizing places and 240 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1063 transition count 942
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 962 transition count 841
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 861 transition count 841
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 859 transition count 839
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 408 place count 859 transition count 838
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 410 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 3 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1120 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 500 transition count 481
Applied a total of 1123 rules in 364 ms. Remains 500 /1064 variables (removed 564) and now considering 481/1044 (removed 563) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 11:37:17] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 11:37:17] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-28 11:37:17] [INFO ] Invariant cache hit.
[2024-05-28 11:37:18] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-28 11:37:19] [INFO ] Redundant transitions in 533 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 11:37:19] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:37:24] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 18 ms to minimize.
[2024-05-28 11:37:24] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 2 ms to minimize.
[2024-05-28 11:37:24] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 4 ms to minimize.
[2024-05-28 11:37:24] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 4 ms to minimize.
[2024-05-28 11:37:24] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 2 ms to minimize.
[2024-05-28 11:37:24] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 12 ms to minimize.
[2024-05-28 11:37:25] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 5 ms to minimize.
[2024-05-28 11:37:25] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 5 ms to minimize.
[2024-05-28 11:37:25] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 11:37:25] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 4 ms to minimize.
[2024-05-28 11:37:25] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-28 11:37:25] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2024-05-28 11:37:26] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:37:26] [INFO ] Deduced a trap composed of 10 places in 548 ms of which 1 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 10 places in 538 ms of which 1 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 5 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 3 ms to minimize.
[2024-05-28 11:37:30] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:37:30] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:37:30] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:37:30] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:37:30] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:37:30] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:37:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:37:31] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:37:31] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:37:31] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:37:32] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:37:32] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 11 ms to minimize.
[2024-05-28 11:37:32] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-05-28 11:37:32] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:37:32] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 11:37:32] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-28 11:37:33] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 11:37:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 8 ms to minimize.
[2024-05-28 11:37:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:37:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:37:34] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:37:34] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:37:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:37:39] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:37:39] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:37:40] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:37:41] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:37:42] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:37:42] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:37:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:37:42] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:37:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:37:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:37:43] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:37:43] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:37:43] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:37:43] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:37:44] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:37:44] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:37:44] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:37:44] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-28 11:37:45] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/980 variables, and 267 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:37:50] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:37:50] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:37:51] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-28 11:37:51] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/980 variables, 500/771 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 479/1250 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:38:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:38:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:38:10] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:38:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:38:14] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1256 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 97/97 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1064 places, 480/1044 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62774 ms. Remains : 500/1064 places, 480/1044 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-02
Product exploration explored 100000 steps with 96 reset in 879 ms.
Product exploration explored 100000 steps with 95 reset in 641 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 140 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 33 ms :[(NOT p0)]
RANDOM walk for 1081 steps (0 resets) in 28 ms. (37 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 86 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:38:21] [INFO ] Invariant cache hit.
[2024-05-28 11:38:22] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-28 11:38:22] [INFO ] Invariant cache hit.
[2024-05-28 11:38:22] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2024-05-28 11:38:22] [INFO ] Redundant transitions in 79 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:38:27] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:38:28] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:38:29] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:38:30] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:31] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:38:31] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:38:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:38:31] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:38:31] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 11:38:31] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:38:32] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:38:32] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:38:32] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:38:32] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:38:32] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:38:33] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:38:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:38:33] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:38:33] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 11:38:33] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 11:38:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:38:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:38:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:38:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:38] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:38:39] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:38:39] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:38:39] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:38:40] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-28 11:38:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:38:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:38:41] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:38:41] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:38:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:38:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:38:43] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:38:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:38:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:38:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:38:44] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:38:44] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:38:45] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:38:45] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-28 11:38:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:38:48] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
SMT process timed out in 30120ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31429 ms. Remains : 500/500 places, 480/480 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 246 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 37 ms :[(NOT p0)]
RANDOM walk for 995 steps (0 resets) in 14 ms. (66 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 98 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 95 reset in 488 ms.
Product exploration explored 100000 steps with 95 reset in 578 ms.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:38:54] [INFO ] Invariant cache hit.
[2024-05-28 11:38:54] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-28 11:38:54] [INFO ] Invariant cache hit.
[2024-05-28 11:38:55] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2024-05-28 11:38:55] [INFO ] Redundant transitions in 58 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:38:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:38:59] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:39:00] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:39:01] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:39:02] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:39:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:39:03] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:39:03] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:39:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:39:03] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:39:03] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:39:04] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:39:04] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:39:04] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:39:04] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:39:04] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:39:05] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:39:05] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:39:05] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
[2024-05-28 11:39:05] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:39:05] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:39:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:39:06] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:39:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:39:07] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:39:11] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:39:11] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:39:11] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:39:11] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:39:12] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:39:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:39:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:39:13] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 5 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:39:14] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:39:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:39:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:39:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:39:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:39:15] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:39:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:39:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:39:16] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:39:17] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:39:17] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:39:17] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-28 11:39:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:39:20] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 479 unsolved
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30888 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-02 finished in 129092 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 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 41 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-05-28 11:39:25] [INFO ] Computed 181 invariants in 13 ms
[2024-05-28 11:39:26] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 11:39:26] [INFO ] Invariant cache hit.
[2024-05-28 11:39:27] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:39:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 181 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:40:12] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:40:12] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:40:13] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:40:13] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:40:13] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 3 ms to minimize.
[2024-05-28 11:40:14] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 3 ms to minimize.
[2024-05-28 11:40:15] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:40:15] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-28 11:40:16] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 4 ms to minimize.
[2024-05-28 11:40:16] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
[2024-05-28 11:40:16] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 4 ms to minimize.
[2024-05-28 11:40:17] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-05-28 11:40:18] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 4 ms to minimize.
[2024-05-28 11:40:18] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 4 ms to minimize.
[2024-05-28 11:40:19] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 5 ms to minimize.
[2024-05-28 11:40:19] [INFO ] Deduced a trap composed of 51 places in 246 ms of which 4 ms to minimize.
[2024-05-28 11:40:20] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 5 ms to minimize.
[2024-05-28 11:40:20] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:40:22] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:40:24] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:40:24] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:40:26] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 6 ms to minimize.
[2024-05-28 11:40:27] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 5 ms to minimize.
[2024-05-28 11:40:27] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 5 ms to minimize.
SMT process timed out in 60415ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61798 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-04 finished in 62616 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)&&X(X(p1)))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 50 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
[2024-05-28 11:40:28] [INFO ] Invariant cache hit.
[2024-05-28 11:40:28] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-28 11:40:28] [INFO ] Invariant cache hit.
[2024-05-28 11:40:29] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:40:59] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:40:59] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 183 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:41:16] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:41:16] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:41:16] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:41:17] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 3 ms to minimize.
[2024-05-28 11:41:17] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 3 ms to minimize.
[2024-05-28 11:41:17] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-28 11:41:18] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 3 ms to minimize.
[2024-05-28 11:41:18] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 4 ms to minimize.
[2024-05-28 11:41:19] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-28 11:41:19] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 4 ms to minimize.
[2024-05-28 11:41:20] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 4 ms to minimize.
[2024-05-28 11:41:20] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 4 ms to minimize.
[2024-05-28 11:41:21] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 5 ms to minimize.
[2024-05-28 11:41:21] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 4 ms to minimize.
[2024-05-28 11:41:22] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 5 ms to minimize.
[2024-05-28 11:41:23] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 4 ms to minimize.
[2024-05-28 11:41:23] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 5 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 5 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:41:24] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:41:27] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1062/2104 variables, and 204 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 23/23 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61521 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-05
Product exploration explored 100000 steps with 920 reset in 284 ms.
Product exploration explored 100000 steps with 929 reset in 307 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
RANDOM walk for 5992 steps (0 resets) in 105 ms. (56 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
[2024-05-28 11:41:31] [INFO ] Invariant cache hit.
[2024-05-28 11:41:32] [INFO ] [Real]Absence check using 181 positive place invariants in 99 ms returned sat
[2024-05-28 11:41:34] [INFO ] [Real]Absence check using state equation in 2792 ms returned sat
[2024-05-28 11:41:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:41:35] [INFO ] [Nat]Absence check using 181 positive place invariants in 90 ms returned sat
[2024-05-28 11:41:37] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2024-05-28 11:41:37] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:41:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-28 11:41:37] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 84 ms.
[2024-05-28 11:41:50] [INFO ] Added : 550 causal constraints over 110 iterations in 12486 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 20 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-28 11:41:50] [INFO ] Invariant cache hit.
[2024-05-28 11:41:50] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-28 11:41:50] [INFO ] Invariant cache hit.
[2024-05-28 11:41:51] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Finished structural reductions in LTL mode , in 1 iterations and 31429 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
RANDOM walk for 6629 steps (0 resets) in 55 ms. (118 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
[2024-05-28 11:42:22] [INFO ] Invariant cache hit.
[2024-05-28 11:42:22] [INFO ] [Real]Absence check using 181 positive place invariants in 93 ms returned sat
[2024-05-28 11:42:25] [INFO ] [Real]Absence check using state equation in 2596 ms returned sat
[2024-05-28 11:42:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:42:26] [INFO ] [Nat]Absence check using 181 positive place invariants in 96 ms returned sat
[2024-05-28 11:42:27] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2024-05-28 11:42:27] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 5 ms to minimize.
[2024-05-28 11:42:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2024-05-28 11:42:28] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 56 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 887 reset in 289 ms.
Product exploration explored 100000 steps with 893 reset in 331 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 99 place count 1062 transition count 1044
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 140 place count 1062 transition count 1044
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 555 places in 1 ms
Iterating global reduction 1 with 415 rules applied. Total rules applied 555 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 693 place count 924 transition count 906
Deduced a syphon composed of 417 places in 1 ms
Iterating global reduction 1 with 138 rules applied. Total rules applied 831 place count 924 transition count 906
Deduced a syphon composed of 417 places in 0 ms
Applied a total of 831 rules in 341 ms. Remains 924 /1062 variables (removed 138) and now considering 906/1042 (removed 136) transitions.
[2024-05-28 11:42:42] [INFO ] Redundant transitions in 74 ms returned [905]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 904 sub problems to find dead transitions.
// Phase 1: matrix 905 rows 924 cols
[2024-05-28 11:42:42] [INFO ] Computed 181 invariants in 17 ms
[2024-05-28 11:42:42] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/923 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (OVERLAPS) 1/924 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 904 unsolved
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 11:43:05] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 11:43:06] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-28 11:43:07] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-28 11:43:07] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-28 11:43:07] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-28 11:43:07] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD872 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 20/201 constraints. Problems are: Problem set: 92 solved, 812 unsolved
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-28 11:43:08] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-28 11:43:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-28 11:43:10] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD736 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 20/221 constraints. Problems are: Problem set: 167 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 924/1829 variables, and 221 constraints, problems are : Problem set: 167 solved, 737 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/924 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 167 solved, 737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/756 variables, 0/0 constraints. Problems are: Problem set: 167 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 168/924 variables, 181/181 constraints. Problems are: Problem set: 167 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 40/221 constraints. Problems are: Problem set: 167 solved, 737 unsolved
[2024-05-28 11:43:21] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-05-28 11:43:21] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 21 ms to minimize.
Problem TDEAD123 is UNSAT
[2024-05-28 11:43:21] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-05-28 11:43:21] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD132 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD162 is UNSAT
[2024-05-28 11:43:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
[2024-05-28 11:43:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-05-28 11:43:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-05-28 11:43:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-28 11:43:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 20/241 constraints. Problems are: Problem set: 239 solved, 665 unsolved
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD181 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD189 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
[2024-05-28 11:43:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD194 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
Problem TDEAD202 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-05-28 11:43:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
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 TDEAD184 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 TDEAD191 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 TDEAD199 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 TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 20/261 constraints. Problems are: Problem set: 279 solved, 625 unsolved
[2024-05-28 11:43:28] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-05-28 11:43:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
[2024-05-28 11:43:28] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-05-28 11:43:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
[2024-05-28 11:43:28] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-05-28 11:43:28] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD239 is UNSAT
[2024-05-28 11:43:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
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 TDEAD214 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 TDEAD221 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 TDEAD229 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 TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/924 variables, 20/281 constraints. Problems are: Problem set: 319 solved, 585 unsolved
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD250 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD251 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD253 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD258 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
Problem TDEAD263 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
Problem TDEAD264 is UNSAT
[2024-05-28 11:43:32] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD265 is UNSAT
[2024-05-28 11:43:33] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
[2024-05-28 11:43:33] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD269 is UNSAT
[2024-05-28 11:43:33] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
[2024-05-28 11:43:33] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 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
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 20/301 constraints. Problems are: Problem set: 361 solved, 543 unsolved
[2024-05-28 11:43:35] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
[2024-05-28 11:43:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
[2024-05-28 11:43:35] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
Problem TDEAD276 is UNSAT
[2024-05-28 11:43:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
[2024-05-28 11:43:35] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
[2024-05-28 11:43:35] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
Problem TDEAD282 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Problem TDEAD286 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
Problem TDEAD287 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
Problem TDEAD292 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD300 is UNSAT
[2024-05-28 11:43:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 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 TDEAD291 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 TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD901 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/924 variables, 20/321 constraints. Problems are: Problem set: 399 solved, 505 unsolved
[2024-05-28 11:43:40] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD369 is UNSAT
[2024-05-28 11:43:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
Problem TDEAD396 is UNSAT
[2024-05-28 11:43:40] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD423 is UNSAT
[2024-05-28 11:43:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Problem TDEAD450 is UNSAT
[2024-05-28 11:43:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD476 is UNSAT
[2024-05-28 11:43:41] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 4 ms to minimize.
[2024-05-28 11:43:41] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-28 11:43:41] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD504 is UNSAT
[2024-05-28 11:43:42] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-28 11:43:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:43:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
SMT process timed out in 60298ms, After SMT, problems are : Problem set: 399 solved, 505 unsolved
Search for dead transitions found 405 dead transitions in 60310ms
Found 405 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 405 transitions
Dead transitions reduction (with SMT) removed 405 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 924/1062 places, 500/1042 transitions.
Graph (complete) has 1792 edges and 924 vertex of which 521 are kept as prefixes of interest. Removing 403 places using SCC suffix rule.3 ms
Discarding 403 places :
Also discarding 0 output transitions
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 1 rules in 27 ms. Remains 521 /924 variables (removed 403) and now considering 500/500 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 521/1062 places, 500/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60764 ms. Remains : 521/1062 places, 500/1042 transitions.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 34 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-05-28 11:43:42] [INFO ] Computed 181 invariants in 4 ms
[2024-05-28 11:43:42] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-28 11:43:42] [INFO ] Invariant cache hit.
[2024-05-28 11:43:43] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:43:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:44:13] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1062/2104 variables, and 182 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (OVERLAPS) 1/1062 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1062 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:44:29] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:44:30] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:44:30] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:44:30] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:44:31] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 3 ms to minimize.
[2024-05-28 11:44:31] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 14 ms to minimize.
[2024-05-28 11:44:31] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-05-28 11:44:32] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 3 ms to minimize.
[2024-05-28 11:44:32] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-28 11:44:33] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-28 11:44:33] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 4 ms to minimize.
[2024-05-28 11:44:34] [INFO ] Deduced a trap composed of 95 places in 189 ms of which 4 ms to minimize.
[2024-05-28 11:44:34] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-28 11:44:35] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 3 ms to minimize.
[2024-05-28 11:44:35] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 4 ms to minimize.
[2024-05-28 11:44:36] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 4 ms to minimize.
[2024-05-28 11:44:36] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 5 ms to minimize.
[2024-05-28 11:44:37] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 5 ms to minimize.
[2024-05-28 11:44:37] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 5 ms to minimize.
[2024-05-28 11:44:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1062 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
[2024-05-28 11:44:40] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-28 11:44:41] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:44:41] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(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 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1062/2104 variables, and 205 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 0/1041 constraints, Known Traps: 24/24 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Finished structural reductions in LTL mode , in 1 iterations and 61483 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-05 finished in 255719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 37 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
[2024-05-28 11:44:44] [INFO ] Invariant cache hit.
[2024-05-28 11:44:44] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-28 11:44:44] [INFO ] Invariant cache hit.
[2024-05-28 11:44:45] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:44:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31473 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 417 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-06 finished in 31608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 25 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-05-28 11:45:15] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 11:45:15] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-28 11:45:15] [INFO ] Invariant cache hit.
[2024-05-28 11:45:16] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-28 11:45:16] [INFO ] Invariant cache hit.
(s159 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0timeout
)
(s160 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30218ms
Finished structural reductions in LTL mode , in 1 iterations and 31517 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-07 finished in 31646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 43 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2024-05-28 11:45:47] [INFO ] Computed 181 invariants in 7 ms
[2024-05-28 11:45:47] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-28 11:45:47] [INFO ] Invariant cache hit.
[2024-05-28 11:45:48] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:45:48] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31413 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 214 ms.
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-08 finished in 32040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&F(p2))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1062 transition count 1042
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1062 transition count 1042
Applied a total of 4 rules in 40 ms. Remains 1062 /1064 variables (removed 2) and now considering 1042/1044 (removed 2) transitions.
[2024-05-28 11:46:19] [INFO ] Invariant cache hit.
[2024-05-28 11:46:19] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-28 11:46:19] [INFO ] Invariant cache hit.
[2024-05-28 11:46:20] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Running 1041 sub problems to find dead transitions.
[2024-05-28 11:46:20] [INFO ] Invariant cache hit.
(s894 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1061 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 30190ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1064 places, 1042/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31410 ms. Remains : 1062/1064 places, 1042/1044 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11
Product exploration explored 100000 steps with 11494 reset in 158 ms.
Product exploration explored 100000 steps with 11766 reset in 177 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p2) p0)), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 180 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p2) p0)), (X p1), (X (X p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p2) p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 12 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p2)]
[2024-05-28 11:46:51] [INFO ] Invariant cache hit.
[2024-05-28 11:46:52] [INFO ] [Real]Absence check using 181 positive place invariants in 82 ms returned sat
[2024-05-28 11:46:55] [INFO ] [Real]Absence check using state equation in 2971 ms returned sat
[2024-05-28 11:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:46:55] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2024-05-28 11:46:57] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2024-05-28 11:46:57] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 54 ms.
[2024-05-28 11:47:06] [INFO ] Added : 419 causal constraints over 85 iterations in 9524 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 92 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2024-05-28 11:47:06] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 11:47:06] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-28 11:47:06] [INFO ] Invariant cache hit.
[2024-05-28 11:47:07] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-28 11:47:07] [INFO ] Redundant transitions in 73 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 481 sub problems to find dead transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:47:07] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:47:11] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:47:12] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:47:15] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:22] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:47:22] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:47:22] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:47:22] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 5 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-28 11:47:23] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:47:24] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 2 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:47:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:47:26] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:47:26] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:47:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:47:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:47:26] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:47:27] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:47:27] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:47:27] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:47:27] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:47:27] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:47:27] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-28 11:47:28] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-28 11:47:28] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:47:28] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:47:28] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:47:28] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
[2024-05-28 11:47:28] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 3 ms to minimize.
[2024-05-28 11:47:29] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:47:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:47:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:47:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:34] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:47:35] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:47:36] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:47:37] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:47:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:47:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:47:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/986 variables, and 251 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/190 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 61/251 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:41] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:47:41] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:47:42] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:47:42] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:47:42] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:47:43] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:47:45] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:47:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:47:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:47:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:47:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 17/268 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:47] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:47:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:47:47] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:47:47] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:47:48] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-28 11:47:48] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:47:48] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-28 11:47:48] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-28 11:47:49] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:47:49] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:47:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 11/279 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:53] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:47:53] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:47:53] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:47:53] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:47:54] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:47:54] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:47:54] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:47:58] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-28 11:47:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:47:59] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:48:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:48:02] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/986 variables, and 291 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 0/481 constraints, Known Traps: 111/111 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60985 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
[2024-05-28 11:48:08] [INFO ] Invariant cache hit.
[2024-05-28 11:48:08] [INFO ] [Real]Absence check using 180 positive place invariants in 61 ms returned sat
[2024-05-28 11:48:09] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2024-05-28 11:48:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:48:09] [INFO ] [Nat]Absence check using 180 positive place invariants in 37 ms returned sat
[2024-05-28 11:48:09] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-28 11:48:09] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 3 ms to minimize.
[2024-05-28 11:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-05-28 11:48:10] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 27 ms.
[2024-05-28 11:48:11] [INFO ] Added : 110 causal constraints over 24 iterations in 1317 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 27547 reset in 180 ms.
Product exploration explored 100000 steps with 27566 reset in 183 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 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 503 transition count 481
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 501 transition count 481
Applied a total of 4 rules in 12 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 11:48:11] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 11:48:12] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-28 11:48:12] [INFO ] Invariant cache hit.
[2024-05-28 11:48:12] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-05-28 11:48:12] [INFO ] Redundant transitions in 116 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:48:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:48:16] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:48:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:48:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:48:20] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:48:27] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:48:27] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:48:28] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:48:29] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:48:30] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:48:31] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:48:32] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:48:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:48:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:48:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:48:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:48:33] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:48:34] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:48:34] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:48:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:48:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:48:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:48:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:48:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:48:39] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:48:39] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:48:39] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:48:40] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-28 11:48:40] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:48:41] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:48:42] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:48:42] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:48:42] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:48:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:48:42] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:48:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31149 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 143744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1063 transition count 943
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 963 transition count 943
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 963 transition count 841
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 861 transition count 841
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 859 transition count 839
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 408 place count 859 transition count 838
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 410 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1120 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 500 transition count 481
Applied a total of 1123 rules in 197 ms. Remains 500 /1064 variables (removed 564) and now considering 481/1044 (removed 563) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 11:48:43] [INFO ] Computed 180 invariants in 16 ms
[2024-05-28 11:48:43] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-28 11:48:43] [INFO ] Invariant cache hit.
[2024-05-28 11:48:44] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2024-05-28 11:48:44] [INFO ] Redundant transitions in 75 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 11:48:44] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:48:48] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:48:49] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:48:50] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:48:51] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:48:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:48:52] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:48:52] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:48:52] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:48:52] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:48:53] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:48:53] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:48:53] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:48:53] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:48:53] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:48:53] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 11:48:54] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 11:48:55] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:48:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:48:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:48:56] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:48:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:48:59] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 4 ms to minimize.
[2024-05-28 11:49:00] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:49:00] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-05-28 11:49:00] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-28 11:49:00] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:49:01] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:49:01] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-05-28 11:49:01] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-28 11:49:01] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:49:01] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 3 ms to minimize.
[2024-05-28 11:49:03] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:49:03] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:49:03] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:49:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:49:03] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:49:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:49:04] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:49:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:49:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:49:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:49:08] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:49:08] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 4 ms to minimize.
[2024-05-28 11:49:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:49:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:49:09] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:49:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:49:09] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:49:10] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:49:10] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/980 variables, and 267 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 177/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 90/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:49:19] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:49:20] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-28 11:49:23] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:49:24] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (OVERLAPS) 480/980 variables, 500/774 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 478/1252 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:49:38] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:49:38] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:49:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:49:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:49:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:49:40] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:49:41] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:49:41] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:49:41] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:49:42] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:49:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:49:43] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:49:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:49:44] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1266 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 108/108 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1064 places, 480/1044 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61444 ms. Remains : 500/1064 places, 480/1044 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-14
Product exploration explored 100000 steps with 3390 reset in 420 ms.
Product exploration explored 100000 steps with 3294 reset in 514 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
[2024-05-28 11:49:46] [INFO ] Invariant cache hit.
[2024-05-28 11:49:46] [INFO ] [Real]Absence check using 180 positive place invariants in 44 ms returned sat
[2024-05-28 11:49:46] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2024-05-28 11:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:49:47] [INFO ] [Nat]Absence check using 180 positive place invariants in 68 ms returned sat
[2024-05-28 11:49:47] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2024-05-28 11:49:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-28 11:49:47] [INFO ] Computed and/alt/rep : 478/1191/478 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-28 11:49:55] [INFO ] Added : 478 causal constraints over 96 iterations in 7393 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:49:55] [INFO ] Invariant cache hit.
[2024-05-28 11:49:55] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-28 11:49:55] [INFO ] Invariant cache hit.
[2024-05-28 11:49:55] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2024-05-28 11:49:55] [INFO ] Redundant transitions in 51 ms returned []
Running 478 sub problems to find dead transitions.
[2024-05-28 11:49:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:49:59] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 11:49:59] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-28 11:49:59] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:49:59] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:50:00] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:50:01] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:50:02] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:50:03] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:50:03] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:50:03] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:03] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:50:03] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:50:03] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:50:04] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:50:04] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 11:50:04] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:50:04] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:50:04] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-28 11:50:04] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-28 11:50:05] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-28 11:50:05] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:50:05] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:50:05] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-28 11:50:05] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-05-28 11:50:06] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 11:50:06] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 11:50:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:50:07] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:50:07] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:50:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:10] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:50:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:50:11] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:50:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:50:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:50:13] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:50:13] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:50:14] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:50:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:50:14] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:50:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:50:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:50:14] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:50:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:50:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:50:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:50:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:50:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:50:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:50:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:50:16] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:50:16] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:50:17] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:21] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/980 variables, and 262 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 177/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 85/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:50:31] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:50:31] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:50:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/769 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 478/1247 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:50:47] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 9 ms to minimize.
[2024-05-28 11:50:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:50:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:50:52] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:50:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1252 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 94/94 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60880 ms. Remains : 500/500 places, 480/480 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-05-28 11:50:56] [INFO ] Invariant cache hit.
[2024-05-28 11:50:56] [INFO ] [Real]Absence check using 180 positive place invariants in 47 ms returned sat
[2024-05-28 11:50:57] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2024-05-28 11:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:50:57] [INFO ] [Nat]Absence check using 180 positive place invariants in 49 ms returned sat
[2024-05-28 11:50:58] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2024-05-28 11:50:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-28 11:50:58] [INFO ] Computed and/alt/rep : 478/1191/478 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-28 11:51:05] [INFO ] Added : 478 causal constraints over 96 iterations in 7185 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3452 reset in 424 ms.
Product exploration explored 100000 steps with 3365 reset in 511 ms.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:51:06] [INFO ] Invariant cache hit.
[2024-05-28 11:51:06] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-28 11:51:06] [INFO ] Invariant cache hit.
[2024-05-28 11:51:07] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-28 11:51:07] [INFO ] Redundant transitions in 43 ms returned []
Running 478 sub problems to find dead transitions.
[2024-05-28 11:51:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:10] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-28 11:51:11] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:51:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:51:13] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:51:14] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:51:14] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:51:14] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:51:14] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 11:51:14] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:14] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:51:15] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:51:16] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:51:16] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:51:16] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:51:16] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:51:16] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:51:17] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 11:51:17] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:51:17] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-28 11:51:17] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-28 11:51:18] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:51:18] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:51:18] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:51:18] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:51:22] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:51:22] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:51:24] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:51:24] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:51:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:51:25] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:51:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:51:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:51:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:51:25] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:51:26] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:51:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:51:26] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:51:26] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:51:26] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:51:26] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:51:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 18/255 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:51:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:51:27] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:51:28] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:51:28] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:51:28] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:32] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/980 variables, and 262 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 177/180 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 85/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 1/500 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:41] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:51:42] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:51:43] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-28 11:51:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/769 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 478/1247 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:51:58] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:52:02] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:52:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 11:52:03] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:52:05] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1252 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 94/94 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60914 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-14 finished in 204343 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)))'
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)&&X(X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&F(p2))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLCardinality-11
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1063 transition count 944
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 964 transition count 944
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 964 transition count 843
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 863 transition count 843
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 402 place count 861 transition count 841
Iterating global reduction 2 with 2 rules applied. Total rules applied 404 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 404 place count 861 transition count 840
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 406 place count 860 transition count 840
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1114 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1116 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1117 place count 503 transition count 484
Applied a total of 1117 rules in 100 ms. Remains 503 /1064 variables (removed 561) and now considering 484/1044 (removed 560) transitions.
// Phase 1: matrix 484 rows 503 cols
[2024-05-28 11:52:07] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 11:52:08] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-28 11:52:08] [INFO ] Invariant cache hit.
[2024-05-28 11:52:08] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:52:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:52:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:52:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:52:13] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:52:15] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:52:15] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/186 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-28 11:52:23] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:52:24] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:52:25] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 6 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:52:26] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:27] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:52:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:52:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:52:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:52:28] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-28 11:52:29] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2024-05-28 11:52:29] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:52:29] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-28 11:52:29] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:52:29] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:52:29] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-05-28 11:52:30] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 11:52:30] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/246 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:33] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:52:34] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:52:34] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-28 11:52:35] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:52:35] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:52:35] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:52:36] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:52:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:52:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:52:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:52:37] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 4 ms to minimize.
[2024-05-28 11:52:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:52:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:52:38] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:52:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:52:38] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/987 variables, and 262 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 68/262 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:42] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:52:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:52:43] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-05-28 11:52:44] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:52:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:52:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 15/277 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:48] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:52:48] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:52:48] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:52:48] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:52:49] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:52] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:52:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:52:52] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:52:53] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:52:53] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:52:53] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:52:53] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 7/289 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:52:58] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:52:59] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:53:02] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:53:02] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:53:06] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:53:06] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/987 variables, and 295 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 0/482 constraints, Known Traps: 115/115 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LI_LTL mode, iteration 1 : 503/1064 places, 484/1044 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60957 ms. Remains : 503/1064 places, 484/1044 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11
Product exploration explored 100000 steps with 27616 reset in 180 ms.
Product exploration explored 100000 steps with 27554 reset in 181 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/484 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 385 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F p2)]
Knowledge based reduction with 8 factoid took 393 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
[2024-05-28 11:53:10] [INFO ] Invariant cache hit.
[2024-05-28 11:53:10] [INFO ] [Real]Absence check using 180 positive place invariants in 60 ms returned sat
[2024-05-28 11:53:10] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2024-05-28 11:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:53:11] [INFO ] [Nat]Absence check using 180 positive place invariants in 57 ms returned sat
[2024-05-28 11:53:11] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-28 11:53:11] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-05-28 11:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-05-28 11:53:11] [INFO ] Computed and/alt/rep : 447/1491/447 causal constraints (skipped 35 transitions) in 38 ms.
[2024-05-28 11:53:12] [INFO ] Added : 110 causal constraints over 22 iterations in 955 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2024-05-28 11:53:12] [INFO ] Invariant cache hit.
[2024-05-28 11:53:12] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-28 11:53:12] [INFO ] Invariant cache hit.
[2024-05-28 11:53:13] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-05-28 11:53:13] [INFO ] Redundant transitions in 61 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 481 sub problems to find dead transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:53:13] [INFO ] Computed 180 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:53:17] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:53:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:53:20] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:27] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-05-28 11:53:27] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:53:28] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:53:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:53:30] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:53:31] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:53:31] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:53:31] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:53:31] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:53:31] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:53:31] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:53:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:53:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:53:32] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:53:32] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:53:32] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:53:33] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:53:33] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-28 11:53:33] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:53:33] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-28 11:53:33] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-28 11:53:34] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-05-28 11:53:34] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-28 11:53:34] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-05-28 11:53:34] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-28 11:53:34] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-28 11:53:34] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-28 11:53:35] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:53:36] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:53:36] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:40] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:53:40] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:53:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:53:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:53:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:53:43] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:53:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:53:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/986 variables, and 252 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (OVERLAPS) 1/503 variables, 163/190 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 62/252 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:53:47] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:53:47] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-28 11:53:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:53:48] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:53:48] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:53:49] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-05-28 11:53:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:53:51] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:53:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:53:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:53:51] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:53:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:53:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:53:52] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:53:52] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:53:52] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 17/269 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:53] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:53:53] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-28 11:53:53] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:53:53] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:53:53] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:53:54] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2024-05-28 11:53:54] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 2 ms to minimize.
[2024-05-28 11:53:54] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:53:58] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:53:58] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:53:59] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 481 unsolved
[2024-05-28 11:54:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 10 (OVERLAPS) 483/986 variables, 503/784 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/986 variables, 481/1265 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1265 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 101/101 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 483/484 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60987 ms. Remains : 503/503 places, 483/484 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
[2024-05-28 11:54:14] [INFO ] Invariant cache hit.
[2024-05-28 11:54:14] [INFO ] [Real]Absence check using 180 positive place invariants in 61 ms returned sat
[2024-05-28 11:54:14] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-05-28 11:54:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:54:15] [INFO ] [Nat]Absence check using 180 positive place invariants in 35 ms returned sat
[2024-05-28 11:54:15] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-28 11:54:15] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 3 ms to minimize.
[2024-05-28 11:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-28 11:54:15] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 25 ms.
[2024-05-28 11:54:16] [INFO ] Added : 110 causal constraints over 24 iterations in 986 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 27347 reset in 159 ms.
Product exploration explored 100000 steps with 27461 reset in 174 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 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 503 transition count 481
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 501 transition count 481
Applied a total of 4 rules in 10 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 11:54:16] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 11:54:17] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-28 11:54:17] [INFO ] Invariant cache hit.
[2024-05-28 11:54:17] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-28 11:54:17] [INFO ] Redundant transitions in 43 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:21] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:54:22] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:54:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:54:24] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:31] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-28 11:54:32] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:33] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:54:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-28 11:54:35] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-28 11:54:36] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:54:37] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:54:38] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:54:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:54:38] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:54:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:54:39] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:54:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:54:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:54:43] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:54:43] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:54:43] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:54:44] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:54:44] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:54:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:54:46] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:54:46] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:54:46] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:54:46] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:54:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:54:46] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:54:47] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:54:47] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:54:47] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:54:47] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:54:47] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:54:47] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/982 variables, and 264 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (OVERLAPS) 1/501 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 70/264 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:52] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:54:52] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:54:52] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:54:52] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:54:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:54:52] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-28 11:54:53] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:54:53] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-28 11:54:56] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:54:56] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:54:56] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:54:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:54:56] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:54:57] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 5 ms to minimize.
[2024-05-28 11:54:57] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:54:57] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:55:01] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-28 11:55:01] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:55:02] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:55:02] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:55:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:55:06] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:55:06] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:55:06] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:55:06] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 5/289 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:55:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:55:10] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:55:10] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:55:15] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:55:15] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/982 variables, and 294 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/479 constraints, Known Traps: 114/114 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60874 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 190291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 11:55:18] [INFO ] Flatten gal took : 103 ms
[2024-05-28 11:55:18] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 11:55:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1064 places, 1044 transitions and 3288 arcs took 28 ms.
Total runtime 1115830 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPs-PT-020B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1064
TRANSITIONS: 1044
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.000s]
SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 5705
MODEL NAME: /home/mcc/execution/405/model
1064 places, 1044 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-020B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758000107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;