About the Execution of 2023-gold for ClientsAndServers-PT-N0020P2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8573.575 | 3600000.00 | 4009776.00 | 10234.40 | FFFFTFFFFT?FFFFF | 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.r087-tall-171620521900288.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 ClientsAndServers-PT-N0020P2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521900288
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 23:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 23:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 23:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P2-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716256171962
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=ClientsAndServers-PT-N0020P2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 01:49:33] [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-21 01:49:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 01:49:33] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-21 01:49:33] [INFO ] Transformed 25 places.
[2024-05-21 01:49:33] [INFO ] Transformed 18 transitions.
[2024-05-21 01:49:33] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 14 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-21 01:49:33] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 01:49:33] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 01:49:33] [INFO ] Invariant cache hit.
[2024-05-21 01:49:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 01:49:33] [INFO ] Invariant cache hit.
[2024-05-21 01:49:33] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2024-05-21 01:49:34] [INFO ] Flatten gal took : 16 ms
[2024-05-21 01:49:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 01:49:34] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10003 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 01:49:34] [INFO ] Invariant cache hit.
[2024-05-21 01:49:34] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 19 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 15 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 01:49:34] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 01:49:34] [INFO ] Implicit Places using invariants in 36 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 01:49:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 01:49:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 01:49:34] [INFO ] Invariant cache hit.
[2024-05-21 01:49:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 8/24 places, 7/18 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 222 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s2 1) (LT s7 1)), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-01 finished in 386 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&&(X(p2)||p1)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 9 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 01:49:35] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 01:49:35] [INFO ] Implicit Places using invariants in 37 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s0 1) (GEQ s13 1))), p0:(OR (GEQ s17 1) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s0 1) (GEQ s13 1))), p2:(AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 43498 steps with 0 reset in 154 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-02 finished in 315 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||(F(!p1) U p2))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 17 transition count 12
Applied a total of 13 rules in 3 ms. Remains 17 /24 variables (removed 7) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-05-21 01:49:35] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 01:49:35] [INFO ] Implicit Places using invariants in 36 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/24 places, 12/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 11
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-21 01:49:35] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 01:49:35] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/24 places, 11/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 71 ms. Remains : 14/24 places, 11/18 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s12 1) (OR (LT s2 1) (LT s9 1))), p2:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10199 reset in 126 ms.
Product exploration explored 100000 steps with 10227 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
// Phase 1: matrix 11 rows 14 cols
[2024-05-21 01:49:36] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 01:49:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-21 01:49:36] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:36] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-21 01:49:36] [INFO ] Invariant cache hit.
[2024-05-21 01:49:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 01:49:36] [INFO ] Invariant cache hit.
[2024-05-21 01:49:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 01:49:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 01:49:36] [INFO ] Invariant cache hit.
[2024-05-21 01:49:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 14/14 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-21 01:49:36] [INFO ] Invariant cache hit.
[2024-05-21 01:49:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 01:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 01:49:36] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:36] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10204 reset in 102 ms.
Product exploration explored 100000 steps with 10251 reset in 106 ms.
Built C files in :
/tmp/ltsmin15852384745731745918
[2024-05-21 01:49:36] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-21 01:49:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:36] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-21 01:49:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:36] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-21 01:49:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15852384745731745918
Running compilation step : cd /tmp/ltsmin15852384745731745918;'/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 178 ms.
Running link step : cd /tmp/ltsmin15852384745731745918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15852384745731745918;'/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/stateBased15137242999903413832.hoa' '--buchi-type=spotba'
LTSmin run took 672 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-04 finished in 2466 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))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 01:49:37] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 01:49:37] [INFO ] Implicit Places using invariants in 32 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s19 1)) (GEQ s12 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-05 finished in 170 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 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 01:49:37] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 01:49:38] [INFO ] Implicit Places using invariants in 38 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s9 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 1518 reset in 105 ms.
Product exploration explored 100000 steps with 1523 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 654 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=327 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 01:49:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 01:49:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:38] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:49:38] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 01:49:38] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 4 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 01:49:38] [INFO ] Computed 3 invariants in 6 ms
[2024-05-21 01:49:38] [INFO ] Implicit Places using invariants in 26 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 6/20 places, 5/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 446 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=223 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 01:49:39] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 01:49:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 01:49:39] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:39] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10203 reset in 78 ms.
Product exploration explored 100000 steps with 10216 reset in 81 ms.
Built C files in :
/tmp/ltsmin1941980866451774902
[2024-05-21 01:49:39] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 01:49:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:39] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 01:49:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:39] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 01:49:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1941980866451774902
Running compilation step : cd /tmp/ltsmin1941980866451774902;'/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 72 ms.
Running link step : cd /tmp/ltsmin1941980866451774902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1941980866451774902;'/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/stateBased5236163852334756614.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-06 finished in 1645 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 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 01:49:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 01:49:39] [INFO ] Implicit Places using invariants in 32 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s17 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 1222 reset in 88 ms.
Product exploration explored 100000 steps with 1214 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1346 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=448 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 01:49:40] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 01:49:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:49:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 01:49:40] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:40] [INFO ] Added : 14 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 11 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 8 transition count 6
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 2 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 3 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 01:49:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 01:49:40] [INFO ] Implicit Places using invariants in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25 ms. Remains : 6/20 places, 5/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 01:49:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 01:49:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 01:49:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 01:49:40] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:40] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10297 reset in 50 ms.
Product exploration explored 100000 steps with 10293 reset in 62 ms.
Built C files in :
/tmp/ltsmin10335750031995191517
[2024-05-21 01:49:41] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 01:49:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:41] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 01:49:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:41] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 01:49:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:41] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10335750031995191517
Running compilation step : cd /tmp/ltsmin10335750031995191517;'/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 80 ms.
Running link step : cd /tmp/ltsmin10335750031995191517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10335750031995191517;'/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/stateBased14191179686393232897.hoa' '--buchi-type=spotba'
LTSmin run took 251 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-07 finished in 1769 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||(p1&&F(!p0)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 4 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 01:49:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 01:49:41] [INFO ] Implicit Places using invariants in 38 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
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 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 01:49:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 01:49:41] [INFO ] Implicit Places using invariants in 23 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 71 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10215 reset in 53 ms.
Product exploration explored 100000 steps with 10222 reset in 62 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 7 rows 8 cols
[2024-05-21 01:49:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 01:49:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 01:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 01:49:42] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:42] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-21 01:49:42] [INFO ] Invariant cache hit.
[2024-05-21 01:49:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 01:49:42] [INFO ] Invariant cache hit.
[2024-05-21 01:49:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-21 01:49:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 01:49:42] [INFO ] Invariant cache hit.
[2024-05-21 01:49:42] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 8/8 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-21 01:49:42] [INFO ] Invariant cache hit.
[2024-05-21 01:49:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 01:49:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 01:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 01:49:42] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 01:49:42] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10229 reset in 59 ms.
Product exploration explored 100000 steps with 10216 reset in 56 ms.
Built C files in :
/tmp/ltsmin11895753848356453352
[2024-05-21 01:49:42] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 01:49:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:42] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 01:49:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:42] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 01:49:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:49:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11895753848356453352
Running compilation step : cd /tmp/ltsmin11895753848356453352;'/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 84 ms.
Running link step : cd /tmp/ltsmin11895753848356453352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11895753848356453352;'/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/stateBased14294012632077430088.hoa' '--buchi-type=spotba'
LTSmin run took 197 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-08 finished in 1565 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' '!(((!p0 U p1) U X((p2||G(!p3)||F(p4)))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 01:49:42] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 01:49:43] [INFO ] Implicit Places using invariants in 31 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3 (NOT p4)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))), acceptance={} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p4)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 p3 (NOT p4)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p4)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p4)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GEQ s10 1), p0:(OR (AND (GEQ s0 1) (GEQ s13 1)) (GEQ s10 1)), p2:(AND (GEQ s7 1) (GEQ s19 1)), p3:(OR (LT s5 1) (LT s14 1)), p4:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4543 reset in 97 ms.
Product exploration explored 100000 steps with 4494 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4)))), (X (AND (NOT p2) p3 (NOT p4))), (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND p3 (NOT p4)))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 201 ms. Reduced automaton from 8 states, 22 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 19) seen :17
Finished Best-First random walk after 2328 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=258 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4)))), (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4))), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4)))), (X (AND (NOT p2) p3 (NOT p4))), (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2) p3 (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND p3 (NOT p4)))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (AND (NOT p1) (NOT p0) p3 (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (F (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0))), (F (AND (NOT p1) (NOT p3) (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0)), (F (AND (NOT p1) p3 (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) (NOT p4) p0)), (F (AND (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p2) p3 (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p4) (NOT p0)))), (F (AND (NOT p1) (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) p3 (NOT p4) p0)), (F (NOT (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (F (AND (NOT p2) (NOT p3) (NOT p4))), (F (NOT (AND p3 (NOT p4)))), (F p4)]
Knowledge based reduction with 30 factoid took 1042 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 01:49:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 01:49:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 01:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 01:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 01:49:46] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:46] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p2) p3 (NOT p4))
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 01:49:46] [INFO ] Invariant cache hit.
[2024-05-21 01:49:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 01:49:46] [INFO ] Invariant cache hit.
[2024-05-21 01:49:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 01:49:46] [INFO ] Invariant cache hit.
[2024-05-21 01:49:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p4) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0))), (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0))), (X (X (AND (NOT p1) (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0)))), (X (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0)))))), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))))), (X (X (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (X (X (AND p3 (NOT p4)))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) p3 (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 179 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Finished random walk after 3735 steps, including 1 resets, run visited all 19 properties in 7 ms. (steps per millisecond=533 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p3 (NOT p4) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0))), (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0))), (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0))), (X (X (AND (NOT p1) (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) p0)))), (X (X (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0)))))), (X (X (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))))), (X (X (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (X (X (AND p3 (NOT p4)))), (X (X (AND (NOT p2) p3 (NOT p4)))), (X (X (NOT (AND (NOT p1) p3 (NOT p4) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (F (NOT (OR (AND p1 (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p0))))), (F (AND (NOT p1) (NOT p3) (NOT p4) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) (NOT p0))), (F (AND (NOT p1) (NOT p3) (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4) p0)), (F (AND (NOT p1) p3 (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) (NOT p4) p0)), (F (AND (NOT p3) (NOT p4))), (F (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p2) p3 (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p4) (NOT p0)))), (F (AND (NOT p1) (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) p3 (NOT p4) p0)), (F (NOT (AND (NOT p1) p3 (NOT p4) (NOT p0)))), (F (AND (NOT p2) (NOT p3) (NOT p4))), (F (NOT (AND p3 (NOT p4)))), (F p4)]
Knowledge based reduction with 28 factoid took 1060 ms. Reduced automaton from 8 states, 21 edges and 5 AP (stutter sensitive) to 8 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
[2024-05-21 01:49:48] [INFO ] Invariant cache hit.
[2024-05-21 01:49:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 01:49:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:49:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 01:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:49:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 01:49:48] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:49:48] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p2) p3 (NOT p4))
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Product exploration explored 100000 steps with 4497 reset in 87 ms.
Product exploration explored 100000 steps with 4553 reset in 100 ms.
Applying partial POR strategy [false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p2) p3 (NOT p4)), (AND (NOT p4) p3 (NOT p2)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (NOT p4), (AND (NOT p4) p3), (AND (NOT p1) p3 (NOT p4)), (AND (NOT p1) (NOT p4))]
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 20 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 8 rules in 10 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2024-05-21 01:49:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2024-05-21 01:49:49] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 01:49:49] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 20/21 places, 17/18 transitions.
Built C files in :
/tmp/ltsmin2511719875952224148
[2024-05-21 01:49:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2511719875952224148
Running compilation step : cd /tmp/ltsmin2511719875952224148;'/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 99 ms.
Running link step : cd /tmp/ltsmin2511719875952224148;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2511719875952224148;'/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/stateBased2389450210275369925.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 01:50:04] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 01:50:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 01:50:05] [INFO ] Invariant cache hit.
[2024-05-21 01:50:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-21 01:50:05] [INFO ] Invariant cache hit.
[2024-05-21 01:50:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5285435166861303826
[2024-05-21 01:50:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5285435166861303826
Running compilation step : cd /tmp/ltsmin5285435166861303826;'/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 91 ms.
Running link step : cd /tmp/ltsmin5285435166861303826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5285435166861303826;'/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/stateBased13004385632828499573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 01:50:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:50:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:50:20] [INFO ] Time to serialize gal into /tmp/LTL2454116825843129737.gal : 1 ms
[2024-05-21 01:50:20] [INFO ] Time to serialize properties into /tmp/LTL16410682629045590159.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2454116825843129737.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17425689656102912919.hoa' '-atoms' '/tmp/LTL16410682629045590159.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...319
Loading property file /tmp/LTL16410682629045590159.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17425689656102912919.hoa
Detected timeout of ITS tools.
[2024-05-21 01:50:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:50:35] [INFO ] Flatten gal took : 2 ms
[2024-05-21 01:50:35] [INFO ] Time to serialize gal into /tmp/LTL8235462368167853399.gal : 1 ms
[2024-05-21 01:50:35] [INFO ] Time to serialize properties into /tmp/LTL5037685376973403481.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/LTL8235462368167853399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5037685376973403481.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...275
Read 1 LTL properties
Checking formula 0 : !((((!("(((Uf>=1)&&(MwU>=1))||(MtF>=1))"))U("(MtF>=1)"))U(X(((G(!("((CF<1)||(Si<1))")))||(F("(SpG>=1)")))||("((CG>=1)&&(CwG>=1))")))))
Formula 0 simplified : ("(((Uf>=1)&&(MwU>=1))||(MtF>=1))" R !"(MtF>=1)") R X(!"((CG>=1)&&(CwG>=1))" & F"((CF<1)||(Si<1))" & G!"(SpG>=1)")
Detected timeout of ITS tools.
[2024-05-21 01:50:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:50:50] [INFO ] Applying decomposition
[2024-05-21 01:50:50] [INFO ] Flatten gal took : 16 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/graph2091162623145158975.txt' '-o' '/tmp/graph2091162623145158975.bin' '-w' '/tmp/graph2091162623145158975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2091162623145158975.bin' '-l' '-1' '-v' '-w' '/tmp/graph2091162623145158975.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:50:50] [INFO ] Decomposing Gal with order
[2024-05-21 01:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:50:50] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 01:50:50] [INFO ] Flatten gal took : 54 ms
[2024-05-21 01:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 01:50:50] [INFO ] Time to serialize gal into /tmp/LTL1176182483528406808.gal : 3 ms
[2024-05-21 01:50:50] [INFO ] Time to serialize properties into /tmp/LTL16721122018913176910.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/LTL1176182483528406808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16721122018913176910.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 : !((((!("(((u5.Uf>=1)&&(u1.MwU>=1))||(u0.MtF>=1))"))U("(u0.MtF>=1)"))U(X(((G(!("((u3.CF<1)||(u1.Si<1))")))||(F("(u5.SpG>=1)")))||("((u3...182
Formula 0 simplified : ("(((u5.Uf>=1)&&(u1.MwU>=1))||(u0.MtF>=1))" R !"(u0.MtF>=1)") R X(!"((u3.CG>=1)&&(u3.CwG>=1))" & F"((u3.CF<1)||(u1.Si<1))" & G!"(u5....164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2485257442604296911
[2024-05-21 01:51:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2485257442604296911
Running compilation step : cd /tmp/ltsmin2485257442604296911;'/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 80 ms.
Running link step : cd /tmp/ltsmin2485257442604296911;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2485257442604296911;'/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) U (LTLAPp1==true)) U X(([](!(LTLAPp2==true))||<>((LTLAPp3==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-10 finished in 97703 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(p0)||X(F((p1&&F(p0))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 01:51:20] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 01:51:20] [INFO ] Implicit Places using invariants in 39 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p1:(GEQ s17 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 1915 reset in 98 ms.
Product exploration explored 100000 steps with 1943 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 6370 steps, including 2 resets, run visited all 4 properties in 13 ms. (steps per millisecond=490 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 223 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 01:51:21] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 01:51:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 01:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:51:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:51:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 01:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:51:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 01:51:22] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:51:22] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 01:51:22] [INFO ] Invariant cache hit.
[2024-05-21 01:51:22] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-21 01:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:51:22] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 01:51:22] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:51:22] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 12 transition count 9
Applied a total of 18 rules in 4 ms. Remains 12 /21 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 01:51:22] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 01:51:22] [INFO ] Implicit Places using invariants in 45 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 11/21 places, 9/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 86 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Finished random walk after 5354 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=1070 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 9 rows 11 cols
[2024-05-21 01:51:23] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 01:51:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:51:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:51:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:51:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:51:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:51:23] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 01:51:23] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:51:23] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 01:51:23] [INFO ] Invariant cache hit.
[2024-05-21 01:51:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:51:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:51:23] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:51:23] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4514 reset in 66 ms.
Product exploration explored 100000 steps with 4534 reset in 72 ms.
Built C files in :
/tmp/ltsmin314803898951786060
[2024-05-21 01:51:23] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-21 01:51:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:51:23] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-21 01:51:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:51:23] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-21 01:51:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:51:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin314803898951786060
Running compilation step : cd /tmp/ltsmin314803898951786060;'/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 89 ms.
Running link step : cd /tmp/ltsmin314803898951786060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin314803898951786060;'/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/stateBased6894180106161464564.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-11 finished in 3087 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 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 10 transition count 7
Applied a total of 25 rules in 3 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 01:51:23] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 01:51:23] [INFO ] Implicit Places using invariants in 24 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 4
Applied a total of 6 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 01:51:23] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 01:51:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 01:51:23] [INFO ] Invariant cache hit.
[2024-05-21 01:51:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 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 1 reset in 57 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-12 finished in 184 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((p0 U !p1)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 12 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 01:51:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 01:51:23] [INFO ] Implicit Places using invariants in 24 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 01:51:23] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 01:51:24] [INFO ] Implicit Places using invariants in 24 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 66 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, true, p1]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s10 1), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-13 finished in 174 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)&&X(!p1))||X(G(!p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 01:51:24] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 01:51:24] [INFO ] Implicit Places using invariants in 30 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[p1, p1, (AND p0 p1), true, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s10 1), p1:(OR (NOT (OR (GEQ s17 1) (AND (GEQ s11 1) (GEQ s16 1)))) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-14 finished in 214 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(X((X(p2)&&p1))) U p3)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 01:51:24] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 01:51:24] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p3), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, (NOT p2), (OR (AND (NOT p1) p2) (AND p1 (NOT p2))), p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1) p2) (AND p0 p1 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p3 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p3 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 3}, { cond=(AND p0 p1), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(GEQ s19 1), p0:(OR (GEQ s6 1) (LT s12 1)), p1:(AND (GEQ s4 1) (GEQ s18 1)), p2:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P2-LTLFireability-15 finished in 414 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' '!(((!p0 U p1) U X((p2||G(!p3)||F(p4)))))'
[2024-05-21 01:51:24] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin459554021667076614
[2024-05-21 01:51:24] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 01:51:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:51:24] [INFO ] Applying decomposition
[2024-05-21 01:51:24] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 01:51:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:51:24] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 01:51:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:51:24] [INFO ] Flatten gal took : 1 ms
[2024-05-21 01:51:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin459554021667076614
Running compilation step : cd /tmp/ltsmin459554021667076614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
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/graph11987571384967357170.txt' '-o' '/tmp/graph11987571384967357170.bin' '-w' '/tmp/graph11987571384967357170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11987571384967357170.bin' '-l' '-1' '-v' '-w' '/tmp/graph11987571384967357170.weights' '-q' '0' '-e' '0.001'
[2024-05-21 01:51:24] [INFO ] Decomposing Gal with order
[2024-05-21 01:51:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 01:51:24] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 01:51:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:51:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 01:51:24] [INFO ] Time to serialize gal into /tmp/LTLFireability13962962073326475628.gal : 12 ms
[2024-05-21 01:51:24] [INFO ] Time to serialize properties into /tmp/LTLFireability3183706854851088798.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/LTLFireability13962962073326475628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3183706854851088798.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...277
Read 1 LTL properties
Checking formula 0 : !((((!("(((i3.u6.Uf>=1)&&(i3.u1.MwU>=1))||(i3.u5.MtF>=1))"))U("(i3.u5.MtF>=1)"))U(X((("((i4.u7.CG>=1)&&(i1.u8.CwG>=1))")||(G(!("((i1.u...209
Formula 0 simplified : ("(((i3.u6.Uf>=1)&&(i3.u1.MwU>=1))||(i3.u5.MtF>=1))" R !"(i3.u5.MtF>=1)") R X(!"((i4.u7.CG>=1)&&(i1.u8.CwG>=1))" & F"((i1.u2.CF<1)||...191
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin459554021667076614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin459554021667076614;'/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) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==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.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: ((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))
pins2lts-mc-linux64( 0/ 8), 0.002: "((!(LTLAPp0==true) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: buchi has 9 states
pins2lts-mc-linux64( 0/ 8), 0.020: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.020: State length is 25, there are 49 groups
pins2lts-mc-linux64( 0/ 8), 0.020: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.020: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.020: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.020: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.054: [Blue] ~81 levels ~960 states ~2144 transitions
pins2lts-mc-linux64( 0/ 8), 0.077: [Blue] ~225 levels ~1920 states ~5136 transitions
pins2lts-mc-linux64( 7/ 8), 0.100: [Blue] ~349 levels ~3840 states ~9312 transitions
pins2lts-mc-linux64( 7/ 8), 0.127: [Blue] ~359 levels ~7680 states ~16952 transitions
pins2lts-mc-linux64( 7/ 8), 0.179: [Blue] ~359 levels ~15360 states ~34064 transitions
pins2lts-mc-linux64( 7/ 8), 0.289: [Blue] ~359 levels ~30720 states ~72336 transitions
pins2lts-mc-linux64( 7/ 8), 0.501: [Blue] ~359 levels ~61440 states ~154408 transitions
pins2lts-mc-linux64( 7/ 8), 0.793: [Blue] ~359 levels ~122880 states ~322336 transitions
pins2lts-mc-linux64( 6/ 8), 2.455: [Blue] ~356 levels ~245760 states ~618920 transitions
pins2lts-mc-linux64( 6/ 8), 3.417: [Blue] ~356 levels ~491520 states ~1239720 transitions
pins2lts-mc-linux64( 6/ 8), 5.541: [Blue] ~356 levels ~983040 states ~2479912 transitions
pins2lts-mc-linux64( 6/ 8), 9.089: [Blue] ~356 levels ~1966080 states ~5429144 transitions
pins2lts-mc-linux64( 7/ 8), 12.441: [Blue] ~359 levels ~3932160 states ~11004408 transitions
pins2lts-mc-linux64( 7/ 8), 17.921: [Blue] ~359 levels ~7864320 states ~24191552 transitions
pins2lts-mc-linux64( 3/ 8), 28.288: [Blue] ~355 levels ~15728640 states ~38556360 transitions
pins2lts-mc-linux64( 3/ 8), 50.794: [Blue] ~355 levels ~31457280 states ~82280048 transitions
pins2lts-mc-linux64( 4/ 8), 70.711: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 70.777:
pins2lts-mc-linux64( 0/ 8), 70.777: Explored 36212406 states 119560658 transitions, fanout: 3.302
pins2lts-mc-linux64( 0/ 8), 70.777: Total exploration time 70.730 sec (70.660 sec minimum, 70.701 sec on average)
pins2lts-mc-linux64( 0/ 8), 70.777: States per second: 511981, Transitions per second: 1690381
pins2lts-mc-linux64( 0/ 8), 70.777:
pins2lts-mc-linux64( 0/ 8), 70.777: State space has 31815775 states, 23489030 are accepting
pins2lts-mc-linux64( 0/ 8), 70.777: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 70.777: blue states: 36212406 (113.82%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 70.777: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 70.777: all-red states: 23491685 (73.84%), bogus 2315778 (7.28%)
pins2lts-mc-linux64( 0/ 8), 70.777:
pins2lts-mc-linux64( 0/ 8), 70.777: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 70.777:
pins2lts-mc-linux64( 0/ 8), 70.777: Queue width: 8B, total height: 2863, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 70.777: Tree memory: 498.7MB, 16.4 B/state, compr.: 16.1%
pins2lts-mc-linux64( 0/ 8), 70.777: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 70.777: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 70.777: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 70.777: Est. total memory use: 498.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin459554021667076614;'/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) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin459554021667076614;'/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) U (LTLAPp1==true)) U X(((LTLAPp2==true)||[](!(LTLAPp3==true))||<>((LTLAPp4==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-21 02:12:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:12:02] [INFO ] Time to serialize gal into /tmp/LTLFireability12317799066399882136.gal : 0 ms
[2024-05-21 02:12:02] [INFO ] Time to serialize properties into /tmp/LTLFireability10512819197566205687.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/LTLFireability12317799066399882136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10512819197566205687.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...299
Read 1 LTL properties
Checking formula 0 : !((((!("(((Uf>=1)&&(MwU>=1))||(MtF>=1))"))U("(MtF>=1)"))U(X((("((CG>=1)&&(CwG>=1))")||(G(!("((CF<1)||(Si<1))"))))||(F("(SpG>=1)"))))))
Formula 0 simplified : ("(((Uf>=1)&&(MwU>=1))||(MtF>=1))" R !"(MtF>=1)") R X(!"((CG>=1)&&(CwG>=1))" & F"((CF<1)||(Si<1))" & G!"(SpG>=1)")
Detected timeout of ITS tools.
[2024-05-21 02:32:39] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:32:39] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 02:32:39] [INFO ] Transformed 24 places.
[2024-05-21 02:32:39] [INFO ] Transformed 18 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-21 02:32:39] [INFO ] Time to serialize gal into /tmp/LTLFireability17452536147678284239.gal : 1 ms
[2024-05-21 02:32:39] [INFO ] Time to serialize properties into /tmp/LTLFireability8721507392448662406.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/LTLFireability17452536147678284239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8721507392448662406.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((!("(((Uf>=1)&&(MwU>=1))||(MtF>=1))"))U("(MtF>=1)"))U(X((("((CG>=1)&&(CwG>=1))")||(G(!("((CF<1)||(Si<1))"))))||(F("(SpG>=1)"))))))
Formula 0 simplified : ("(((Uf>=1)&&(MwU>=1))||(MtF>=1))" R !"(MtF>=1)") R X(!"((CG>=1)&&(CwG>=1))" & F"((CF<1)||(Si<1))" & G!"(SpG>=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10419020 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16041616 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ClientsAndServers-PT-N0020P2"
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 ClientsAndServers-PT-N0020P2, 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 r087-tall-171620521900288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P2.tgz
mv ClientsAndServers-PT-N0020P2 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 ;