About the Execution of 2023-gold for FunctionPointer-PT-c008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.287 | 3600000.00 | 4378640.00 | 321121.50 | TFFFFFFFF?FTF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625100183.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100183
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716531911361
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 06:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 06:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:25:13] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2024-05-24 06:25:13] [INFO ] Transformed 2826 places.
[2024-05-24 06:25:13] [INFO ] Transformed 8960 transitions.
[2024-05-24 06:25:13] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 309 place count 1319 transition count 3796
Iterating global reduction 1 with 292 rules applied. Total rules applied 601 place count 1319 transition count 3796
Ensure Unique test removed 430 transitions
Reduce isomorphic transitions removed 430 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 1031 place count 1319 transition count 3366
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 1180 place count 1170 transition count 3068
Iterating global reduction 2 with 149 rules applied. Total rules applied 1329 place count 1170 transition count 3068
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1425 place count 1170 transition count 2972
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1439 place count 1156 transition count 2944
Iterating global reduction 3 with 14 rules applied. Total rules applied 1453 place count 1156 transition count 2944
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1466 place count 1143 transition count 2918
Iterating global reduction 3 with 13 rules applied. Total rules applied 1479 place count 1143 transition count 2918
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1492 place count 1130 transition count 2892
Iterating global reduction 3 with 13 rules applied. Total rules applied 1505 place count 1130 transition count 2892
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1518 place count 1117 transition count 2866
Iterating global reduction 3 with 13 rules applied. Total rules applied 1531 place count 1117 transition count 2866
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1544 place count 1104 transition count 2840
Iterating global reduction 3 with 13 rules applied. Total rules applied 1557 place count 1104 transition count 2840
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1570 place count 1091 transition count 2814
Iterating global reduction 3 with 13 rules applied. Total rules applied 1583 place count 1091 transition count 2814
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1595 place count 1079 transition count 2790
Iterating global reduction 3 with 12 rules applied. Total rules applied 1607 place count 1079 transition count 2790
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1659 place count 1027 transition count 2592
Iterating global reduction 3 with 52 rules applied. Total rules applied 1711 place count 1027 transition count 2592
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1763 place count 975 transition count 2384
Iterating global reduction 3 with 52 rules applied. Total rules applied 1815 place count 975 transition count 2384
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1867 place count 923 transition count 2270
Iterating global reduction 3 with 52 rules applied. Total rules applied 1919 place count 923 transition count 2270
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1971 place count 871 transition count 2166
Iterating global reduction 3 with 52 rules applied. Total rules applied 2023 place count 871 transition count 2166
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2075 place count 819 transition count 2062
Iterating global reduction 3 with 52 rules applied. Total rules applied 2127 place count 819 transition count 2062
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2179 place count 767 transition count 1958
Iterating global reduction 3 with 52 rules applied. Total rules applied 2231 place count 767 transition count 1958
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2282 place count 716 transition count 1856
Iterating global reduction 3 with 51 rules applied. Total rules applied 2333 place count 716 transition count 1856
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2338 place count 711 transition count 1846
Iterating global reduction 3 with 5 rules applied. Total rules applied 2343 place count 711 transition count 1846
Applied a total of 2343 rules in 1198 ms. Remains 711 /1628 variables (removed 917) and now considering 1846/5962 (removed 4116) transitions.
[2024-05-24 06:25:14] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
// Phase 1: matrix 1235 rows 711 cols
[2024-05-24 06:25:14] [INFO ] Computed 2 invariants in 37 ms
[2024-05-24 06:25:15] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-24 06:25:15] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-24 06:25:15] [INFO ] Invariant cache hit.
[2024-05-24 06:25:15] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 06:25:17] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 2386 ms to find 0 implicit places.
[2024-05-24 06:25:17] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-24 06:25:17] [INFO ] Invariant cache hit.
[2024-05-24 06:25:17] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 711/1628 places, 1846/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4191 ms. Remains : 711/1628 places, 1846/5962 transitions.
Support contains 21 out of 711 places after structural reductions.
[2024-05-24 06:25:18] [INFO ] Flatten gal took : 131 ms
[2024-05-24 06:25:18] [INFO ] Flatten gal took : 102 ms
[2024-05-24 06:25:18] [INFO ] Input system was already deterministic with 1846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 160881 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160881 steps, saw 104673 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 18 properties.
[2024-05-24 06:25:22] [INFO ] Flow matrix only has 1235 transitions (discarded 611 similar events)
[2024-05-24 06:25:22] [INFO ] Invariant cache hit.
[2024-05-24 06:25:22] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:25:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:25:24] [INFO ] After 2842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 06:25:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:25:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:25:27] [INFO ] After 2367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 06:25:27] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 06:25:29] [INFO ] After 1818ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 06:25:30] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 4 ms to minimize.
[2024-05-24 06:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-24 06:25:31] [INFO ] After 3751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1344 ms.
[2024-05-24 06:25:32] [INFO ] After 7961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 103 ms.
Support contains 20 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 711 transition count 1822
Applied a total of 24 rules in 304 ms. Remains 711 /711 variables (removed 0) and now considering 1822/1846 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 711/711 places, 1822/1846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 131254 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{2=1}
Probabilistic random walk after 131254 steps, saw 85213 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :1
Running SMT prover for 16 properties.
[2024-05-24 06:25:36] [INFO ] Flow matrix only has 1223 transitions (discarded 599 similar events)
// Phase 1: matrix 1223 rows 711 cols
[2024-05-24 06:25:36] [INFO ] Computed 2 invariants in 25 ms
[2024-05-24 06:25:37] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:25:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 06:25:39] [INFO ] After 2442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 06:25:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:25:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:25:41] [INFO ] After 2071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-24 06:25:41] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 06:25:43] [INFO ] After 1608ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-24 06:25:43] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 1 ms to minimize.
[2024-05-24 06:25:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-24 06:25:45] [INFO ] After 3602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1206 ms.
[2024-05-24 06:25:46] [INFO ] After 7295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 54 ms.
Support contains 18 out of 711 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 711/711 places, 1822/1822 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 709 transition count 1818
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 709 transition count 1818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 707 transition count 1814
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 707 transition count 1814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 705 transition count 1808
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 705 transition count 1808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 703 transition count 1804
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 703 transition count 1804
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 701 transition count 1800
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 701 transition count 1800
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 699 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 699 transition count 1796
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 697 transition count 1792
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 697 transition count 1792
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 695 transition count 1786
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 695 transition count 1786
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 693 transition count 1782
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 693 transition count 1782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 692 transition count 1780
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 692 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 691 transition count 1778
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 691 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 690 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 690 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 689 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 689 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 688 transition count 1772
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 688 transition count 1772
Applied a total of 46 rules in 346 ms. Remains 688 /711 variables (removed 23) and now considering 1772/1822 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 688/711 places, 1772/1822 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-24 06:25:47] [INFO ] Flow matrix only has 1189 transitions (discarded 583 similar events)
// Phase 1: matrix 1189 rows 688 cols
[2024-05-24 06:25:47] [INFO ] Computed 2 invariants in 36 ms
[2024-05-24 06:25:47] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:25:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:25:49] [INFO ] After 1915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-24 06:25:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:25:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:25:50] [INFO ] After 1183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-24 06:25:50] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 06:25:51] [INFO ] After 1004ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-24 06:25:52] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2024-05-24 06:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-24 06:25:53] [INFO ] After 2184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 772 ms.
[2024-05-24 06:25:53] [INFO ] After 4416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 10 ms.
Support contains 11 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 1772/1772 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 684 transition count 1762
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 684 transition count 1762
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 680 transition count 1754
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 680 transition count 1754
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 677 transition count 1744
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 677 transition count 1744
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 674 transition count 1738
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 674 transition count 1738
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 671 transition count 1732
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 671 transition count 1732
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 668 transition count 1726
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 668 transition count 1726
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 665 transition count 1720
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 665 transition count 1720
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 663 transition count 1716
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 663 transition count 1716
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 661 transition count 1712
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 661 transition count 1712
Applied a total of 54 rules in 211 ms. Remains 661 /688 variables (removed 27) and now considering 1712/1772 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 661/688 places, 1712/1772 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 06:25:54] [INFO ] Flow matrix only has 1147 transitions (discarded 565 similar events)
// Phase 1: matrix 1147 rows 661 cols
[2024-05-24 06:25:54] [INFO ] Computed 2 invariants in 21 ms
[2024-05-24 06:25:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:25:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:25:55] [INFO ] After 1439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 06:25:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:25:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:25:57] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-24 06:25:57] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-24 06:25:58] [INFO ] After 932ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-24 06:25:58] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2024-05-24 06:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-05-24 06:25:59] [INFO ] After 2246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 801 ms.
[2024-05-24 06:26:00] [INFO ] After 4311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 24 ms.
Support contains 10 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1712/1712 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 660 transition count 1710
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 660 transition count 1710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 660 transition count 1708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 659 transition count 1706
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 659 transition count 1706
Applied a total of 6 rules in 109 ms. Remains 659 /661 variables (removed 2) and now considering 1706/1712 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 659/661 places, 1706/1712 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-24 06:26:00] [INFO ] Flow matrix only has 1142 transitions (discarded 564 similar events)
// Phase 1: matrix 1142 rows 659 cols
[2024-05-24 06:26:00] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 06:26:00] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:26:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:02] [INFO ] After 1436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 06:26:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:26:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:03] [INFO ] After 986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 06:26:03] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-24 06:26:04] [INFO ] After 748ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-24 06:26:04] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 1 ms to minimize.
[2024-05-24 06:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-24 06:26:04] [INFO ] After 1615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 435 ms.
[2024-05-24 06:26:05] [INFO ] After 3270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 10 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1706/1706 transitions.
Applied a total of 0 rules in 79 ms. Remains 659 /659 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 659/659 places, 1706/1706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 189500 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189500 steps, saw 123016 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-24 06:26:08] [INFO ] Flow matrix only has 1142 transitions (discarded 564 similar events)
[2024-05-24 06:26:08] [INFO ] Invariant cache hit.
[2024-05-24 06:26:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 06:26:10] [INFO ] After 1367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 06:26:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:26:11] [INFO ] After 1021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 06:26:11] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-24 06:26:12] [INFO ] After 758ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-24 06:26:12] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 1 ms to minimize.
[2024-05-24 06:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-24 06:26:13] [INFO ] After 1641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 438 ms.
[2024-05-24 06:26:13] [INFO ] After 3309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 10 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1706/1706 transitions.
Applied a total of 0 rules in 82 ms. Remains 659 /659 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 659/659 places, 1706/1706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1706/1706 transitions.
Applied a total of 0 rules in 78 ms. Remains 659 /659 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
[2024-05-24 06:26:13] [INFO ] Flow matrix only has 1142 transitions (discarded 564 similar events)
[2024-05-24 06:26:13] [INFO ] Invariant cache hit.
[2024-05-24 06:26:13] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-24 06:26:13] [INFO ] Flow matrix only has 1142 transitions (discarded 564 similar events)
[2024-05-24 06:26:13] [INFO ] Invariant cache hit.
[2024-05-24 06:26:14] [INFO ] State equation strengthened by 280 read => feed constraints.
[2024-05-24 06:26:15] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2024-05-24 06:26:15] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-24 06:26:15] [INFO ] Flow matrix only has 1142 transitions (discarded 564 similar events)
[2024-05-24 06:26:15] [INFO ] Invariant cache hit.
[2024-05-24 06:26:16] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2672 ms. Remains : 659/659 places, 1706/1706 transitions.
Graph (trivial) has 1000 edges and 659 vertex of which 192 / 659 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 436 transitions
Reduce isomorphic transitions removed 756 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 531 transition count 938
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 519 transition count 938
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 25 place count 519 transition count 851
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 199 place count 432 transition count 851
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 262 place count 369 transition count 788
Iterating global reduction 2 with 63 rules applied. Total rules applied 325 place count 369 transition count 788
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 451 place count 369 transition count 662
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 709 place count 240 transition count 533
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 771 place count 178 transition count 409
Iterating global reduction 3 with 62 rules applied. Total rules applied 833 place count 178 transition count 409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 834 place count 178 transition count 408
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 895 place count 117 transition count 286
Iterating global reduction 4 with 61 rules applied. Total rules applied 956 place count 117 transition count 286
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 1017 place count 56 transition count 164
Iterating global reduction 4 with 61 rules applied. Total rules applied 1078 place count 56 transition count 164
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 1139 place count 56 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1141 place count 55 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1153 place count 49 transition count 105
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1157 place count 49 transition count 101
Applied a total of 1157 rules in 70 ms. Remains 49 /659 variables (removed 610) and now considering 101/1706 (removed 1605) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 101 rows 49 cols
[2024-05-24 06:26:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:26:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:26:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:16] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2024-05-24 06:26:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:26:16] [INFO ] After 38ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 06:26:16] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 06:26:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:26:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:16] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 06:26:16] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-24 06:26:16] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 06:26:16] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FunctionPointer-PT-c008-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c008-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 698 transition count 1818
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 698 transition count 1818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 698 transition count 1814
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 685 transition count 1784
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 685 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 674 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 674 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 663 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 663 transition count 1708
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 652 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 652 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 641 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 641 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 630 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 630 transition count 1640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 620 transition count 1618
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 620 transition count 1618
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 611 transition count 1598
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 place count 605 transition count 1586
Applied a total of 216 rules in 395 ms. Remains 605 /711 variables (removed 106) and now considering 1586/1846 (removed 260) transitions.
[2024-05-24 06:26:17] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-24 06:26:17] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 06:26:17] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-24 06:26:17] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 06:26:17] [INFO ] Invariant cache hit.
[2024-05-24 06:26:17] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 06:26:18] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2024-05-24 06:26:18] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-24 06:26:18] [INFO ] Invariant cache hit.
[2024-05-24 06:26:19] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/711 places, 1586/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2551 ms. Remains : 605/711 places, 1586/1846 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-00 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:(OR (LT s0 1) (LT s564 1))], 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 explored 100000 steps with 33333 reset in 740 ms.
Product exploration explored 100000 steps with 33333 reset in 653 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLFireability-00 finished in 4265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 698 transition count 1818
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 698 transition count 1818
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 698 transition count 1814
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 43 place count 685 transition count 1784
Iterating global reduction 1 with 13 rules applied. Total rules applied 56 place count 685 transition count 1784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 674 transition count 1746
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 674 transition count 1746
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 663 transition count 1708
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 663 transition count 1708
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 652 transition count 1684
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 652 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 641 transition count 1662
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 641 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 155 place count 630 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 166 place count 630 transition count 1640
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 620 transition count 1618
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 620 transition count 1618
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 611 transition count 1598
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 611 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 206 place count 609 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 208 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 209 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 210 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 211 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 212 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 213 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 214 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 215 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 216 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 218 place count 605 transition count 1584
Applied a total of 218 rules in 793 ms. Remains 605 /711 variables (removed 106) and now considering 1584/1846 (removed 262) transitions.
[2024-05-24 06:26:21] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-24 06:26:21] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 06:26:22] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-24 06:26:22] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 06:26:22] [INFO ] Invariant cache hit.
[2024-05-24 06:26:22] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 06:26:24] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
[2024-05-24 06:26:24] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-24 06:26:24] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 06:26:24] [INFO ] Invariant cache hit.
[2024-05-24 06:26:24] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/711 places, 1584/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3749 ms. Remains : 605/711 places, 1584/1846 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 376 ms.
Stack based approach found an accepted trace after 403 steps with 0 reset with depth 404 and stack size 404 in 3 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 4192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Applied a total of 198 rules in 174 ms. Remains 614 /711 variables (removed 97) and now considering 1608/1846 (removed 238) transitions.
[2024-05-24 06:26:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-24 06:26:25] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:26:25] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-24 06:26:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:26:25] [INFO ] Invariant cache hit.
[2024-05-24 06:26:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:27] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
[2024-05-24 06:26:27] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-24 06:26:27] [INFO ] Invariant cache hit.
[2024-05-24 06:26:28] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 614/711 places, 1608/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2704 ms. Remains : 614/711 places, 1608/1846 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s535 1))], 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 explored 100000 steps with 0 reset in 398 ms.
Stack based approach found an accepted trace after 1238 steps with 0 reset with depth 1239 and stack size 1239 in 6 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-05 finished in 3212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p1))&&p0)))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1790
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1790
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 179 place count 619 transition count 1618
Iterating global reduction 1 with 9 rules applied. Total rules applied 188 place count 619 transition count 1618
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 190 place count 617 transition count 1614
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Applied a total of 200 rules in 139 ms. Remains 613 /711 variables (removed 98) and now considering 1606/1846 (removed 240) transitions.
[2024-05-24 06:26:28] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 06:26:28] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 06:26:28] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-24 06:26:28] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 06:26:28] [INFO ] Invariant cache hit.
[2024-05-24 06:26:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:30] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
[2024-05-24 06:26:30] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 06:26:30] [INFO ] Invariant cache hit.
[2024-05-24 06:26:30] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/711 places, 1606/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2382 ms. Remains : 613/711 places, 1606/1846 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s540 1)), p0:(AND (GEQ s0 1) (GEQ s394 1))], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 412 ms.
Stack based approach found an accepted trace after 1276 steps with 0 reset with depth 1277 and stack size 1277 in 6 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-07 finished in 3032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 614 transition count 1604
Applied a total of 202 rules in 361 ms. Remains 614 /711 variables (removed 97) and now considering 1604/1846 (removed 242) transitions.
[2024-05-24 06:26:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:26:31] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 06:26:32] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-24 06:26:32] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:32] [INFO ] Invariant cache hit.
[2024-05-24 06:26:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:33] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2024-05-24 06:26:33] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 06:26:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:33] [INFO ] Invariant cache hit.
[2024-05-24 06:26:34] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/711 places, 1604/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2839 ms. Remains : 614/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s542 1)), p1:(AND (GEQ s1 1) (GEQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 577 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 259143 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259143 steps, saw 168214 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:26:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:38] [INFO ] Invariant cache hit.
[2024-05-24 06:26:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:26:39] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:26:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:40] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:40] [INFO ] After 353ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:41] [INFO ] Deduced a trap composed of 131 places in 263 ms of which 1 ms to minimize.
[2024-05-24 06:26:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2024-05-24 06:26:41] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 327 ms.
[2024-05-24 06:26:41] [INFO ] After 2145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 67 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 614/614 places, 1604/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 297834 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 297834 steps, saw 193327 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:26:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:44] [INFO ] Invariant cache hit.
[2024-05-24 06:26:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:26:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:45] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:26:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:26:46] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:46] [INFO ] After 353ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2024-05-24 06:26:47] [INFO ] After 1022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 329 ms.
[2024-05-24 06:26:47] [INFO ] After 2041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 67 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:26:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:48] [INFO ] Invariant cache hit.
[2024-05-24 06:26:48] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-24 06:26:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:48] [INFO ] Invariant cache hit.
[2024-05-24 06:26:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:49] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2024-05-24 06:26:50] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:26:50] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:50] [INFO ] Invariant cache hit.
[2024-05-24 06:26:50] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2583 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 29 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 06:26:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:26:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:26:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:26:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:26:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:26:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:26:50] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:26:50] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:50] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 06:26:50] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 78 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:26:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:26:51] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 06:26:51] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-24 06:26:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:51] [INFO ] Invariant cache hit.
[2024-05-24 06:26:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:52] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2024-05-24 06:26:53] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 06:26:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:53] [INFO ] Invariant cache hit.
[2024-05-24 06:26:53] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2559 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 313225 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313225 steps, saw 203316 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:26:56] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:26:56] [INFO ] Invariant cache hit.
[2024-05-24 06:26:56] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:26:57] [INFO ] After 766ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:26:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:26:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:26:58] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:26:58] [INFO ] After 343ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:26:59] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2024-05-24 06:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-05-24 06:26:59] [INFO ] After 985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 327 ms.
[2024-05-24 06:26:59] [INFO ] After 1964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 66 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 614/614 places, 1604/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 309292 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 309292 steps, saw 200762 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:27:02] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:27:02] [INFO ] Invariant cache hit.
[2024-05-24 06:27:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:27:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:27:03] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:27:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:27:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:27:04] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:27:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:27:04] [INFO ] After 347ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:27:04] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2024-05-24 06:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-24 06:27:05] [INFO ] After 979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 322 ms.
[2024-05-24 06:27:05] [INFO ] After 1946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 70 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 67 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:27:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:27:05] [INFO ] Invariant cache hit.
[2024-05-24 06:27:05] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-24 06:27:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:27:05] [INFO ] Invariant cache hit.
[2024-05-24 06:27:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:27:07] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2024-05-24 06:27:07] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:27:07] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:27:07] [INFO ] Invariant cache hit.
[2024-05-24 06:27:08] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2425 ms. Remains : 614/614 places, 1604/1604 transitions.
Graph (trivial) has 942 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 476 transition count 797
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 404 transition count 797
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 341 transition count 734
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 341 transition count 734
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 341 transition count 608
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 671 place count 214 transition count 481
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 734 place count 151 transition count 355
Iterating global reduction 3 with 63 rules applied. Total rules applied 797 place count 151 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 354
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 860 place count 89 transition count 230
Iterating global reduction 4 with 62 rules applied. Total rules applied 922 place count 89 transition count 230
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 984 place count 27 transition count 106
Iterating global reduction 4 with 62 rules applied. Total rules applied 1046 place count 27 transition count 106
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1108 place count 27 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1110 place count 26 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1114 place count 24 transition count 44
Applied a total of 1114 rules in 26 ms. Remains 24 /614 variables (removed 590) and now considering 44/1604 (removed 1560) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 06:27:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 06:27:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:27:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:27:08] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:27:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:27:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:27:08] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:27:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:27:08] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:27:08] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 06:27:08] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 377 ms.
Product exploration explored 100000 steps with 0 reset in 478 ms.
Built C files in :
/tmp/ltsmin9259966003756961546
[2024-05-24 06:27:09] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:27:09] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9259966003756961546
Running compilation step : cd /tmp/ltsmin9259966003756961546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2829 ms.
Running link step : cd /tmp/ltsmin9259966003756961546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9259966003756961546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1770982302430335138.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 81 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:27:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:27:24] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:27:25] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-24 06:27:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:27:25] [INFO ] Invariant cache hit.
[2024-05-24 06:27:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:27:26] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2024-05-24 06:27:26] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 06:27:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:27:26] [INFO ] Invariant cache hit.
[2024-05-24 06:27:27] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2865 ms. Remains : 614/614 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin9409801170359911133
[2024-05-24 06:27:27] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:27:27] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9409801170359911133
Running compilation step : cd /tmp/ltsmin9409801170359911133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2766 ms.
Running link step : cd /tmp/ltsmin9409801170359911133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9409801170359911133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6579323076256631671.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:27:42] [INFO ] Flatten gal took : 67 ms
[2024-05-24 06:27:42] [INFO ] Flatten gal took : 54 ms
[2024-05-24 06:27:42] [INFO ] Time to serialize gal into /tmp/LTL7953180137833381754.gal : 12 ms
[2024-05-24 06:27:42] [INFO ] Time to serialize properties into /tmp/LTL2034713882437651581.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7953180137833381754.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9516467508299686928.hoa' '-atoms' '/tmp/LTL2034713882437651581.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2034713882437651581.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9516467508299686928.hoa
Detected timeout of ITS tools.
[2024-05-24 06:27:57] [INFO ] Flatten gal took : 50 ms
[2024-05-24 06:27:57] [INFO ] Flatten gal took : 46 ms
[2024-05-24 06:27:57] [INFO ] Time to serialize gal into /tmp/LTL18392514275829328904.gal : 7 ms
[2024-05-24 06:27:57] [INFO ] Time to serialize properties into /tmp/LTL10857106535486776293.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18392514275829328904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10857106535486776293.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
Detected timeout of ITS tools.
[2024-05-24 06:28:12] [INFO ] Flatten gal took : 41 ms
[2024-05-24 06:28:12] [INFO ] Applying decomposition
[2024-05-24 06:28:12] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9815987043223187344.txt' '-o' '/tmp/graph9815987043223187344.bin' '-w' '/tmp/graph9815987043223187344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9815987043223187344.bin' '-l' '-1' '-v' '-w' '/tmp/graph9815987043223187344.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:28:13] [INFO ] Decomposing Gal with order
[2024-05-24 06:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:28:13] [INFO ] Removed a total of 2659 redundant transitions.
[2024-05-24 06:28:13] [INFO ] Flatten gal took : 176 ms
[2024-05-24 06:28:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1128 labels/synchronizations in 80 ms.
[2024-05-24 06:28:13] [INFO ] Time to serialize gal into /tmp/LTL13884010256943556599.gal : 13 ms
[2024-05-24 06:28:13] [INFO ] Time to serialize properties into /tmp/LTL4956927356296351842.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13884010256943556599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4956927356296351842.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i24.i2.u155.l2083<1))")||(X(F("((i1.u1.s1>=1)&&(i17.u164.l976>=1))")))))))
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i24.i2.u155.l2083<1))" & FG!"((i1.u1.s1>=1)&&(i17.u164.l976>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7053454439198585670
[2024-05-24 06:28:28] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7053454439198585670
Running compilation step : cd /tmp/ltsmin7053454439198585670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2811 ms.
Running link step : cd /tmp/ltsmin7053454439198585670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7053454439198585670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-09 finished in 132308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1820
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1820
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1816
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1788
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1788
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1754
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1754
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 161 place count 628 transition count 1638
Iterating global reduction 1 with 9 rules applied. Total rules applied 170 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 620 transition count 1620
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 618 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 614 transition count 1604
Applied a total of 202 rules in 316 ms. Remains 614 /711 variables (removed 97) and now considering 1604/1846 (removed 242) transitions.
[2024-05-24 06:28:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 06:28:44] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 06:28:44] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-24 06:28:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:28:44] [INFO ] Invariant cache hit.
[2024-05-24 06:28:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:28:46] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
[2024-05-24 06:28:46] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 06:28:46] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:28:46] [INFO ] Invariant cache hit.
[2024-05-24 06:28:46] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/711 places, 1604/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2733 ms. Remains : 614/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-10 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:(AND (GEQ s0 1) (GEQ s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 424 ms.
Stack based approach found an accepted trace after 92 steps with 0 reset with depth 93 and stack size 93 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-10 finished in 3262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 700 transition count 1822
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 700 transition count 1822
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 689 transition count 1796
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 689 transition count 1796
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 679 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 679 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 669 transition count 1726
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 669 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 659 transition count 1706
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 659 transition count 1706
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 649 transition count 1686
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 649 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 639 transition count 1666
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 639 transition count 1666
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 630 transition count 1646
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 630 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 622 transition count 1628
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 621 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 620 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 620 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 619 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 618 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 618 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 617 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 617 transition count 1618
Applied a total of 188 rules in 154 ms. Remains 617 /711 variables (removed 94) and now considering 1618/1846 (removed 228) transitions.
[2024-05-24 06:28:47] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 617 cols
[2024-05-24 06:28:47] [INFO ] Computed 2 invariants in 17 ms
[2024-05-24 06:28:47] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-24 06:28:47] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-24 06:28:47] [INFO ] Invariant cache hit.
[2024-05-24 06:28:47] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:28:48] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
[2024-05-24 06:28:48] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-24 06:28:48] [INFO ] Invariant cache hit.
[2024-05-24 06:28:49] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 617/711 places, 1618/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2384 ms. Remains : 617/711 places, 1618/1846 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(OR (LT s1 1) (LT s523 1)), p0:(AND (GEQ s0 1) (GEQ s539 1))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 563 ms.
Product exploration explored 100000 steps with 25000 reset in 589 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 474928 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 474928 steps, saw 308488 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:28:54] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-24 06:28:54] [INFO ] Invariant cache hit.
[2024-05-24 06:28:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:28:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:28:54] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:28:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:28:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:28:55] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:28:55] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:28:55] [INFO ] After 187ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:28:55] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-24 06:28:55] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 425 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.3 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 425 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 424 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 424 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 423 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 423 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 422 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 422 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 421 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 421 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 419 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 419 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 400 place count 418 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 418 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 417 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 417 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 416 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 416 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 415 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 415 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 409 place count 415 transition count 1206
Applied a total of 409 rules in 153 ms. Remains 415 /617 variables (removed 202) and now considering 1206/1618 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 415/617 places, 1206/1618 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 590879 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 590879 steps, saw 362318 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:28:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-24 06:28:58] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 06:28:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 06:28:59] [INFO ] After 359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:28:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 06:28:59] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:28:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:28:59] [INFO ] After 132ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:28:59] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-24 06:28:59] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 47 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-24 06:28:59] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:28:59] [INFO ] Invariant cache hit.
[2024-05-24 06:29:00] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-24 06:29:00] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:29:00] [INFO ] Invariant cache hit.
[2024-05-24 06:29:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:29:00] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2024-05-24 06:29:00] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 06:29:00] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:29:00] [INFO ] Invariant cache hit.
[2024-05-24 06:29:01] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1623 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 33 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2024-05-24 06:29:01] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 06:29:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 06:29:01] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 06:29:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:29:01] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 06:29:01] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 06:29:01] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 617 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Applied a total of 0 rules in 24 ms. Remains 617 /617 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2024-05-24 06:29:01] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
// Phase 1: matrix 1080 rows 617 cols
[2024-05-24 06:29:01] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 06:29:02] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-24 06:29:02] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-24 06:29:02] [INFO ] Invariant cache hit.
[2024-05-24 06:29:02] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:29:03] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2024-05-24 06:29:03] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-24 06:29:03] [INFO ] Invariant cache hit.
[2024-05-24 06:29:04] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2279 ms. Remains : 617/617 places, 1618/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 478900 steps, run timeout after 3012 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 478900 steps, saw 311069 distinct states, run finished after 3012 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:29:07] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2024-05-24 06:29:07] [INFO ] Invariant cache hit.
[2024-05-24 06:29:07] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:07] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:29:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:08] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:08] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 06:29:08] [INFO ] After 203ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:08] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-24 06:29:08] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Graph (complete) has 2693 edges and 617 vertex of which 425 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 425 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 424 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 424 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 424 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 423 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 423 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 392 place count 422 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 393 place count 422 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 421 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 421 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 420 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 420 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 419 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 419 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 400 place count 418 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 place count 418 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 417 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 417 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 416 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 416 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 406 place count 415 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 407 place count 415 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 409 place count 415 transition count 1206
Applied a total of 409 rules in 166 ms. Remains 415 /617 variables (removed 202) and now considering 1206/1618 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 415/617 places, 1206/1618 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 596190 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596190 steps, saw 365573 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:29:11] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-24 06:29:11] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 06:29:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 06:29:12] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:29:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 06:29:12] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:12] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:29:12] [INFO ] After 132ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:12] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-24 06:29:12] [INFO ] After 609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 46 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-24 06:29:12] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:29:12] [INFO ] Invariant cache hit.
[2024-05-24 06:29:13] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-24 06:29:13] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:29:13] [INFO ] Invariant cache hit.
[2024-05-24 06:29:13] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-24 06:29:14] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2024-05-24 06:29:14] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 06:29:14] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2024-05-24 06:29:14] [INFO ] Invariant cache hit.
[2024-05-24 06:29:14] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1542 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 938 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1002 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1066 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1067 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1067 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1069 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1132 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1195 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1258 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1321 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1384 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1384 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 17 transition count 28
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 17 transition count 25
Applied a total of 1389 rules in 20 ms. Remains 17 /415 variables (removed 398) and now considering 25/1206 (removed 1181) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 17 cols
[2024-05-24 06:29:14] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 06:29:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 06:29:14] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 06:29:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:29:14] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-24 06:29:14] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 06:29:14] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 566 ms.
Product exploration explored 100000 steps with 25000 reset in 573 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 617 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 617/617 places, 1618/1618 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 616 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 616 transition count 1616
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 614 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 614 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 610 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 610 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 609 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 609 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 608 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 607 transition count 1592
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 607 transition count 1590
Applied a total of 24 rules in 508 ms. Remains 607 /617 variables (removed 10) and now considering 1590/1618 (removed 28) transitions.
[2024-05-24 06:29:16] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 06:29:16] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2024-05-24 06:29:16] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 06:29:17] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/617 places, 1590/1618 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1051 ms. Remains : 607/617 places, 1590/1618 transitions.
Built C files in :
/tmp/ltsmin5983860760675509638
[2024-05-24 06:29:17] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5983860760675509638
Running compilation step : cd /tmp/ltsmin5983860760675509638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2904 ms.
Running link step : cd /tmp/ltsmin5983860760675509638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5983860760675509638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5158742283496145687.hoa' '--buchi-type=spotba'
LTSmin run took 517 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c008-LTLFireability-11 finished in 33832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||G(F(p2))||G(p0))))'
Support contains 5 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 701 transition count 1824
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 701 transition count 1824
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 701 transition count 1820
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 691 transition count 1796
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 691 transition count 1796
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 683 transition count 1770
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 683 transition count 1770
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 675 transition count 1744
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 675 transition count 1744
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 667 transition count 1726
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 667 transition count 1726
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 659 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 659 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 116 place count 651 transition count 1694
Iterating global reduction 1 with 8 rules applied. Total rules applied 124 place count 651 transition count 1694
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 131 place count 644 transition count 1678
Iterating global reduction 1 with 7 rules applied. Total rules applied 138 place count 644 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 144 place count 638 transition count 1664
Iterating global reduction 1 with 6 rules applied. Total rules applied 150 place count 638 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 636 transition count 1660
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 636 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 635 transition count 1658
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 635 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 634 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 633 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 632 transition count 1652
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 632 transition count 1652
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 632 transition count 1644
Applied a total of 170 rules in 362 ms. Remains 632 /711 variables (removed 79) and now considering 1644/1846 (removed 202) transitions.
[2024-05-24 06:29:21] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2024-05-24 06:29:21] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:29:21] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-24 06:29:21] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-24 06:29:21] [INFO ] Invariant cache hit.
[2024-05-24 06:29:21] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 06:29:22] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2024-05-24 06:29:23] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:29:23] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2024-05-24 06:29:23] [INFO ] Invariant cache hit.
[2024-05-24 06:29:23] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 632/711 places, 1644/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2570 ms. Remains : 632/711 places, 1644/1846 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s558 1)), p2:(AND (GEQ s0 1) (GEQ s559 1)), p0:(AND (GEQ s1 1) (GEQ s560 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 402 ms.
Stack based approach found an accepted trace after 1318 steps with 0 reset with depth 1319 and stack size 1319 in 5 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-12 finished in 3159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 700 transition count 1822
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 700 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 700 transition count 1818
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 689 transition count 1792
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 689 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 680 transition count 1760
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 680 transition count 1760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 75 place count 671 transition count 1728
Iterating global reduction 1 with 9 rules applied. Total rules applied 84 place count 671 transition count 1728
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 93 place count 662 transition count 1708
Iterating global reduction 1 with 9 rules applied. Total rules applied 102 place count 662 transition count 1708
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 653 transition count 1690
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 653 transition count 1690
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 129 place count 644 transition count 1672
Iterating global reduction 1 with 9 rules applied. Total rules applied 138 place count 644 transition count 1672
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 146 place count 636 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 154 place count 636 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 161 place count 629 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 168 place count 629 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 628 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 628 transition count 1640
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 176 place count 628 transition count 1634
Applied a total of 176 rules in 312 ms. Remains 628 /711 variables (removed 83) and now considering 1634/1846 (removed 212) transitions.
[2024-05-24 06:29:24] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-24 06:29:24] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 06:29:24] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-24 06:29:24] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:24] [INFO ] Invariant cache hit.
[2024-05-24 06:29:25] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:26] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2024-05-24 06:29:26] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 06:29:26] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:26] [INFO ] Invariant cache hit.
[2024-05-24 06:29:26] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 628/711 places, 1634/1846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2707 ms. Remains : 628/711 places, 1634/1846 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s556 1)), p0:(AND (GEQ s1 1) (GEQ s552 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 453 ms.
Product exploration explored 100000 steps with 0 reset in 520 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 320948 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320948 steps, saw 208328 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:29:31] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:31] [INFO ] Invariant cache hit.
[2024-05-24 06:29:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:29:31] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:29:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:29:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:32] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:32] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:32] [INFO ] After 377ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:33] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2024-05-24 06:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-24 06:29:33] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-24 06:29:33] [INFO ] After 1718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 73 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:29:33] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:33] [INFO ] Invariant cache hit.
[2024-05-24 06:29:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:29:34] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:29:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 06:29:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 06:29:34] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:34] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:34] [INFO ] After 187ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:35] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 3 ms to minimize.
[2024-05-24 06:29:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-24 06:29:35] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-24 06:29:35] [INFO ] After 1147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 70 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 501486 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 501486 steps, saw 325497 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:29:38] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:38] [INFO ] Invariant cache hit.
[2024-05-24 06:29:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:29:38] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:29:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:29:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:39] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:39] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:39] [INFO ] After 191ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:39] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2024-05-24 06:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-05-24 06:29:39] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-24 06:29:39] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 72 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 68 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-24 06:29:40] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:40] [INFO ] Invariant cache hit.
[2024-05-24 06:29:40] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-24 06:29:40] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:40] [INFO ] Invariant cache hit.
[2024-05-24 06:29:40] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:41] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2024-05-24 06:29:41] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 06:29:41] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:41] [INFO ] Invariant cache hit.
[2024-05-24 06:29:42] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2415 ms. Remains : 628/628 places, 1634/1634 transitions.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 34 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 24 cols
[2024-05-24 06:29:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:29:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:29:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:29:42] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:29:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:29:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:42] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:29:42] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:29:42] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 06:29:42] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 75 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-24 06:29:42] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-24 06:29:42] [INFO ] Computed 2 invariants in 17 ms
[2024-05-24 06:29:43] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-24 06:29:43] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:43] [INFO ] Invariant cache hit.
[2024-05-24 06:29:43] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:44] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2024-05-24 06:29:44] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 06:29:44] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:44] [INFO ] Invariant cache hit.
[2024-05-24 06:29:45] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2432 ms. Remains : 628/628 places, 1634/1634 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 333090 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 333090 steps, saw 216207 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:29:48] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:48] [INFO ] Invariant cache hit.
[2024-05-24 06:29:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:29:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:29:49] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:29:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:29:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:49] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:49] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:50] [INFO ] After 370ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:50] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 1 ms to minimize.
[2024-05-24 06:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-24 06:29:50] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-05-24 06:29:50] [INFO ] After 1696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 71 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 628/628 places, 1634/1634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 324436 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324436 steps, saw 210591 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 06:29:53] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:53] [INFO ] Invariant cache hit.
[2024-05-24 06:29:54] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:54] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:29:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:29:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:29:55] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:55] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:55] [INFO ] After 374ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:55] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 1 ms to minimize.
[2024-05-24 06:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-24 06:29:55] [INFO ] After 870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-24 06:29:56] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 69 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 82 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-24 06:29:56] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:56] [INFO ] Invariant cache hit.
[2024-05-24 06:29:56] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-24 06:29:56] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:56] [INFO ] Invariant cache hit.
[2024-05-24 06:29:56] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:29:58] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2024-05-24 06:29:58] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 06:29:58] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:29:58] [INFO ] Invariant cache hit.
[2024-05-24 06:29:58] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2417 ms. Remains : 628/628 places, 1634/1634 transitions.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 27 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2024-05-24 06:29:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 06:29:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:29:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:58] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 06:29:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 06:29:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:29:58] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:29:58] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 06:29:58] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 06:29:58] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 458 ms.
Product exploration explored 100000 steps with 0 reset in 424 ms.
Built C files in :
/tmp/ltsmin17091095506252902858
[2024-05-24 06:29:59] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:29:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17091095506252902858
Running compilation step : cd /tmp/ltsmin17091095506252902858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2867 ms.
Running link step : cd /tmp/ltsmin17091095506252902858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17091095506252902858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3294788187454625937.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 87 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2024-05-24 06:30:15] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2024-05-24 06:30:15] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 06:30:15] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-24 06:30:15] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:30:15] [INFO ] Invariant cache hit.
[2024-05-24 06:30:15] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-24 06:30:16] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2024-05-24 06:30:16] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:30:16] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2024-05-24 06:30:16] [INFO ] Invariant cache hit.
[2024-05-24 06:30:17] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2539 ms. Remains : 628/628 places, 1634/1634 transitions.
Built C files in :
/tmp/ltsmin7606902214365282801
[2024-05-24 06:30:17] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:30:17] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7606902214365282801
Running compilation step : cd /tmp/ltsmin7606902214365282801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2936 ms.
Running link step : cd /tmp/ltsmin7606902214365282801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7606902214365282801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1130722631451188570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 06:30:32] [INFO ] Flatten gal took : 43 ms
[2024-05-24 06:30:32] [INFO ] Flatten gal took : 41 ms
[2024-05-24 06:30:32] [INFO ] Time to serialize gal into /tmp/LTL14786225014358865526.gal : 7 ms
[2024-05-24 06:30:32] [INFO ] Time to serialize properties into /tmp/LTL7080816582084708297.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14786225014358865526.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7069369318734459686.hoa' '-atoms' '/tmp/LTL7080816582084708297.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7080816582084708297.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7069369318734459686.hoa
Detected timeout of ITS tools.
[2024-05-24 06:30:47] [INFO ] Flatten gal took : 39 ms
[2024-05-24 06:30:47] [INFO ] Flatten gal took : 39 ms
[2024-05-24 06:30:47] [INFO ] Time to serialize gal into /tmp/LTL14098966833902646529.gal : 7 ms
[2024-05-24 06:30:47] [INFO ] Time to serialize properties into /tmp/LTL8668865234756262503.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14098966833902646529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8668865234756262503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l2079<1))"))||("((s1>=1)&&(l1979>=1))")))))
Formula 0 simplified : G(F!"((s0<1)||(l2079<1))" & FG!"((s1>=1)&&(l1979>=1))")
Detected timeout of ITS tools.
[2024-05-24 06:31:02] [INFO ] Flatten gal took : 37 ms
[2024-05-24 06:31:02] [INFO ] Applying decomposition
[2024-05-24 06:31:02] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12639335281363126667.txt' '-o' '/tmp/graph12639335281363126667.bin' '-w' '/tmp/graph12639335281363126667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12639335281363126667.bin' '-l' '-1' '-v' '-w' '/tmp/graph12639335281363126667.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:31:03] [INFO ] Decomposing Gal with order
[2024-05-24 06:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:31:03] [INFO ] Removed a total of 2722 redundant transitions.
[2024-05-24 06:31:03] [INFO ] Flatten gal took : 76 ms
[2024-05-24 06:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1197 labels/synchronizations in 43 ms.
[2024-05-24 06:31:03] [INFO ] Time to serialize gal into /tmp/LTL1110955234204226843.gal : 8 ms
[2024-05-24 06:31:03] [INFO ] Time to serialize properties into /tmp/LTL2239298057358376773.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1110955234204226843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2239298057358376773.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i0.u0.s0<1)||(i28.i3.u157.l2079<1))"))||("((i10.i0.u1.s1>=1)&&(i28.i2.u159.l1979>=1))")))))
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i28.i3.u157.l2079<1))" & FG!"((i10.i0.u1.s1>=1)&&(i28.i2.u159.l1979>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3876294056328689849
[2024-05-24 06:31:18] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3876294056328689849
Running compilation step : cd /tmp/ltsmin3876294056328689849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2776 ms.
Running link step : cd /tmp/ltsmin3876294056328689849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3876294056328689849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 129269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 4 out of 711 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 711/711 places, 1846/1846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 699 transition count 1822
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 699 transition count 1822
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 699 transition count 1818
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 40 place count 687 transition count 1792
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 687 transition count 1792
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 677 transition count 1756
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 677 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 667 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 667 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 657 transition count 1698
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 657 transition count 1698
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 647 transition count 1678
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 647 transition count 1678
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 637 transition count 1658
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 162 place count 627 transition count 1636
Iterating global reduction 1 with 10 rules applied. Total rules applied 172 place count 627 transition count 1636
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 181 place count 618 transition count 1616
Iterating global reduction 1 with 9 rules applied. Total rules applied 190 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 192 place count 616 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 194 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 201 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 612 transition count 1604
Applied a total of 202 rules in 163 ms. Remains 612 /711 variables (removed 99) and now considering 1604/1846 (removed 242) transitions.
[2024-05-24 06:31:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-24 06:31:33] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 06:31:33] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-24 06:31:33] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:33] [INFO ] Invariant cache hit.
[2024-05-24 06:31:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:31:35] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1737 ms to find 0 implicit places.
[2024-05-24 06:31:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:35] [INFO ] Invariant cache hit.
[2024-05-24 06:31:35] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/711 places, 1604/1846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2367 ms. Remains : 612/711 places, 1604/1846 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s0 1) (LT s531 1)) (OR (LT s1 1) (LT s548 1)) (OR (LT s0 1) (LT s531 1)))], 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]]
Product exploration explored 100000 steps with 0 reset in 412 ms.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 519610 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 519610 steps, saw 337258 distinct states, run finished after 3002 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:31:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:40] [INFO ] Invariant cache hit.
[2024-05-24 06:31:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:31:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:31:40] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:31:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:31:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 06:31:40] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:31:40] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:31:41] [INFO ] After 266ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:31:41] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 256 ms.
[2024-05-24 06:31:41] [INFO ] After 1188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 612 transition count 1600
Applied a total of 4 rules in 133 ms. Remains 612 /612 variables (removed 0) and now considering 1600/1604 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 612/612 places, 1600/1604 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518116 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518116 steps, saw 336289 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 06:31:44] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
// Phase 1: matrix 1069 rows 612 cols
[2024-05-24 06:31:44] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 06:31:45] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 06:31:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:31:45] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:31:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 06:31:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:31:45] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:31:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:31:46] [INFO ] After 242ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:31:46] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 3 ms to minimize.
[2024-05-24 06:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-24 06:31:46] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2024-05-24 06:31:46] [INFO ] After 1245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1600/1600 transitions.
Applied a total of 0 rules in 74 ms. Remains 612 /612 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 612/612 places, 1600/1600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1600/1600 transitions.
Applied a total of 0 rules in 66 ms. Remains 612 /612 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2024-05-24 06:31:46] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2024-05-24 06:31:46] [INFO ] Invariant cache hit.
[2024-05-24 06:31:47] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-24 06:31:47] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2024-05-24 06:31:47] [INFO ] Invariant cache hit.
[2024-05-24 06:31:47] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:31:48] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2024-05-24 06:31:48] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:31:48] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2024-05-24 06:31:48] [INFO ] Invariant cache hit.
[2024-05-24 06:31:48] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2266 ms. Remains : 612/612 places, 1600/1600 transitions.
Graph (trivial) has 936 edges and 612 vertex of which 192 / 612 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 723 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 484 transition count 867
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 474 transition count 867
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 21 place count 474 transition count 795
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 165 place count 402 transition count 795
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 228 place count 339 transition count 732
Iterating global reduction 2 with 63 rules applied. Total rules applied 291 place count 339 transition count 732
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 417 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 669 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 732 place count 150 transition count 354
Iterating global reduction 3 with 63 rules applied. Total rules applied 795 place count 150 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 797 place count 150 transition count 352
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 859 place count 88 transition count 228
Iterating global reduction 4 with 62 rules applied. Total rules applied 921 place count 88 transition count 228
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 983 place count 26 transition count 104
Iterating global reduction 4 with 62 rules applied. Total rules applied 1045 place count 26 transition count 104
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1107 place count 26 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1109 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1111 place count 24 transition count 42
Applied a total of 1111 rules in 32 ms. Remains 24 /612 variables (removed 588) and now considering 42/1600 (removed 1558) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-24 06:31:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 06:31:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:31:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 06:31:49] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 06:31:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 06:31:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 06:31:49] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 06:31:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 06:31:49] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 06:31:49] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 06:31:49] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 16 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:31:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-24 06:31:49] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 06:31:49] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-24 06:31:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:49] [INFO ] Invariant cache hit.
[2024-05-24 06:31:50] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:31:51] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-05-24 06:31:51] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:51] [INFO ] Invariant cache hit.
[2024-05-24 06:31:51] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2294 ms. Remains : 612/612 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3415 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=341 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 415 ms.
Product exploration explored 100000 steps with 0 reset in 437 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1602
Applied a total of 2 rules in 157 ms. Remains 612 /612 variables (removed 0) and now considering 1602/1604 (removed 2) transitions.
[2024-05-24 06:31:54] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 06:31:54] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2024-05-24 06:31:54] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 06:31:54] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 612/612 places, 1602/1604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 612/612 places, 1602/1604 transitions.
Built C files in :
/tmp/ltsmin10652083701072185463
[2024-05-24 06:31:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10652083701072185463
Running compilation step : cd /tmp/ltsmin10652083701072185463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10652083701072185463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10652083701072185463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 9 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 06:31:57] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-24 06:31:57] [INFO ] Computed 2 invariants in 7 ms
[2024-05-24 06:31:57] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-24 06:31:57] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:57] [INFO ] Invariant cache hit.
[2024-05-24 06:31:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 06:31:59] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2024-05-24 06:31:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 06:31:59] [INFO ] Invariant cache hit.
[2024-05-24 06:31:59] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2219 ms. Remains : 612/612 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin14997912609497463642
[2024-05-24 06:31:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14997912609497463642
Running compilation step : cd /tmp/ltsmin14997912609497463642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14997912609497463642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14997912609497463642;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 06:32:03] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:32:03] [INFO ] Flatten gal took : 34 ms
[2024-05-24 06:32:03] [INFO ] Time to serialize gal into /tmp/LTL4464777832552186557.gal : 46 ms
[2024-05-24 06:32:03] [INFO ] Time to serialize properties into /tmp/LTL176008397810775039.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4464777832552186557.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1967082686216438190.hoa' '-atoms' '/tmp/LTL176008397810775039.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL176008397810775039.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1967082686216438190.hoa
Detected timeout of ITS tools.
[2024-05-24 06:32:18] [INFO ] Flatten gal took : 33 ms
[2024-05-24 06:32:18] [INFO ] Flatten gal took : 35 ms
[2024-05-24 06:32:18] [INFO ] Time to serialize gal into /tmp/LTL5501306340292833761.gal : 7 ms
[2024-05-24 06:32:18] [INFO ] Time to serialize properties into /tmp/LTL14351954356467496616.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5501306340292833761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14351954356467496616.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((((s0<1)||(l1476<1))&&((s1<1)||(l2624<1)))&&((s0<1)||(l1476<1)))")))))))
Formula 0 simplified : XXXXF!"((((s0<1)||(l1476<1))&&((s1<1)||(l2624<1)))&&((s0<1)||(l1476<1)))"
Detected timeout of ITS tools.
[2024-05-24 06:32:33] [INFO ] Flatten gal took : 35 ms
[2024-05-24 06:32:33] [INFO ] Applying decomposition
[2024-05-24 06:32:33] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16126808400391587915.txt' '-o' '/tmp/graph16126808400391587915.bin' '-w' '/tmp/graph16126808400391587915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16126808400391587915.bin' '-l' '-1' '-v' '-w' '/tmp/graph16126808400391587915.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:32:33] [INFO ] Decomposing Gal with order
[2024-05-24 06:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:32:33] [INFO ] Removed a total of 2662 redundant transitions.
[2024-05-24 06:32:33] [INFO ] Flatten gal took : 64 ms
[2024-05-24 06:32:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1229 labels/synchronizations in 37 ms.
[2024-05-24 06:32:33] [INFO ] Time to serialize gal into /tmp/LTL4030444738642629248.gal : 9 ms
[2024-05-24 06:32:33] [INFO ] Time to serialize properties into /tmp/LTL10575287297879755733.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4030444738642629248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10575287297879755733.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((((i0.u0.s0<1)||(i27.i0.u148.l1476<1))&&((i8.i0.u1.s1<1)||(i0.u156.l2624<1)))&&((i0.u0.s0<1)||(i27.i0.u148.l1476<1)))")...161
Formula 0 simplified : XXXXF!"((((i0.u0.s0<1)||(i27.i0.u148.l1476<1))&&((i8.i0.u1.s1<1)||(i0.u156.l2624<1)))&&((i0.u0.s0<1)||(i27.i0.u148.l1476<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3355952150872790188
[2024-05-24 06:32:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3355952150872790188
Running compilation step : cd /tmp/ltsmin3355952150872790188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2707 ms.
Running link step : cd /tmp/ltsmin3355952150872790188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3355952150872790188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 9815 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c008-LTLFireability-15 finished in 87882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-24 06:33:01] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1431505982119276068
[2024-05-24 06:33:01] [INFO ] Too many transitions (1846) to apply POR reductions. Disabling POR matrices.
[2024-05-24 06:33:01] [INFO ] Applying decomposition
[2024-05-24 06:33:01] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1431505982119276068
Running compilation step : cd /tmp/ltsmin1431505982119276068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 06:33:01] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17067844622153541005.txt' '-o' '/tmp/graph17067844622153541005.bin' '-w' '/tmp/graph17067844622153541005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17067844622153541005.bin' '-l' '-1' '-v' '-w' '/tmp/graph17067844622153541005.weights' '-q' '0' '-e' '0.001'
[2024-05-24 06:33:01] [INFO ] Decomposing Gal with order
[2024-05-24 06:33:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 06:33:01] [INFO ] Removed a total of 3031 redundant transitions.
[2024-05-24 06:33:01] [INFO ] Flatten gal took : 76 ms
[2024-05-24 06:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1615 labels/synchronizations in 46 ms.
[2024-05-24 06:33:01] [INFO ] Time to serialize gal into /tmp/LTLFireability41932680984449910.gal : 10 ms
[2024-05-24 06:33:01] [INFO ] Time to serialize properties into /tmp/LTLFireability3175718601396330947.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability41932680984449910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3175718601396330947.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 2 LTL properties
Checking formula 0 : !((F(G(("((i28.i2.u0.s0<1)||(i29.i0.u164.l2083<1))")||(X(F("((i0.i0.u1.s1>=1)&&(i23.i0.u192.l976>=1))")))))))
Formula 0 simplified : G(F!"((i28.i2.u0.s0<1)||(i29.i0.u164.l2083<1))" & FG!"((i0.i0.u1.s1>=1)&&(i23.i0.u192.l976>=1))")
Compilation finished in 3349 ms.
Running link step : cd /tmp/ltsmin1431505982119276068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1431505982119276068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: LTL layer: formula: <>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.008: "<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.680: There are 1851 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.680: State length is 712, there are 1852 groups
pins2lts-mc-linux64( 0/ 8), 0.680: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.680: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.680: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.680: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.805: [Blue] ~120 levels ~960 states ~3680 transitions
pins2lts-mc-linux64( 1/ 8), 0.996: [Blue] ~240 levels ~1920 states ~6800 transitions
pins2lts-mc-linux64( 5/ 8), 2.728: [Blue] ~366 levels ~3840 states ~15216 transitions
pins2lts-mc-linux64( 2/ 8), 4.969: [Blue] ~960 levels ~7680 states ~42808 transitions
pins2lts-mc-linux64( 2/ 8), 9.202: [Blue] ~1920 levels ~15360 states ~85048 transitions
pins2lts-mc-linux64( 2/ 8), 13.614: [Blue] ~3840 levels ~30720 states ~169528 transitions
pins2lts-mc-linux64( 1/ 8), 18.780: [Blue] ~7680 levels ~61440 states ~200240 transitions
pins2lts-mc-linux64( 1/ 8), 27.827: [Blue] ~15360 levels ~122880 states ~399920 transitions
pins2lts-mc-linux64( 1/ 8), 46.425: [Blue] ~30720 levels ~245760 states ~799280 transitions
pins2lts-mc-linux64( 1/ 8), 68.980: [Blue] ~61440 levels ~491520 states ~1598000 transitions
pins2lts-mc-linux64( 1/ 8), 96.301: [Blue] ~122880 levels ~983040 states ~3195440 transitions
pins2lts-mc-linux64( 1/ 8), 150.480: [Blue] ~245760 levels ~1966080 states ~6390320 transitions
pins2lts-mc-linux64( 1/ 8), 258.669: [Blue] ~491520 levels ~3932160 states ~12780080 transitions
pins2lts-mc-linux64( 5/ 8), 315.530: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 315.589:
pins2lts-mc-linux64( 0/ 8), 315.589: Explored 4782007 states 26251677 transitions, fanout: 5.490
pins2lts-mc-linux64( 0/ 8), 315.589: Total exploration time 314.910 sec (314.810 sec minimum, 314.850 sec on average)
pins2lts-mc-linux64( 0/ 8), 315.589: States per second: 15185, Transitions per second: 83362
pins2lts-mc-linux64( 0/ 8), 315.589:
pins2lts-mc-linux64( 0/ 8), 315.589: State space has 24010311 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 315.589: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 315.589: blue states: 4782007 (19.92%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 315.589: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 315.589: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 315.589:
pins2lts-mc-linux64( 0/ 8), 315.589: Total memory used for local state coloring: 66.3MB
pins2lts-mc-linux64( 0/ 8), 315.589:
pins2lts-mc-linux64( 0/ 8), 315.589: Queue width: 8B, total height: 4346670, memory: 33.16MB
pins2lts-mc-linux64( 0/ 8), 315.589: Tree memory: 439.2MB, 19.2 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 315.589: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 315.589: Stored 1873 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 315.590: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 315.590: Est. total memory use: 472.3MB (~1057.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1431505982119276068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1431505982119276068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 06:55:38] [INFO ] Flatten gal took : 48 ms
[2024-05-24 06:55:38] [INFO ] Time to serialize gal into /tmp/LTLFireability2656727494986988473.gal : 8 ms
[2024-05-24 06:55:38] [INFO ] Time to serialize properties into /tmp/LTLFireability6712237956891794463.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2656727494986988473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6712237956891794463.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
Detected timeout of ITS tools.
[2024-05-24 07:18:16] [INFO ] Flatten gal took : 328 ms
[2024-05-24 07:18:34] [INFO ] Input system was already deterministic with 1846 transitions.
[2024-05-24 07:18:34] [INFO ] Transformed 711 places.
[2024-05-24 07:18:35] [INFO ] Transformed 1846 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 07:18:35] [INFO ] Time to serialize gal into /tmp/LTLFireability16211552839639349559.gal : 15 ms
[2024-05-24 07:18:35] [INFO ] Time to serialize properties into /tmp/LTLFireability17384044496275217603.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16211552839639349559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17384044496275217603.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((s0<1)||(l2083<1))")||(X(F("((s1>=1)&&(l976>=1))")))))))
Formula 0 simplified : G(F!"((s0<1)||(l2083<1))" & FG!"((s1>=1)&&(l976>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6034716 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16171612 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c008"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-c008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625100183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;