About the Execution of LTSMin+red for Sudoku-COL-AN13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2441.716 | 3600000.00 | 10956737.00 | 3420.60 | FTFTFF?T??FF??FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706300099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-COL-AN13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300099
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 09:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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 Sudoku-COL-AN13-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679188019800
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 01:07:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 01:07:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:07:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-19 01:07:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 01:07:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2023-03-19 01:07:01] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 01:07:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2023-03-19 01:07:02] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10088 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=388 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 12 ms. (steps per millisecond=840 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=1120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=1441 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-19 01:07:02] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-19 01:07:02] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 01:07:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 01:07:02] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 01:07:02] [INFO ] Flatten gal took : 11 ms
[2023-03-19 01:07:02] [INFO ] Flatten gal took : 1 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2023-03-19 01:07:02] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 39 ms.
[2023-03-19 01:07:02] [INFO ] Unfolded 13 HLPN properties in 4 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:07:02] [INFO ] Computed 507 place invariants in 38 ms
[2023-03-19 01:07:03] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 01:07:03] [INFO ] Invariant cache hit.
[2023-03-19 01:07:04] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2023-03-19 01:07:04] [INFO ] Invariant cache hit.
[2023-03-19 01:07:06] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3527 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2023-03-19 01:07:06] [INFO ] Flatten gal took : 253 ms
[2023-03-19 01:07:07] [INFO ] Flatten gal took : 170 ms
[2023-03-19 01:07:07] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 3146 ms. (steps per millisecond=3 ) properties (out of 17) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 01:07:13] [INFO ] Invariant cache hit.
[2023-03-19 01:07:15] [INFO ] [Real]Absence check using 507 positive place invariants in 139 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:07:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:07:39] [INFO ] After 25043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2972 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 766 ms. (steps per millisecond=13 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Probabilistic random walk after 123025 steps, saw 122935 distinct states, run finished after 15059 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-19 01:07:59] [INFO ] Invariant cache hit.
[2023-03-19 01:08:01] [INFO ] [Real]Absence check using 507 positive place invariants in 130 ms returned sat
[2023-03-19 01:08:25] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 01:08:26] [INFO ] [Nat]Absence check using 507 positive place invariants in 153 ms returned sat
[2023-03-19 01:08:32] [INFO ] After 2284ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-19 01:08:34] [INFO ] After 3855ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 886 ms.
[2023-03-19 01:08:34] [INFO ] After 9754ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 10 properties in 33 ms. (steps per millisecond=5 )
Parikh walk visited 10 properties in 34 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN13-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 83 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:08:35] [INFO ] Computed 38 place invariants in 143 ms
[2023-03-19 01:08:35] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-19 01:08:35] [INFO ] Invariant cache hit.
[2023-03-19 01:08:37] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
[2023-03-19 01:08:37] [INFO ] Invariant cache hit.
[2023-03-19 01:08:38] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3119 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-00 finished in 3395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 142 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:08:38] [INFO ] Computed 507 place invariants in 19 ms
[2023-03-19 01:08:40] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2023-03-19 01:08:40] [INFO ] Invariant cache hit.
[2023-03-19 01:08:43] [INFO ] Implicit Places using invariants and state equation in 3270 ms returned []
Implicit Place search using SMT with State Equation took 4592 ms to find 0 implicit places.
[2023-03-19 01:08:43] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-19 01:08:43] [INFO ] Invariant cache hit.
[2023-03-19 01:08:45] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6342 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 51 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-02 finished in 6503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 35 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:08:45] [INFO ] Computed 38 place invariants in 107 ms
[2023-03-19 01:08:45] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-19 01:08:45] [INFO ] Invariant cache hit.
[2023-03-19 01:08:47] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2023-03-19 01:08:47] [INFO ] Invariant cache hit.
[2023-03-19 01:08:48] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2876 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 1 (ADD s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 61840 steps with 417 reset in 10001 ms.
Product exploration timeout after 63650 steps with 429 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1715 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 244133 steps, run timeout after 6001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 244133 steps, saw 220399 distinct states, run finished after 6002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:09:16] [INFO ] Invariant cache hit.
[2023-03-19 01:09:17] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-19 01:09:18] [INFO ] After 1333ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 01:09:18] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-19 01:09:19] [INFO ] After 1547ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 01:09:20] [INFO ] After 1653ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 01:09:20] [INFO ] After 1828ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-03 finished in 35139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(p1)))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 16 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:09:20] [INFO ] Computed 507 place invariants in 11 ms
[2023-03-19 01:09:21] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-19 01:09:21] [INFO ] Invariant cache hit.
[2023-03-19 01:09:23] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 2933 ms to find 0 implicit places.
[2023-03-19 01:09:23] [INFO ] Invariant cache hit.
[2023-03-19 01:09:24] [INFO ] Dead Transitions using invariants and state equation in 1277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4237 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-05 finished in 4487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:09:24] [INFO ] Invariant cache hit.
[2023-03-19 01:09:25] [INFO ] Implicit Places using invariants in 1070 ms returned []
[2023-03-19 01:09:25] [INFO ] Invariant cache hit.
[2023-03-19 01:09:28] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 3926 ms to find 0 implicit places.
[2023-03-19 01:09:28] [INFO ] Invariant cache hit.
[2023-03-19 01:09:30] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5314 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 33190 steps with 381 reset in 10001 ms.
Product exploration timeout after 32590 steps with 374 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1763 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:09:54] [INFO ] Invariant cache hit.
[2023-03-19 01:09:55] [INFO ] [Real]Absence check using 507 positive place invariants in 143 ms returned sat
[2023-03-19 01:10:19] [INFO ] After 25010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:10:20] [INFO ] [Nat]Absence check using 507 positive place invariants in 132 ms returned sat
[2023-03-19 01:10:38] [INFO ] After 18972ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.11 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1510 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217243 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217243 steps, saw 215184 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:10:43] [INFO ] Computed 38 place invariants in 48 ms
[2023-03-19 01:10:43] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-19 01:10:46] [INFO ] After 3044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:10:46] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 33 ms returned sat
[2023-03-19 01:10:52] [INFO ] After 6146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:10:52] [INFO ] After 6226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 01:10:52] [INFO ] After 6435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 391 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:10:54] [INFO ] Computed 507 place invariants in 14 ms
Could not prove EG (NOT p1)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:11:09] [INFO ] Invariant cache hit.
[2023-03-19 01:11:10] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2023-03-19 01:11:10] [INFO ] Invariant cache hit.
[2023-03-19 01:11:13] [INFO ] Implicit Places using invariants and state equation in 2761 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
[2023-03-19 01:11:13] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-19 01:11:13] [INFO ] Invariant cache hit.
[2023-03-19 01:11:14] [INFO ] Dead Transitions using invariants and state equation in 1485 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5553 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
[2023-03-19 01:11:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 26240 steps with 298 reset in 10003 ms.
Product exploration timeout after 25870 steps with 293 reset in 10002 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:11:52] [INFO ] Invariant cache hit.
[2023-03-19 01:11:53] [INFO ] Implicit Places using invariants in 1181 ms returned []
[2023-03-19 01:11:53] [INFO ] Invariant cache hit.
[2023-03-19 01:11:56] [INFO ] Implicit Places using invariants and state equation in 2723 ms returned []
Implicit Place search using SMT with State Equation took 3939 ms to find 0 implicit places.
[2023-03-19 01:11:56] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-19 01:11:56] [INFO ] Invariant cache hit.
[2023-03-19 01:11:57] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5559 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-06 finished in 153249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0||X(((G(F(p1)) U p2) U (!p0&&(G(F(p1)) U p2)))))))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 18 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:11:58] [INFO ] Invariant cache hit.
[2023-03-19 01:11:58] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-19 01:11:58] [INFO ] Invariant cache hit.
[2023-03-19 01:12:00] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
[2023-03-19 01:12:00] [INFO ] Invariant cache hit.
[2023-03-19 01:12:02] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4279 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 128 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s2557 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 32880 steps with 10960 reset in 10002 ms.
Product exploration timeout after 32880 steps with 10960 reset in 10005 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1522 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 210057 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 210057 steps, saw 209877 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:12:28] [INFO ] Invariant cache hit.
[2023-03-19 01:12:28] [INFO ] [Real]Absence check using 507 positive place invariants in 148 ms returned sat
[2023-03-19 01:12:53] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.2 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 163 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1644 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217210 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217210 steps, saw 215176 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:12:58] [INFO ] Computed 38 place invariants in 57 ms
[2023-03-19 01:12:58] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-19 01:12:59] [INFO ] After 1841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:13:00] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 38 ms returned sat
[2023-03-19 01:13:02] [INFO ] After 2292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:13:02] [INFO ] After 2365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-19 01:13:02] [INFO ] After 2522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:13:02] [INFO ] Computed 507 place invariants in 9 ms
[2023-03-19 01:13:03] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-19 01:13:03] [INFO ] Invariant cache hit.
[2023-03-19 01:13:05] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 2962 ms to find 0 implicit places.
[2023-03-19 01:13:05] [INFO ] Invariant cache hit.
[2023-03-19 01:13:07] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4373 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1592 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203995 steps, run timeout after 3002 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203995 steps, saw 203831 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:13:12] [INFO ] Invariant cache hit.
[2023-03-19 01:13:13] [INFO ] [Real]Absence check using 507 positive place invariants in 138 ms returned sat
[2023-03-19 01:13:37] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.4 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 53 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1585 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211793 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211793 steps, saw 211603 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:13:42] [INFO ] Computed 38 place invariants in 52 ms
[2023-03-19 01:13:42] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-19 01:13:44] [INFO ] After 1827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:13:44] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-19 01:13:46] [INFO ] After 2260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:13:46] [INFO ] After 2354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-19 01:13:47] [INFO ] After 2552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0]
Product exploration timeout after 31710 steps with 10570 reset in 10003 ms.
Product exploration timeout after 31710 steps with 10570 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 128 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:14:07] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-19 01:14:07] [INFO ] Invariant cache hit.
[2023-03-19 01:14:08] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1160 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 61 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:14:08] [INFO ] Invariant cache hit.
[2023-03-19 01:14:09] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-19 01:14:09] [INFO ] Invariant cache hit.
[2023-03-19 01:14:11] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2377 ms to find 0 implicit places.
[2023-03-19 01:14:11] [INFO ] Invariant cache hit.
[2023-03-19 01:14:12] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3457 ms. Remains : 507/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-08 finished in 134809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 61 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:14:12] [INFO ] Computed 507 place invariants in 8 ms
[2023-03-19 01:14:14] [INFO ] Implicit Places using invariants in 1463 ms returned []
[2023-03-19 01:14:14] [INFO ] Invariant cache hit.
[2023-03-19 01:14:17] [INFO ] Implicit Places using invariants and state equation in 3318 ms returned []
Implicit Place search using SMT with State Equation took 4811 ms to find 0 implicit places.
[2023-03-19 01:14:17] [INFO ] Invariant cache hit.
[2023-03-19 01:14:19] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6273 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 27310 steps with 6827 reset in 10003 ms.
Product exploration timeout after 27250 steps with 6812 reset in 10004 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 01:14:41] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:14:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:14:57] [INFO ] Invariant cache hit.
[2023-03-19 01:14:58] [INFO ] Implicit Places using invariants in 1806 ms returned []
[2023-03-19 01:14:58] [INFO ] Invariant cache hit.
[2023-03-19 01:15:02] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 5130 ms to find 0 implicit places.
[2023-03-19 01:15:02] [INFO ] Invariant cache hit.
[2023-03-19 01:15:03] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6541 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 01:15:05] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:15:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 27420 steps with 6855 reset in 10003 ms.
Product exploration timeout after 27310 steps with 6827 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 47 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:15:41] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 01:15:41] [INFO ] Invariant cache hit.
[2023-03-19 01:15:42] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1513 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 45 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:15:42] [INFO ] Invariant cache hit.
[2023-03-19 01:15:44] [INFO ] Implicit Places using invariants in 1337 ms returned []
[2023-03-19 01:15:44] [INFO ] Invariant cache hit.
[2023-03-19 01:15:47] [INFO ] Implicit Places using invariants and state equation in 3346 ms returned []
Implicit Place search using SMT with State Equation took 4707 ms to find 0 implicit places.
[2023-03-19 01:15:47] [INFO ] Invariant cache hit.
[2023-03-19 01:15:49] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6149 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-09 finished in 96490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:15:49] [INFO ] Invariant cache hit.
[2023-03-19 01:15:50] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2023-03-19 01:15:50] [INFO ] Invariant cache hit.
[2023-03-19 01:15:53] [INFO ] Implicit Places using invariants and state equation in 2822 ms returned []
Implicit Place search using SMT with State Equation took 4000 ms to find 0 implicit places.
[2023-03-19 01:15:53] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-19 01:15:53] [INFO ] Invariant cache hit.
[2023-03-19 01:15:54] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5466 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 40 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-11 finished in 5579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:15:54] [INFO ] Invariant cache hit.
[2023-03-19 01:15:56] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2023-03-19 01:15:56] [INFO ] Invariant cache hit.
[2023-03-19 01:15:58] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
[2023-03-19 01:15:58] [INFO ] Invariant cache hit.
[2023-03-19 01:16:00] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5473 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 34700 steps with 403 reset in 10001 ms.
Product exploration timeout after 34570 steps with 401 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-19 01:16:22] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:16:37] [INFO ] Invariant cache hit.
[2023-03-19 01:16:38] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2023-03-19 01:16:38] [INFO ] Invariant cache hit.
[2023-03-19 01:16:41] [INFO ] Implicit Places using invariants and state equation in 2818 ms returned []
Implicit Place search using SMT with State Equation took 3879 ms to find 0 implicit places.
[2023-03-19 01:16:41] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 01:16:41] [INFO ] Invariant cache hit.
[2023-03-19 01:16:42] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5395 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 38 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-19 01:16:44] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration timeout after 34590 steps with 402 reset in 10002 ms.
Product exploration timeout after 34550 steps with 401 reset in 10001 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:17:19] [INFO ] Invariant cache hit.
[2023-03-19 01:17:20] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2023-03-19 01:17:20] [INFO ] Invariant cache hit.
[2023-03-19 01:17:23] [INFO ] Implicit Places using invariants and state equation in 2832 ms returned []
Implicit Place search using SMT with State Equation took 3901 ms to find 0 implicit places.
[2023-03-19 01:17:23] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 01:17:23] [INFO ] Invariant cache hit.
[2023-03-19 01:17:25] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5364 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 90488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 54 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:17:25] [INFO ] Invariant cache hit.
[2023-03-19 01:17:26] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2023-03-19 01:17:26] [INFO ] Invariant cache hit.
[2023-03-19 01:17:30] [INFO ] Implicit Places using invariants and state equation in 3321 ms returned []
Implicit Place search using SMT with State Equation took 4681 ms to find 0 implicit places.
[2023-03-19 01:17:30] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 01:17:30] [INFO ] Invariant cache hit.
[2023-03-19 01:17:31] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6251 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 40620 steps with 274 reset in 10004 ms.
Product exploration timeout after 40370 steps with 272 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-19 01:17:53] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:18:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 45 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:18:09] [INFO ] Invariant cache hit.
[2023-03-19 01:18:10] [INFO ] Implicit Places using invariants in 1303 ms returned []
[2023-03-19 01:18:10] [INFO ] Invariant cache hit.
[2023-03-19 01:18:14] [INFO ] Implicit Places using invariants and state equation in 3300 ms returned []
Implicit Place search using SMT with State Equation took 4633 ms to find 0 implicit places.
[2023-03-19 01:18:14] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-19 01:18:14] [INFO ] Invariant cache hit.
[2023-03-19 01:18:15] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6116 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 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 34 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 200 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 77 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
[2023-03-19 01:18:17] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:18:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration timeout after 40800 steps with 275 reset in 10005 ms.
Product exploration timeout after 40540 steps with 273 reset in 10001 ms.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 55 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:18:53] [INFO ] Invariant cache hit.
[2023-03-19 01:18:54] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2023-03-19 01:18:54] [INFO ] Invariant cache hit.
[2023-03-19 01:18:57] [INFO ] Implicit Places using invariants and state equation in 3264 ms returned []
Implicit Place search using SMT with State Equation took 4633 ms to find 0 implicit places.
[2023-03-19 01:18:58] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 01:18:58] [INFO ] Invariant cache hit.
[2023-03-19 01:18:59] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6141 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-13 finished in 94180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!p0))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:18:59] [INFO ] Invariant cache hit.
[2023-03-19 01:19:00] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2023-03-19 01:19:00] [INFO ] Invariant cache hit.
[2023-03-19 01:19:03] [INFO ] Implicit Places using invariants and state equation in 2843 ms returned []
Implicit Place search using SMT with State Equation took 3917 ms to find 0 implicit places.
[2023-03-19 01:19:03] [INFO ] Invariant cache hit.
[2023-03-19 01:19:04] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5290 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-14 finished in 5401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Found a Lengthening insensitive property : Sudoku-COL-AN13-LTLCardinality-06
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:19:05] [INFO ] Invariant cache hit.
[2023-03-19 01:19:06] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2023-03-19 01:19:06] [INFO ] Invariant cache hit.
[2023-03-19 01:19:09] [INFO ] Implicit Places using invariants and state equation in 2818 ms returned []
Implicit Place search using SMT with State Equation took 4335 ms to find 0 implicit places.
[2023-03-19 01:19:09] [INFO ] Invariant cache hit.
[2023-03-19 01:19:10] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5775 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 32280 steps with 371 reset in 10002 ms.
Product exploration timeout after 32080 steps with 369 reset in 10004 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1742 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:19:34] [INFO ] Invariant cache hit.
[2023-03-19 01:19:36] [INFO ] [Real]Absence check using 507 positive place invariants in 265 ms returned sat
[2023-03-19 01:20:00] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:20:00] [INFO ] [Nat]Absence check using 507 positive place invariants in 138 ms returned sat
[2023-03-19 01:20:19] [INFO ] After 19035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1554 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217232 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217232 steps, saw 215184 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:20:23] [INFO ] Computed 38 place invariants in 54 ms
[2023-03-19 01:20:24] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-19 01:20:26] [INFO ] After 2996ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:20:27] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-19 01:20:33] [INFO ] After 6483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:33] [INFO ] After 6560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-19 01:20:33] [INFO ] After 6761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 507 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:20:35] [INFO ] Computed 507 place invariants in 7 ms
Could not prove EG (NOT p1)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 72 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:20:50] [INFO ] Invariant cache hit.
[2023-03-19 01:20:51] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2023-03-19 01:20:51] [INFO ] Invariant cache hit.
[2023-03-19 01:20:54] [INFO ] Implicit Places using invariants and state equation in 2769 ms returned []
Implicit Place search using SMT with State Equation took 3926 ms to find 0 implicit places.
[2023-03-19 01:20:54] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-19 01:20:54] [INFO ] Invariant cache hit.
[2023-03-19 01:20:55] [INFO ] Dead Transitions using invariants and state equation in 1418 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5482 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2023-03-19 01:20:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 26750 steps with 303 reset in 10001 ms.
Product exploration timeout after 25730 steps with 291 reset in 10003 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 25 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:21:32] [INFO ] Invariant cache hit.
[2023-03-19 01:21:33] [INFO ] Implicit Places using invariants in 1059 ms returned []
[2023-03-19 01:21:33] [INFO ] Invariant cache hit.
[2023-03-19 01:21:36] [INFO ] Implicit Places using invariants and state equation in 2803 ms returned []
Implicit Place search using SMT with State Equation took 3901 ms to find 0 implicit places.
[2023-03-19 01:21:36] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-19 01:21:36] [INFO ] Invariant cache hit.
[2023-03-19 01:21:38] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5359 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-06 finished in 153347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0||X(((G(F(p1)) U p2) U (!p0&&(G(F(p1)) U p2)))))))))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLCardinality-08
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 16 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:21:38] [INFO ] Invariant cache hit.
[2023-03-19 01:21:39] [INFO ] Implicit Places using invariants in 665 ms returned []
[2023-03-19 01:21:39] [INFO ] Invariant cache hit.
[2023-03-19 01:21:41] [INFO ] Implicit Places using invariants and state equation in 2054 ms returned []
Implicit Place search using SMT with State Equation took 2765 ms to find 0 implicit places.
[2023-03-19 01:21:41] [INFO ] Invariant cache hit.
[2023-03-19 01:21:42] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4124 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 3 (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s2557 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 33030 steps with 11010 reset in 10002 ms.
Product exploration timeout after 31800 steps with 10600 reset in 10004 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1544 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 202468 steps, run timeout after 3033 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 202468 steps, saw 202307 distinct states, run finished after 3033 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:22:08] [INFO ] Invariant cache hit.
[2023-03-19 01:22:08] [INFO ] [Real]Absence check using 507 positive place invariants in 141 ms returned sat
[2023-03-19 01:22:33] [INFO ] After 25009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.2 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1565 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222544 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222544 steps, saw 216214 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:22:38] [INFO ] Computed 38 place invariants in 47 ms
[2023-03-19 01:22:38] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-19 01:22:39] [INFO ] After 1884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:22:40] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-19 01:22:42] [INFO ] After 2292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:42] [INFO ] After 2380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-19 01:22:42] [INFO ] After 2597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 9 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:22:42] [INFO ] Computed 507 place invariants in 8 ms
[2023-03-19 01:22:43] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-19 01:22:43] [INFO ] Invariant cache hit.
[2023-03-19 01:22:45] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
[2023-03-19 01:22:45] [INFO ] Invariant cache hit.
[2023-03-19 01:22:47] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4255 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1566 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205807 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205807 steps, saw 205639 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:22:52] [INFO ] Invariant cache hit.
[2023-03-19 01:22:53] [INFO ] [Real]Absence check using 507 positive place invariants in 139 ms returned sat
[2023-03-19 01:23:17] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.1 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 48 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1514 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216824 steps, run timeout after 3014 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 216824 steps, saw 215094 distinct states, run finished after 3014 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 01:23:22] [INFO ] Computed 38 place invariants in 61 ms
[2023-03-19 01:23:22] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 29 ms returned sat
[2023-03-19 01:23:24] [INFO ] After 1885ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:23:24] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-19 01:23:26] [INFO ] After 2347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:23:26] [INFO ] After 2424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-19 01:23:27] [INFO ] After 2587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Product exploration timeout after 31680 steps with 10560 reset in 10003 ms.
Product exploration timeout after 31560 steps with 10520 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:23:47] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-19 01:23:47] [INFO ] Invariant cache hit.
[2023-03-19 01:23:48] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 875 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 27 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:23:48] [INFO ] Invariant cache hit.
[2023-03-19 01:23:48] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-19 01:23:49] [INFO ] Invariant cache hit.
[2023-03-19 01:23:50] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
[2023-03-19 01:23:50] [INFO ] Invariant cache hit.
[2023-03-19 01:23:51] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3018 ms. Remains : 507/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-08 finished in 133440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLCardinality-09
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 46 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 01:23:51] [INFO ] Computed 507 place invariants in 13 ms
[2023-03-19 01:23:53] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2023-03-19 01:23:53] [INFO ] Invariant cache hit.
[2023-03-19 01:23:56] [INFO ] Implicit Places using invariants and state equation in 3269 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
[2023-03-19 01:23:56] [INFO ] Invariant cache hit.
[2023-03-19 01:23:57] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6013 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 27240 steps with 6810 reset in 10001 ms.
Product exploration timeout after 27180 steps with 6795 reset in 10004 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 01:24:20] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:24:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:24:35] [INFO ] Invariant cache hit.
[2023-03-19 01:24:37] [INFO ] Implicit Places using invariants in 1330 ms returned []
[2023-03-19 01:24:37] [INFO ] Invariant cache hit.
[2023-03-19 01:24:40] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 4731 ms to find 0 implicit places.
[2023-03-19 01:24:40] [INFO ] Invariant cache hit.
[2023-03-19 01:24:42] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6245 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 01:24:43] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:24:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 27340 steps with 6835 reset in 10001 ms.
Product exploration timeout after 27240 steps with 6810 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:25:19] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-19 01:25:19] [INFO ] Invariant cache hit.
[2023-03-19 01:25:21] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1497 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:25:21] [INFO ] Invariant cache hit.
[2023-03-19 01:25:22] [INFO ] Implicit Places using invariants in 1303 ms returned []
[2023-03-19 01:25:22] [INFO ] Invariant cache hit.
[2023-03-19 01:25:25] [INFO ] Implicit Places using invariants and state equation in 3225 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2023-03-19 01:25:25] [INFO ] Invariant cache hit.
[2023-03-19 01:25:27] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6009 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-09 finished in 95637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : Sudoku-COL-AN13-LTLCardinality-12
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 26 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:25:27] [INFO ] Invariant cache hit.
[2023-03-19 01:25:28] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2023-03-19 01:25:28] [INFO ] Invariant cache hit.
[2023-03-19 01:25:31] [INFO ] Implicit Places using invariants and state equation in 2822 ms returned []
Implicit Place search using SMT with State Equation took 3867 ms to find 0 implicit places.
[2023-03-19 01:25:31] [INFO ] Invariant cache hit.
[2023-03-19 01:25:32] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5285 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 34890 steps with 405 reset in 10002 ms.
Product exploration timeout after 34540 steps with 401 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-19 01:25:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 40 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:26:09] [INFO ] Invariant cache hit.
[2023-03-19 01:26:10] [INFO ] Implicit Places using invariants in 1061 ms returned []
[2023-03-19 01:26:10] [INFO ] Invariant cache hit.
[2023-03-19 01:26:13] [INFO ] Implicit Places using invariants and state equation in 2795 ms returned []
Implicit Place search using SMT with State Equation took 3858 ms to find 0 implicit places.
[2023-03-19 01:26:13] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 01:26:13] [INFO ] Invariant cache hit.
[2023-03-19 01:26:15] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5360 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-19 01:26:17] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration timeout after 34500 steps with 401 reset in 10004 ms.
Product exploration timeout after 34520 steps with 401 reset in 10003 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 27 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 01:26:52] [INFO ] Invariant cache hit.
[2023-03-19 01:26:53] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2023-03-19 01:26:53] [INFO ] Invariant cache hit.
[2023-03-19 01:26:56] [INFO ] Implicit Places using invariants and state equation in 2984 ms returned []
Implicit Place search using SMT with State Equation took 4092 ms to find 0 implicit places.
[2023-03-19 01:26:56] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-19 01:26:56] [INFO ] Invariant cache hit.
[2023-03-19 01:26:58] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5634 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 90811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 01:26:58] [INFO ] Flatten gal took : 161 ms
[2023-03-19 01:26:58] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2023-03-19 01:26:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 2197 transitions and 8788 arcs took 11 ms.
Total runtime 1197241 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2417/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 16029904 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16112304 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2417/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 15986280 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16068784 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2417/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 15979796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062152 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2417/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15977716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062752 kB
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
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="Sudoku-COL-AN13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN13, 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 r489-tall-167912706300099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN13.tgz
mv Sudoku-COL-AN13 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 ;