About the Execution of 2023-gold for CANInsertWithFailure-PT-060
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.172 | 3600000.00 | 3297486.00 | 382277.00 | ?FFT?FFFFF?FFFF? | 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-171620521500088.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 CANInsertWithFailure-PT-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500088
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22M 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 CANInsertWithFailure-PT-060-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-060-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716234509123
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=CANInsertWithFailure-PT-060
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 19:48:30] [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-20 19:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 19:48:31] [INFO ] Load time of PNML (sax parser for PT used): 560 ms
[2024-05-20 19:48:31] [INFO ] Transformed 7924 places.
[2024-05-20 19:48:31] [INFO ] Transformed 21960 transitions.
[2024-05-20 19:48:31] [INFO ] Parsed PT model containing 7924 places and 21960 transitions and 58800 arcs in 709 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 7924 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7924/7924 places, 21960/21960 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7923 transition count 21960
Applied a total of 1 rules in 1749 ms. Remains 7923 /7924 variables (removed 1) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:48:35] [INFO ] Computed 62 invariants in 2519 ms
[2024-05-20 19:48:36] [INFO ] Implicit Places using invariants in 3411 ms returned []
Implicit Place search using SMT only with invariants took 3437 ms to find 0 implicit places.
[2024-05-20 19:48:36] [INFO ] Invariant cache hit.
[2024-05-20 19:48:37] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7923/7924 places, 21960/21960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6053 ms. Remains : 7923/7924 places, 21960/21960 transitions.
Support contains 44 out of 7923 places after structural reductions.
[2024-05-20 19:48:38] [INFO ] Flatten gal took : 821 ms
[2024-05-20 19:48:39] [INFO ] Flatten gal took : 531 ms
[2024-05-20 19:48:40] [INFO ] Input system was already deterministic with 21960 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 29) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-20 19:48:41] [INFO ] Invariant cache hit.
[2024-05-20 19:48:44] [INFO ] [Real]Absence check using 60 positive place invariants in 93 ms returned sat
[2024-05-20 19:48:44] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 122 ms returned sat
[2024-05-20 19:49:03] [INFO ] After 17690ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-05-20 19:49:03] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:49:06] [INFO ] After 3091ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :15
[2024-05-20 19:49:06] [INFO ] After 3097ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-20 19:49:06] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 22 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 414 transitions
Trivial Post-agglo rules discarded 414 transitions
Performed 414 trivial Post agglomeration. Transition count delta: 414
Iterating post reduction 0 with 414 rules applied. Total rules applied 414 place count 7923 transition count 21546
Reduce places removed 414 places and 0 transitions.
Iterating post reduction 1 with 414 rules applied. Total rules applied 828 place count 7509 transition count 21546
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 828 place count 7509 transition count 21545
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 830 place count 7508 transition count 21545
Performed 3533 Post agglomeration using F-continuation condition.Transition count delta: 3533
Deduced a syphon composed of 3533 places in 14 ms
Reduce places removed 3533 places and 0 transitions.
Iterating global reduction 2 with 7066 rules applied. Total rules applied 7896 place count 3975 transition count 18012
Drop transitions removed 3416 transitions
Redundant transition composition rules discarded 3416 transitions
Iterating global reduction 2 with 3416 rules applied. Total rules applied 11312 place count 3975 transition count 14596
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11318 place count 3975 transition count 14590
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 11324 place count 3969 transition count 14590
Partial Free-agglomeration rule applied 3652 times.
Drop transitions removed 3652 transitions
Iterating global reduction 3 with 3652 rules applied. Total rules applied 14976 place count 3969 transition count 14590
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15036 place count 3969 transition count 14590
Applied a total of 15036 rules in 7410 ms. Remains 3969 /7923 variables (removed 3954) and now considering 14590/21960 (removed 7370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7414 ms. Remains : 3969/7923 places, 14590/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14590 rows 3969 cols
[2024-05-20 19:49:15] [INFO ] Computed 62 invariants in 531 ms
[2024-05-20 19:49:15] [INFO ] [Real]Absence check using 60 positive place invariants in 48 ms returned sat
[2024-05-20 19:49:16] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 51 ms returned sat
[2024-05-20 19:49:21] [INFO ] After 5261ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-20 19:49:21] [INFO ] State equation strengthened by 14382 read => feed constraints.
[2024-05-20 19:49:28] [INFO ] After 6709ms SMT Verify possible using 14382 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 19:49:28] [INFO ] After 12953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 19:49:28] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 19:49:28] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:49:34] [INFO ] After 5191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 19:49:42] [INFO ] After 8109ms SMT Verify possible using 14382 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 19:49:44] [INFO ] After 10491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1541 ms.
[2024-05-20 19:49:46] [INFO ] After 18036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 19 ms.
Support contains 2 out of 3969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3969/3969 places, 14590/14590 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 3964 transition count 14585
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3964 transition count 14585
Applied a total of 20 rules in 2030 ms. Remains 3964 /3969 variables (removed 5) and now considering 14585/14590 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2030 ms. Remains : 3964/3969 places, 14585/14590 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 66508 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66508 steps, saw 31228 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14585 rows 3964 cols
[2024-05-20 19:49:52] [INFO ] Computed 62 invariants in 523 ms
[2024-05-20 19:49:52] [INFO ] [Real]Absence check using 60 positive place invariants in 47 ms returned sat
[2024-05-20 19:49:52] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:49:57] [INFO ] After 4652ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 19:49:57] [INFO ] State equation strengthened by 14400 read => feed constraints.
[2024-05-20 19:50:00] [INFO ] After 2860ms SMT Verify possible using 14400 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:50:00] [INFO ] After 8151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:50:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 46 ms returned sat
[2024-05-20 19:50:00] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 19:50:05] [INFO ] After 4932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:50:07] [INFO ] After 1350ms SMT Verify possible using 14400 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:50:07] [INFO ] After 1889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 386 ms.
[2024-05-20 19:50:08] [INFO ] After 7740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 7 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-060-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CANInsertWithFailure-PT-060-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 420 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' '!(F((p0||G(p1))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 7923 transition count 21541
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3539 Post agglomeration using F-continuation condition.Transition count delta: 3539
Deduced a syphon composed of 3539 places in 5 ms
Reduce places removed 3539 places and 0 transitions.
Iterating global reduction 2 with 7078 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3421 transitions
Redundant transition composition rules discarded 3421 transitions
Iterating global reduction 2 with 3421 rules applied. Total rules applied 11337 place count 3965 transition count 14581
Applied a total of 11337 rules in 3625 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14581/21960 (removed 7379) transitions.
// Phase 1: matrix 14581 rows 3965 cols
[2024-05-20 19:50:13] [INFO ] Computed 62 invariants in 920 ms
[2024-05-20 19:50:14] [INFO ] Implicit Places using invariants in 2230 ms returned []
Implicit Place search using SMT only with invariants took 2233 ms to find 0 implicit places.
[2024-05-20 19:50:14] [INFO ] Invariant cache hit.
[2024-05-20 19:50:21] [INFO ] Dead Transitions using invariants and state equation in 7442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14581/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13302 ms. Remains : 3965/7923 places, 14581/21960 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 148 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LT s3852 1), p0:(AND (GEQ s287 1) (GEQ s3591 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 334 reset in 1800 ms.
Product exploration explored 100000 steps with 335 reset in 1722 ms.
Computed a total of 184 stabilizing places and 301 stable transitions
Computed a total of 184 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:50:26] [INFO ] Invariant cache hit.
[2024-05-20 19:50:26] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 19:50:26] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 19:50:30] [INFO ] After 4848ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:50:31] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2024-05-20 19:50:31] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:50:37] [INFO ] After 6074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:50:37] [INFO ] State equation strengthened by 10737 read => feed constraints.
[2024-05-20 19:50:40] [INFO ] After 2960ms SMT Verify possible using 10737 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:50:41] [INFO ] After 3484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 346 ms.
[2024-05-20 19:50:41] [INFO ] After 10510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14581/14581 transitions.
Applied a total of 0 rules in 636 ms. Remains 3965 /3965 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:50:42] [INFO ] Invariant cache hit.
[2024-05-20 19:50:45] [INFO ] Implicit Places using invariants in 3567 ms returned []
Implicit Place search using SMT only with invariants took 3568 ms to find 0 implicit places.
[2024-05-20 19:50:45] [INFO ] Invariant cache hit.
[2024-05-20 19:50:52] [INFO ] Dead Transitions using invariants and state equation in 6738 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10943 ms. Remains : 3965/3965 places, 14581/14581 transitions.
Computed a total of 184 stabilizing places and 301 stable transitions
Computed a total of 184 stabilizing places and 301 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2099 steps, including 6 resets, run visited all 2 properties in 47 ms. (steps per millisecond=44 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 332 reset in 1647 ms.
Product exploration explored 100000 steps with 331 reset in 1681 ms.
Built C files in :
/tmp/ltsmin1032641409869011495
[2024-05-20 19:50:56] [INFO ] Too many transitions (14581) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:50:56] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1032641409869011495
Running compilation step : cd /tmp/ltsmin1032641409869011495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1032641409869011495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1032641409869011495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14581/14581 transitions.
Applied a total of 0 rules in 740 ms. Remains 3965 /3965 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
[2024-05-20 19:51:00] [INFO ] Invariant cache hit.
[2024-05-20 19:51:01] [INFO ] Implicit Places using invariants in 1169 ms returned []
Implicit Place search using SMT only with invariants took 1170 ms to find 0 implicit places.
[2024-05-20 19:51:01] [INFO ] Invariant cache hit.
[2024-05-20 19:51:08] [INFO ] Dead Transitions using invariants and state equation in 6745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8659 ms. Remains : 3965/3965 places, 14581/14581 transitions.
Built C files in :
/tmp/ltsmin14301829549292918452
[2024-05-20 19:51:08] [INFO ] Too many transitions (14581) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:51:08] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14301829549292918452
Running compilation step : cd /tmp/ltsmin14301829549292918452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14301829549292918452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14301829549292918452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:51:12] [INFO ] Flatten gal took : 294 ms
[2024-05-20 19:51:12] [INFO ] Flatten gal took : 250 ms
[2024-05-20 19:51:12] [INFO ] Time to serialize gal into /tmp/LTL7123902088360063307.gal : 93 ms
[2024-05-20 19:51:12] [INFO ] Time to serialize properties into /tmp/LTL3550901407683093767.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7123902088360063307.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6720628039827822029.hoa' '-atoms' '/tmp/LTL3550901407683093767.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3550901407683093767.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6720628039827822029.hoa
Detected timeout of ITS tools.
[2024-05-20 19:51:28] [INFO ] Flatten gal took : 249 ms
[2024-05-20 19:51:28] [INFO ] Flatten gal took : 246 ms
[2024-05-20 19:51:28] [INFO ] Time to serialize gal into /tmp/LTL13406153226381053900.gal : 48 ms
[2024-05-20 19:51:28] [INFO ] Time to serialize properties into /tmp/LTL9158806442951519126.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13406153226381053900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9158806442951519126.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(Node58GiveAnswer7<1)"))||("((Node47IsInserted>=1)&&(Node53requestsent47>=1))"))))
Formula 0 simplified : G(!"((Node47IsInserted>=1)&&(Node53requestsent47>=1))" & F!"(Node58GiveAnswer7<1)")
Detected timeout of ITS tools.
[2024-05-20 19:51:43] [INFO ] Flatten gal took : 253 ms
[2024-05-20 19:51:43] [INFO ] Applying decomposition
[2024-05-20 19:51:44] [INFO ] Flatten gal took : 239 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/graph13708029231040565072.txt' '-o' '/tmp/graph13708029231040565072.bin' '-w' '/tmp/graph13708029231040565072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13708029231040565072.bin' '-l' '-1' '-v' '-w' '/tmp/graph13708029231040565072.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:51:44] [INFO ] Decomposing Gal with order
[2024-05-20 19:51:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:51:46] [INFO ] Removed a total of 10804 redundant transitions.
[2024-05-20 19:51:46] [INFO ] Flatten gal took : 1480 ms
[2024-05-20 19:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 1069 ms.
[2024-05-20 19:51:47] [INFO ] Time to serialize gal into /tmp/LTL1090996498554344837.gal : 90 ms
[2024-05-20 19:51:47] [INFO ] Time to serialize properties into /tmp/LTL17263471116165093454.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/LTL1090996498554344837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17263471116165093454.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(u8.Node58GiveAnswer7<1)"))||("((u48.Node47IsInserted>=1)&&(u54.Node53requestsent47>=1))"))))
Formula 0 simplified : G(!"((u48.Node47IsInserted>=1)&&(u54.Node53requestsent47>=1))" & F!"(u8.Node58GiveAnswer7<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1149943459765870268
[2024-05-20 19:52:03] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1149943459765870268
Running compilation step : cd /tmp/ltsmin1149943459765870268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1149943459765870268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1149943459765870268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-00 finished in 117639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||((p0 U p2)&&G(p3)))))))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 7923 transition count 21541
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11334 place count 3966 transition count 14583
Applied a total of 11334 rules in 3614 ms. Remains 3966 /7923 variables (removed 3957) and now considering 14583/21960 (removed 7377) transitions.
// Phase 1: matrix 14583 rows 3966 cols
[2024-05-20 19:52:10] [INFO ] Computed 62 invariants in 885 ms
[2024-05-20 19:52:13] [INFO ] Implicit Places using invariants in 3607 ms returned []
Implicit Place search using SMT only with invariants took 3608 ms to find 0 implicit places.
[2024-05-20 19:52:13] [INFO ] Invariant cache hit.
[2024-05-20 19:52:20] [INFO ] Dead Transitions using invariants and state equation in 6752 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3966/7923 places, 14583/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13977 ms. Remains : 3966/7923 places, 14583/21960 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p1) p3) (AND (NOT p1) p2 p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1569 1), p1:(GEQ s3154 1), p2:(GEQ s3257 1), p3:(AND (GEQ s89 1) (GEQ s557 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 272 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-02 finished in 14254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U p1))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1032 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:52:23] [INFO ] Computed 62 invariants in 2128 ms
[2024-05-20 19:52:24] [INFO ] Implicit Places using invariants in 3406 ms returned []
Implicit Place search using SMT only with invariants took 3407 ms to find 0 implicit places.
[2024-05-20 19:52:24] [INFO ] Invariant cache hit.
[2024-05-20 19:52:25] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5150 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s3086 1), p0:(AND (GEQ s833 1) (GEQ s7567 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4451 ms.
Product exploration explored 100000 steps with 33333 reset in 4361 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-060-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-03 finished in 14230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 5 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7916 place count 3965 transition count 18002
Drop transitions removed 3420 transitions
Redundant transition composition rules discarded 3420 transitions
Iterating global reduction 2 with 3420 rules applied. Total rules applied 11336 place count 3965 transition count 14582
Applied a total of 11336 rules in 3383 ms. Remains 3965 /7923 variables (removed 3958) and now considering 14582/21960 (removed 7378) transitions.
// Phase 1: matrix 14582 rows 3965 cols
[2024-05-20 19:52:38] [INFO ] Computed 62 invariants in 920 ms
[2024-05-20 19:52:40] [INFO ] Implicit Places using invariants in 2124 ms returned []
Implicit Place search using SMT only with invariants took 2125 ms to find 0 implicit places.
[2024-05-20 19:52:40] [INFO ] Invariant cache hit.
[2024-05-20 19:52:46] [INFO ] Dead Transitions using invariants and state equation in 6655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3965/7923 places, 14582/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12164 ms. Remains : 3965/7923 places, 14582/21960 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s612 1) (AND (GEQ s2423 1) (LT s2423 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 329 reset in 1626 ms.
Product exploration explored 100000 steps with 329 reset in 1653 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 63909 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63909 steps, saw 33895 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:52:53] [INFO ] Invariant cache hit.
[2024-05-20 19:52:54] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2024-05-20 19:52:54] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:52:58] [INFO ] After 4535ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 19:52:58] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2024-05-20 19:53:00] [INFO ] After 1533ms SMT Verify possible using 10736 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:53:00] [INFO ] After 6682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:53:00] [INFO ] [Nat]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 19:53:00] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:53:05] [INFO ] After 4592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:53:06] [INFO ] After 1401ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:53:07] [INFO ] After 1895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 343 ms.
[2024-05-20 19:53:07] [INFO ] After 7324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Applied a total of 0 rules in 649 ms. Remains 3965 /3965 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-20 19:53:08] [INFO ] Invariant cache hit.
[2024-05-20 19:53:09] [INFO ] Implicit Places using invariants in 1197 ms returned []
Implicit Place search using SMT only with invariants took 1197 ms to find 0 implicit places.
[2024-05-20 19:53:09] [INFO ] Invariant cache hit.
[2024-05-20 19:53:16] [INFO ] Dead Transitions using invariants and state equation in 6670 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8519 ms. Remains : 3965/3965 places, 14582/14582 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 64042 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64042 steps, saw 33916 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:53:19] [INFO ] Invariant cache hit.
[2024-05-20 19:53:20] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2024-05-20 19:53:20] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:53:24] [INFO ] After 4438ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 19:53:24] [INFO ] State equation strengthened by 10736 read => feed constraints.
[2024-05-20 19:53:26] [INFO ] After 1452ms SMT Verify possible using 10736 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:53:26] [INFO ] After 6476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:53:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:53:26] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:53:31] [INFO ] After 4553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:53:32] [INFO ] After 1369ms SMT Verify possible using 10736 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:53:33] [INFO ] After 1852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 329 ms.
[2024-05-20 19:53:33] [INFO ] After 7248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 330 reset in 1610 ms.
Product exploration explored 100000 steps with 330 reset in 1667 ms.
Built C files in :
/tmp/ltsmin6713224894012956344
[2024-05-20 19:53:37] [INFO ] Too many transitions (14582) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:53:37] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6713224894012956344
Running compilation step : cd /tmp/ltsmin6713224894012956344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6713224894012956344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6713224894012956344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3965 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3965/3965 places, 14582/14582 transitions.
Applied a total of 0 rules in 627 ms. Remains 3965 /3965 variables (removed 0) and now considering 14582/14582 (removed 0) transitions.
[2024-05-20 19:53:41] [INFO ] Invariant cache hit.
[2024-05-20 19:53:42] [INFO ] Implicit Places using invariants in 1213 ms returned []
Implicit Place search using SMT only with invariants took 1214 ms to find 0 implicit places.
[2024-05-20 19:53:42] [INFO ] Invariant cache hit.
[2024-05-20 19:53:48] [INFO ] Dead Transitions using invariants and state equation in 6224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8070 ms. Remains : 3965/3965 places, 14582/14582 transitions.
Built C files in :
/tmp/ltsmin7550863568071044452
[2024-05-20 19:53:48] [INFO ] Too many transitions (14582) to apply POR reductions. Disabling POR matrices.
[2024-05-20 19:53:48] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7550863568071044452
Running compilation step : cd /tmp/ltsmin7550863568071044452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7550863568071044452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7550863568071044452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 19:53:52] [INFO ] Flatten gal took : 231 ms
[2024-05-20 19:53:52] [INFO ] Flatten gal took : 244 ms
[2024-05-20 19:53:52] [INFO ] Time to serialize gal into /tmp/LTL7009347594448669945.gal : 102 ms
[2024-05-20 19:53:52] [INFO ] Time to serialize properties into /tmp/LTL9164272975297243365.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/LTL7009347594448669945.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5388013478235456819.hoa' '-atoms' '/tmp/LTL9164272975297243365.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9164272975297243365.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5388013478235456819.hoa
Detected timeout of ITS tools.
[2024-05-20 19:54:07] [INFO ] Flatten gal took : 225 ms
[2024-05-20 19:54:08] [INFO ] Flatten gal took : 238 ms
[2024-05-20 19:54:08] [INFO ] Time to serialize gal into /tmp/LTL3775228693629353008.gal : 166 ms
[2024-05-20 19:54:08] [INFO ] Time to serialize properties into /tmp/LTL17755754514410778582.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/LTL3775228693629353008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17755754514410778582.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node4GiveAnswer9<1)||((Node34GiveAnswer18>=1)&&(Node34GiveAnswer18<1)))"))))
Formula 0 simplified : FG!"((Node4GiveAnswer9<1)||((Node34GiveAnswer18>=1)&&(Node34GiveAnswer18<1)))"
Detected timeout of ITS tools.
[2024-05-20 19:54:23] [INFO ] Flatten gal took : 231 ms
[2024-05-20 19:54:23] [INFO ] Applying decomposition
[2024-05-20 19:54:23] [INFO ] Flatten gal took : 243 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/graph14120907679452851926.txt' '-o' '/tmp/graph14120907679452851926.bin' '-w' '/tmp/graph14120907679452851926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14120907679452851926.bin' '-l' '-1' '-v' '-w' '/tmp/graph14120907679452851926.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:54:24] [INFO ] Decomposing Gal with order
[2024-05-20 19:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:54:25] [INFO ] Removed a total of 10815 redundant transitions.
[2024-05-20 19:54:25] [INFO ] Flatten gal took : 1045 ms
[2024-05-20 19:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 995 ms.
[2024-05-20 19:54:26] [INFO ] Time to serialize gal into /tmp/LTL11537824704779325557.gal : 55 ms
[2024-05-20 19:54:26] [INFO ] Time to serialize properties into /tmp/LTL17757999323288595312.ltl : 5 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/LTL11537824704779325557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17757999323288595312.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((u10.Node4GiveAnswer9<1)||((u19.Node34GiveAnswer18>=1)&&(u19.Node34GiveAnswer18<1)))"))))
Formula 0 simplified : FG!"((u10.Node4GiveAnswer9<1)||((u19.Node34GiveAnswer18>=1)&&(u19.Node34GiveAnswer18<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14014544714549586656
[2024-05-20 19:54:41] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14014544714549586656
Running compilation step : cd /tmp/ltsmin14014544714549586656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14014544714549586656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14014544714549586656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-04 finished in 130305 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&&(!p0 U (!p1||G(!p0)))&&(G(!p0)||G(F(p2)))))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 7923 transition count 21545
Reduce places removed 415 places and 0 transitions.
Iterating post reduction 1 with 415 rules applied. Total rules applied 830 place count 7508 transition count 21545
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 830 place count 7508 transition count 21543
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 834 place count 7506 transition count 21543
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7910 place count 3968 transition count 18005
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11332 place count 3968 transition count 14583
Applied a total of 11332 rules in 3475 ms. Remains 3968 /7923 variables (removed 3955) and now considering 14583/21960 (removed 7377) transitions.
// Phase 1: matrix 14583 rows 3968 cols
[2024-05-20 19:54:49] [INFO ] Computed 62 invariants in 874 ms
[2024-05-20 19:54:50] [INFO ] Implicit Places using invariants in 2060 ms returned []
Implicit Place search using SMT only with invariants took 2060 ms to find 0 implicit places.
[2024-05-20 19:54:50] [INFO ] Invariant cache hit.
[2024-05-20 19:54:57] [INFO ] Dead Transitions using invariants and state equation in 6851 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3968/7923 places, 14583/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12392 ms. Remains : 3968/7923 places, 14583/21960 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s229 1) (GEQ s344 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 326 reset in 1644 ms.
Stack based approach found an accepted trace after 2149 steps with 6 reset with depth 296 and stack size 296 in 37 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-06 finished in 14154 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 !p0)&&X(G(p1))))'
Support contains 3 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 984 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:55:02] [INFO ] Computed 62 invariants in 2186 ms
[2024-05-20 19:55:03] [INFO ] Implicit Places using invariants in 2898 ms returned []
Implicit Place search using SMT only with invariants took 2899 ms to find 0 implicit places.
[2024-05-20 19:55:03] [INFO ] Invariant cache hit.
[2024-05-20 19:55:03] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4627 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, true, (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s777 1) (GEQ s796 1)), p0:(LT s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-08 finished in 4863 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(p0) U (p1&&X(p0)))))'
Support contains 5 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 980 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:55:04] [INFO ] Invariant cache hit.
[2024-05-20 19:55:05] [INFO ] Implicit Places using invariants in 733 ms returned []
Implicit Place search using SMT only with invariants took 735 ms to find 0 implicit places.
[2024-05-20 19:55:05] [INFO ] Invariant cache hit.
[2024-05-20 19:55:06] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2439 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s1832 1), p0:(AND (NOT (AND (GEQ s2525 1) (GEQ s77 1) (GEQ s6163 1))) (GEQ s4187 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-09 finished in 2650 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(!p0))&&(X(!p0)||F((p1&&X(p2))))))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 951 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 19:55:07] [INFO ] Invariant cache hit.
[2024-05-20 19:55:08] [INFO ] Implicit Places using invariants in 714 ms returned []
Implicit Place search using SMT only with invariants took 716 ms to find 0 implicit places.
[2024-05-20 19:55:08] [INFO ] Invariant cache hit.
[2024-05-20 19:55:09] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2398 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s7687 1), p1:(OR (LT s245 1) (LT s376 1)), p2:(LT s7872 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33275 reset in 4512 ms.
Product exploration explored 100000 steps with 33288 reset in 4539 ms.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 157 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 19:55:19] [INFO ] Invariant cache hit.
[2024-05-20 19:55:20] [INFO ] [Real]Absence check using 60 positive place invariants in 71 ms returned sat
[2024-05-20 19:55:20] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 121 ms returned sat
[2024-05-20 19:55:34] [INFO ] After 13271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2024-05-20 19:55:34] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:55:44] [INFO ] After 9928ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 19:55:44] [INFO ] After 25072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 19:55:45] [INFO ] [Nat]Absence check using 60 positive place invariants in 78 ms returned sat
[2024-05-20 19:55:45] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 113 ms returned sat
[2024-05-20 19:56:04] [INFO ] After 17722ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 19:56:09] [INFO ] After 5254ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:56:09] [INFO ] After 5255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-20 19:56:09] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11338 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11340 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 3 with 3661 rules applied. Total rules applied 15001 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15061 place count 3964 transition count 14579
Applied a total of 15061 rules in 5555 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14579/21960 (removed 7381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5556 ms. Remains : 3964/7923 places, 14579/21960 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2024-05-20 19:56:16] [INFO ] Computed 62 invariants in 519 ms
[2024-05-20 19:56:16] [INFO ] [Real]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:56:16] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:56:22] [INFO ] After 5214ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-20 19:56:22] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 19:56:25] [INFO ] After 2776ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:56:25] [INFO ] After 8979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 19:56:25] [INFO ] [Nat]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 19:56:25] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-20 19:56:38] [INFO ] After 12141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 19:56:43] [INFO ] After 5551ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:56:47] [INFO ] After 9516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2433 ms.
[2024-05-20 19:56:50] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 34 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 721 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62071 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62071 steps, saw 30655 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 19:56:54] [INFO ] Invariant cache hit.
[2024-05-20 19:56:54] [INFO ] [Real]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:56:54] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:57:00] [INFO ] After 5341ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 19:57:00] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 19:57:05] [INFO ] After 5599ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:57:05] [INFO ] After 11558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 19:57:06] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 19:57:06] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 19:57:11] [INFO ] After 5188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 19:57:17] [INFO ] After 6228ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 19:57:18] [INFO ] After 7040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 417 ms.
[2024-05-20 19:57:18] [INFO ] After 13152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 738 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 739 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 723 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2024-05-20 19:57:20] [INFO ] Invariant cache hit.
[2024-05-20 19:57:23] [INFO ] Implicit Places using invariants in 3078 ms returned []
Implicit Place search using SMT only with invariants took 3078 ms to find 0 implicit places.
[2024-05-20 19:57:23] [INFO ] Invariant cache hit.
[2024-05-20 19:57:29] [INFO ] Dead Transitions using invariants and state equation in 6047 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9851 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 16 factoid took 459 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 952 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 19:57:33] [INFO ] Computed 62 invariants in 2114 ms
[2024-05-20 19:57:34] [INFO ] Implicit Places using invariants in 3373 ms returned []
Implicit Place search using SMT only with invariants took 3374 ms to find 0 implicit places.
[2024-05-20 19:57:34] [INFO ] Invariant cache hit.
[2024-05-20 19:57:35] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5036 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Computed a total of 242 stabilizing places and 420 stable transitions
Computed a total of 242 stabilizing places and 420 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 171 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 19:57:36] [INFO ] Invariant cache hit.
[2024-05-20 19:57:37] [INFO ] [Real]Absence check using 60 positive place invariants in 64 ms returned sat
[2024-05-20 19:57:37] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 114 ms returned sat
[2024-05-20 19:57:50] [INFO ] After 12021ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2024-05-20 19:57:50] [INFO ] State equation strengthened by 7140 read => feed constraints.
[2024-05-20 19:58:01] [INFO ] After 11375ms SMT Verify possible using 7140 Read/Feed constraints in real domain returned unsat :0 sat :1 real:5
[2024-05-20 19:58:01] [INFO ] After 11376ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 19:58:01] [INFO ] After 25215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2024-05-20 19:58:02] [INFO ] [Nat]Absence check using 60 positive place invariants in 69 ms returned sat
[2024-05-20 19:58:03] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 113 ms returned sat
[2024-05-20 19:58:21] [INFO ] After 17622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 19:58:26] [INFO ] After 5377ms SMT Verify possible using 7140 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 19:58:26] [INFO ] After 5378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 19:58:26] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11338 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11340 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 3 with 3661 rules applied. Total rules applied 15001 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 15061 place count 3964 transition count 14579
Applied a total of 15061 rules in 5526 ms. Remains 3964 /7923 variables (removed 3959) and now considering 14579/21960 (removed 7381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5526 ms. Remains : 3964/7923 places, 14579/21960 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2024-05-20 19:58:33] [INFO ] Computed 62 invariants in 497 ms
[2024-05-20 19:58:33] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 19:58:33] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:58:38] [INFO ] After 5361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 19:58:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 40 ms returned sat
[2024-05-20 19:58:39] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 55 ms returned sat
[2024-05-20 19:58:48] [INFO ] After 9419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 19:58:48] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 19:59:01] [INFO ] After 12450ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 19:59:03] [INFO ] After 14699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 19:59:03] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 123 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 749 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59303 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59303 steps, saw 30324 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 19:59:07] [INFO ] Invariant cache hit.
[2024-05-20 19:59:08] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 19:59:08] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 19:59:16] [INFO ] After 7727ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-20 19:59:16] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 19:59:19] [INFO ] After 3066ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 19:59:19] [INFO ] After 11657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 19:59:20] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 19:59:20] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 19:59:32] [INFO ] After 11867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 19:59:39] [INFO ] After 7092ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 19:59:42] [INFO ] After 10442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1939 ms.
[2024-05-20 19:59:44] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 737 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 737 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 724 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2024-05-20 19:59:46] [INFO ] Invariant cache hit.
[2024-05-20 19:59:49] [INFO ] Implicit Places using invariants in 3028 ms returned []
Implicit Place search using SMT only with invariants took 3029 ms to find 0 implicit places.
[2024-05-20 19:59:49] [INFO ] Invariant cache hit.
[2024-05-20 19:59:55] [INFO ] Dead Transitions using invariants and state equation in 6506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10277 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 16 factoid took 357 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 213 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 189 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 33377 reset in 4506 ms.
Product exploration explored 100000 steps with 33241 reset in 4509 ms.
Built C files in :
/tmp/ltsmin5627119652263258719
[2024-05-20 20:00:06] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5627119652263258719
Running compilation step : cd /tmp/ltsmin5627119652263258719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5627119652263258719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5627119652263258719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 1015 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
// Phase 1: matrix 21960 rows 7923 cols
[2024-05-20 20:00:12] [INFO ] Computed 62 invariants in 2084 ms
[2024-05-20 20:00:13] [INFO ] Implicit Places using invariants in 3368 ms returned []
Implicit Place search using SMT only with invariants took 3371 ms to find 0 implicit places.
[2024-05-20 20:00:13] [INFO ] Invariant cache hit.
[2024-05-20 20:00:14] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5071 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Built C files in :
/tmp/ltsmin1044305684894627285
[2024-05-20 20:00:14] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1044305684894627285
Running compilation step : cd /tmp/ltsmin1044305684894627285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1044305684894627285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1044305684894627285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 20:00:17] [INFO ] Flatten gal took : 352 ms
[2024-05-20 20:00:18] [INFO ] Flatten gal took : 373 ms
[2024-05-20 20:00:18] [INFO ] Time to serialize gal into /tmp/LTL13166130995763552985.gal : 83 ms
[2024-05-20 20:00:18] [INFO ] Time to serialize properties into /tmp/LTL11579233087756740687.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/LTL13166130995763552985.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7029065619777286417.hoa' '-atoms' '/tmp/LTL11579233087756740687.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/LTL11579233087756740687.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7029065619777286417.hoa
Detected timeout of ITS tools.
[2024-05-20 20:00:34] [INFO ] Flatten gal took : 364 ms
[2024-05-20 20:00:34] [INFO ] Flatten gal took : 386 ms
[2024-05-20 20:00:34] [INFO ] Time to serialize gal into /tmp/LTL6279250124831853511.gal : 70 ms
[2024-05-20 20:00:34] [INFO ] Time to serialize properties into /tmp/LTL16888228260011026101.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/LTL6279250124831853511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16888228260011026101.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("(Node58requestsent0>=1)")||(X("(Node58requestsent0<1)")))&&((X("(Node58requestsent0<1)"))||(F(("((Node17IsInserted<1)||(Node...208
Formula 0 simplified : GF((!"(Node58requestsent0>=1)" & X!"(Node58requestsent0<1)") | (X!"(Node58requestsent0<1)" & G(!"((Node17IsInserted<1)||(Node26Reque...194
Detected timeout of ITS tools.
[2024-05-20 20:00:49] [INFO ] Flatten gal took : 357 ms
[2024-05-20 20:00:49] [INFO ] Applying decomposition
[2024-05-20 20:00:50] [INFO ] Flatten gal took : 379 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/graph11255552452323627716.txt' '-o' '/tmp/graph11255552452323627716.bin' '-w' '/tmp/graph11255552452323627716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11255552452323627716.bin' '-l' '-1' '-v' '-w' '/tmp/graph11255552452323627716.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:00:51] [INFO ] Decomposing Gal with order
[2024-05-20 20:00:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:00:52] [INFO ] Removed a total of 10826 redundant transitions.
[2024-05-20 20:00:52] [INFO ] Flatten gal took : 1108 ms
[2024-05-20 20:00:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 15174 labels/synchronizations in 1146 ms.
[2024-05-20 20:00:54] [INFO ] Time to serialize gal into /tmp/LTL6720985023294698748.gal : 85 ms
[2024-05-20 20:00:54] [INFO ] Time to serialize properties into /tmp/LTL13749430605676367642.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6720985023294698748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13749430605676367642.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((("(i59.u234.Node58requestsent0>=1)")||(X("(i59.u234.Node58requestsent0<1)")))&&((X("(i59.u234.Node58requestsent0<1)"))||(F(("(...261
Formula 0 simplified : GF((!"(i59.u234.Node58requestsent0>=1)" & X!"(i59.u234.Node58requestsent0<1)") | (X!"(i59.u234.Node58requestsent0<1)" & G(!"((i12.u6...247
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10441522286255327583
[2024-05-20 20:01:09] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10441522286255327583
Running compilation step : cd /tmp/ltsmin10441522286255327583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10441522286255327583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10441522286255327583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-10 finished in 365977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 949 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 20:01:13] [INFO ] Invariant cache hit.
[2024-05-20 20:01:14] [INFO ] Implicit Places using invariants in 695 ms returned []
Implicit Place search using SMT only with invariants took 696 ms to find 0 implicit places.
[2024-05-20 20:01:14] [INFO ] Invariant cache hit.
[2024-05-20 20:01:14] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2348 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s231 1) (GEQ s306 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]]
Stuttering criterion allowed to conclude after 2886 steps with 1 reset in 37 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-11 finished in 2594 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((G(p0)||F(p1))))'
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 931 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 20:01:16] [INFO ] Invariant cache hit.
[2024-05-20 20:01:16] [INFO ] Implicit Places using invariants in 720 ms returned []
Implicit Place search using SMT only with invariants took 721 ms to find 0 implicit places.
[2024-05-20 20:01:16] [INFO ] Invariant cache hit.
[2024-05-20 20:01:17] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2401 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s49 1) (GEQ s2147 1)), p0:(AND (GEQ s245 1) (GEQ s3001 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1489 steps with 0 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-13 finished in 2597 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(G((p0&&X((p0 U (G(p0)||X((X((!p1&&X(p0))) U ((!p1&&X((!p1&&X(p0))))||X(G((!p1&&X(p0))))))))))))))'
Support contains 1 out of 7923 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Applied a total of 0 rules in 945 ms. Remains 7923 /7923 variables (removed 0) and now considering 21960/21960 (removed 0) transitions.
[2024-05-20 20:01:18] [INFO ] Invariant cache hit.
[2024-05-20 20:01:19] [INFO ] Implicit Places using invariants in 693 ms returned []
Implicit Place search using SMT only with invariants took 699 ms to find 0 implicit places.
[2024-05-20 20:01:19] [INFO ] Invariant cache hit.
[2024-05-20 20:01:20] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2336 ms. Remains : 7923/7923 places, 21960/21960 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s4051 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1478 steps with 1 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-060-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-14 finished in 2496 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(F(p0))||G(p1))))'
Support contains 2 out of 7923 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 7923 transition count 21540
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 7503 transition count 21540
Performed 3540 Post agglomeration using F-continuation condition.Transition count delta: 3540
Deduced a syphon composed of 3540 places in 6 ms
Reduce places removed 3540 places and 0 transitions.
Iterating global reduction 2 with 7080 rules applied. Total rules applied 7920 place count 3963 transition count 18000
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11342 place count 3963 transition count 14578
Applied a total of 11342 rules in 3544 ms. Remains 3963 /7923 variables (removed 3960) and now considering 14578/21960 (removed 7382) transitions.
// Phase 1: matrix 14578 rows 3963 cols
[2024-05-20 20:01:24] [INFO ] Computed 62 invariants in 932 ms
[2024-05-20 20:01:25] [INFO ] Implicit Places using invariants in 1797 ms returned []
Implicit Place search using SMT only with invariants took 1798 ms to find 0 implicit places.
[2024-05-20 20:01:25] [INFO ] Invariant cache hit.
[2024-05-20 20:01:32] [INFO ] Dead Transitions using invariants and state equation in 7119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3963/7923 places, 14578/21960 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12462 ms. Remains : 3963/7923 places, 14578/21960 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3187 1), p0:(LT s2181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 335 reset in 1652 ms.
Product exploration explored 100000 steps with 332 reset in 1701 ms.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:01:36] [INFO ] Invariant cache hit.
[2024-05-20 20:01:37] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2024-05-20 20:01:37] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 20:01:42] [INFO ] After 4983ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:01:42] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 20:01:44] [INFO ] After 2027ms SMT Verify possible using 10738 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:01:44] [INFO ] After 7657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:01:44] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 20:01:44] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 20:01:49] [INFO ] After 5075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:01:55] [INFO ] After 5246ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:01:55] [INFO ] After 5784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 357 ms.
[2024-05-20 20:01:56] [INFO ] After 11722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 630 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2024-05-20 20:01:56] [INFO ] Invariant cache hit.
[2024-05-20 20:01:58] [INFO ] Implicit Places using invariants in 1200 ms returned []
Implicit Place search using SMT only with invariants took 1203 ms to find 0 implicit places.
[2024-05-20 20:01:58] [INFO ] Invariant cache hit.
[2024-05-20 20:02:04] [INFO ] Dead Transitions using invariants and state equation in 6727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8561 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Computed a total of 183 stabilizing places and 300 stable transitions
Computed a total of 183 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 20:02:05] [INFO ] Invariant cache hit.
[2024-05-20 20:02:05] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 20:02:05] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-20 20:02:10] [INFO ] After 4808ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 20:02:10] [INFO ] State equation strengthened by 10738 read => feed constraints.
[2024-05-20 20:02:12] [INFO ] After 1922ms SMT Verify possible using 10738 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:02:12] [INFO ] After 7364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:02:13] [INFO ] [Nat]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 20:02:13] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 20:02:18] [INFO ] After 4888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 20:02:23] [INFO ] After 5158ms SMT Verify possible using 10738 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:02:23] [INFO ] After 5696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 359 ms.
[2024-05-20 20:02:24] [INFO ] After 11452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 330 reset in 1612 ms.
Product exploration explored 100000 steps with 335 reset in 1663 ms.
Built C files in :
/tmp/ltsmin7407548776679205924
[2024-05-20 20:02:27] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:02:27] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7407548776679205924
Running compilation step : cd /tmp/ltsmin7407548776679205924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7407548776679205924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7407548776679205924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3963/3963 places, 14578/14578 transitions.
Applied a total of 0 rules in 622 ms. Remains 3963 /3963 variables (removed 0) and now considering 14578/14578 (removed 0) transitions.
[2024-05-20 20:02:31] [INFO ] Invariant cache hit.
[2024-05-20 20:02:32] [INFO ] Implicit Places using invariants in 1227 ms returned []
Implicit Place search using SMT only with invariants took 1227 ms to find 0 implicit places.
[2024-05-20 20:02:32] [INFO ] Invariant cache hit.
[2024-05-20 20:02:39] [INFO ] Dead Transitions using invariants and state equation in 6621 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8472 ms. Remains : 3963/3963 places, 14578/14578 transitions.
Built C files in :
/tmp/ltsmin2811202614459856852
[2024-05-20 20:02:39] [INFO ] Too many transitions (14578) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:02:39] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2811202614459856852
Running compilation step : cd /tmp/ltsmin2811202614459856852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2811202614459856852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2811202614459856852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 20:02:43] [INFO ] Flatten gal took : 212 ms
[2024-05-20 20:02:43] [INFO ] Flatten gal took : 228 ms
[2024-05-20 20:02:43] [INFO ] Time to serialize gal into /tmp/LTL4517721905986425790.gal : 42 ms
[2024-05-20 20:02:43] [INFO ] Time to serialize properties into /tmp/LTL15883087482628968391.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4517721905986425790.gal' '-t' 'CGAL' '-hoa' '/tmp/aut980330872257502898.hoa' '-atoms' '/tmp/LTL15883087482628968391.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15883087482628968391.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut980330872257502898.hoa
Detected timeout of ITS tools.
[2024-05-20 20:02:58] [INFO ] Flatten gal took : 214 ms
[2024-05-20 20:02:58] [INFO ] Flatten gal took : 227 ms
[2024-05-20 20:02:58] [INFO ] Time to serialize gal into /tmp/LTL2741293522029583300.gal : 42 ms
[2024-05-20 20:02:58] [INFO ] Time to serialize properties into /tmp/LTL11856710740399835983.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2741293522029583300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11856710740399835983.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(Node30requestsent18<1)")))||(G("(Node47requestsent4>=1)")))))
Formula 0 simplified : G(FG!"(Node30requestsent18<1)" & F!"(Node47requestsent4>=1)")
Detected timeout of ITS tools.
[2024-05-20 20:03:14] [INFO ] Flatten gal took : 222 ms
[2024-05-20 20:03:14] [INFO ] Applying decomposition
[2024-05-20 20:03:14] [INFO ] Flatten gal took : 227 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/graph16968902091108086905.txt' '-o' '/tmp/graph16968902091108086905.bin' '-w' '/tmp/graph16968902091108086905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16968902091108086905.bin' '-l' '-1' '-v' '-w' '/tmp/graph16968902091108086905.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:03:14] [INFO ] Decomposing Gal with order
[2024-05-20 20:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:03:16] [INFO ] Removed a total of 10822 redundant transitions.
[2024-05-20 20:03:16] [INFO ] Flatten gal took : 1018 ms
[2024-05-20 20:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 7081 labels/synchronizations in 907 ms.
[2024-05-20 20:03:17] [INFO ] Time to serialize gal into /tmp/LTL3508845047290345788.gal : 58 ms
[2024-05-20 20:03:17] [INFO ] Time to serialize properties into /tmp/LTL14153721897118226832.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3508845047290345788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14153721897118226832.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(u31.Node30requestsent18<1)")))||(G("(u48.Node47requestsent4>=1)")))))
Formula 0 simplified : G(FG!"(u31.Node30requestsent18<1)" & F!"(u48.Node47requestsent4>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14657781509783661975
[2024-05-20 20:03:32] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14657781509783661975
Running compilation step : cd /tmp/ltsmin14657781509783661975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14657781509783661975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14657781509783661975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-15 finished in 135224 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||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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(!p0))&&(X(!p0)||F((p1&&X(p2))))))))'
Found a Shortening insensitive property : CANInsertWithFailure-PT-060-LTLFireability-10
Stuttering acceptance computed with spot in 260 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Support contains 4 out of 7923 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 7923/7923 places, 21960/21960 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 7923 transition count 21542
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 7505 transition count 21542
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 836 place count 7505 transition count 21541
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 838 place count 7504 transition count 21541
Performed 3538 Post agglomeration using F-continuation condition.Transition count delta: 3538
Deduced a syphon composed of 3538 places in 6 ms
Reduce places removed 3538 places and 0 transitions.
Iterating global reduction 2 with 7076 rules applied. Total rules applied 7914 place count 3966 transition count 18003
Drop transitions removed 3422 transitions
Redundant transition composition rules discarded 3422 transitions
Iterating global reduction 2 with 3422 rules applied. Total rules applied 11336 place count 3966 transition count 14581
Applied a total of 11336 rules in 3187 ms. Remains 3966 /7923 variables (removed 3957) and now considering 14581/21960 (removed 7379) transitions.
// Phase 1: matrix 14581 rows 3966 cols
[2024-05-20 20:03:40] [INFO ] Computed 62 invariants in 889 ms
[2024-05-20 20:03:41] [INFO ] Implicit Places using invariants in 2066 ms returned []
Implicit Place search using SMT only with invariants took 2066 ms to find 0 implicit places.
[2024-05-20 20:03:41] [INFO ] Invariant cache hit.
[2024-05-20 20:03:48] [INFO ] Dead Transitions using invariants and state equation in 6705 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3966/7923 places, 14581/21960 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11959 ms. Remains : 3966/7923 places, 14581/21960 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-060-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s3845 1), p1:(OR (LT s107 1) (LT s163 1)), p2:(LT s3939 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33394 reset in 3529 ms.
Product exploration explored 100000 steps with 33387 reset in 3450 ms.
Computed a total of 181 stabilizing places and 300 stable transitions
Computed a total of 181 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 205 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 20:03:55] [INFO ] Invariant cache hit.
[2024-05-20 20:03:56] [INFO ] [Real]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 20:03:56] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 20:04:05] [INFO ] After 8775ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2024-05-20 20:04:05] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2024-05-20 20:04:07] [INFO ] After 2126ms SMT Verify possible using 10735 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 20:04:07] [INFO ] After 11938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 20:04:08] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 20:04:08] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-20 20:04:20] [INFO ] After 11740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 20:04:32] [INFO ] After 12125ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:725)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 20:04:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 20:04:32] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 2 properties in 130 ms.
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3665 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 3725 place count 3964 transition count 14579
Applied a total of 3725 rules in 2814 ms. Remains 3964 /3966 variables (removed 2) and now considering 14579/14581 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2814 ms. Remains : 3964/3966 places, 14579/14581 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2024-05-20 20:04:36] [INFO ] Computed 62 invariants in 534 ms
[2024-05-20 20:04:37] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 20:04:37] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 20:04:42] [INFO ] After 5412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 20:04:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2024-05-20 20:04:42] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 20:04:52] [INFO ] After 9614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 20:04:52] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:05:05] [INFO ] After 12473ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 20:05:07] [INFO ] After 14565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 20:05:07] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 104 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 749 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59199 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59199 steps, saw 30311 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 20:05:11] [INFO ] Invariant cache hit.
[2024-05-20 20:05:12] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2024-05-20 20:05:12] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 20:05:19] [INFO ] After 7223ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-20 20:05:19] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:05:22] [INFO ] After 3158ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 20:05:22] [INFO ] After 11198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 20:05:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 20:05:23] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-20 20:05:35] [INFO ] After 11649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 20:05:43] [INFO ] After 8324ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 20:05:47] [INFO ] After 12041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 580 ms.
[2024-05-20 20:05:47] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 106 ms.
Support contains 4 out of 3964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 772 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3964/3964 places, 14579/14579 transitions.
Applied a total of 0 rules in 747 ms. Remains 3964 /3964 variables (removed 0) and now considering 14579/14579 (removed 0) transitions.
[2024-05-20 20:05:49] [INFO ] Invariant cache hit.
[2024-05-20 20:05:52] [INFO ] Implicit Places using invariants in 3109 ms returned []
Implicit Place search using SMT only with invariants took 3109 ms to find 0 implicit places.
[2024-05-20 20:05:52] [INFO ] Invariant cache hit.
[2024-05-20 20:05:59] [INFO ] Dead Transitions using invariants and state equation in 6632 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10490 ms. Remains : 3964/3964 places, 14579/14579 transitions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 16 factoid took 354 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 237 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Applied a total of 0 rules in 444 ms. Remains 3966 /3966 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
// Phase 1: matrix 14581 rows 3966 cols
[2024-05-20 20:06:01] [INFO ] Computed 62 invariants in 937 ms
[2024-05-20 20:06:02] [INFO ] Implicit Places using invariants in 2143 ms returned []
Implicit Place search using SMT only with invariants took 2144 ms to find 0 implicit places.
[2024-05-20 20:06:02] [INFO ] Invariant cache hit.
[2024-05-20 20:06:09] [INFO ] Dead Transitions using invariants and state equation in 6528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9118 ms. Remains : 3966/3966 places, 14581/14581 transitions.
Computed a total of 181 stabilizing places and 300 stable transitions
Computed a total of 181 stabilizing places and 300 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 173 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 20:06:10] [INFO ] Invariant cache hit.
[2024-05-20 20:06:11] [INFO ] [Real]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 20:06:11] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-20 20:06:19] [INFO ] After 8721ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2024-05-20 20:06:20] [INFO ] State equation strengthened by 10735 read => feed constraints.
[2024-05-20 20:06:22] [INFO ] After 2115ms SMT Verify possible using 10735 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 20:06:22] [INFO ] After 11828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 20:06:22] [INFO ] [Nat]Absence check using 60 positive place invariants in 33 ms returned sat
[2024-05-20 20:06:22] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-20 20:06:35] [INFO ] After 11836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 20:06:46] [INFO ] After 11733ms SMT Verify possible using 10735 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 20:06:47] [INFO ] After 12174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 20:06:47] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 136 ms.
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3966 transition count 14579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 3661 times.
Drop transitions removed 3661 transitions
Iterating global reduction 1 with 3661 rules applied. Total rules applied 3665 place count 3964 transition count 14579
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 3725 place count 3964 transition count 14579
Applied a total of 3725 rules in 2755 ms. Remains 3964 /3966 variables (removed 2) and now considering 14579/14581 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2755 ms. Remains : 3964/3966 places, 14579/14581 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 14579 rows 3964 cols
[2024-05-20 20:06:51] [INFO ] Computed 62 invariants in 503 ms
[2024-05-20 20:06:51] [INFO ] [Real]Absence check using 60 positive place invariants in 38 ms returned sat
[2024-05-20 20:06:51] [INFO ] [Real]Absence check using 60 positive and 2 generalized place invariants in 49 ms returned sat
[2024-05-20 20:06:57] [INFO ] After 5197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2024-05-20 20:06:57] [INFO ] State equation strengthened by 14395 read => feed constraints.
[2024-05-20 20:07:00] [INFO ] After 3137ms SMT Verify possible using 14395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 20:07:00] [INFO ] After 9419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 20:07:01] [INFO ] [Nat]Absence check using 60 positive place invariants in 37 ms returned sat
[2024-05-20 20:07:01] [INFO ] [Nat]Absence check using 60 positive and 2 generalized place invariants in 48 ms returned sat
[2024-05-20 20:07:14] [INFO ] After 13294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 20:07:21] [INFO ] After 6825ms SMT Verify possible using 14395 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 20:07:25] [INFO ] After 10690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 20:07:25] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=33 )
Parikh walk visited 6 properties in 34 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 p0 (NOT p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 16 factoid took 507 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 238 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), false, false]
Product exploration explored 100000 steps with 33149 reset in 3363 ms.
Product exploration explored 100000 steps with 33406 reset in 3426 ms.
Built C files in :
/tmp/ltsmin13803012504762320272
[2024-05-20 20:07:33] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13803012504762320272
Running compilation step : cd /tmp/ltsmin13803012504762320272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13803012504762320272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13803012504762320272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 3966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3966/3966 places, 14581/14581 transitions.
Applied a total of 0 rules in 439 ms. Remains 3966 /3966 variables (removed 0) and now considering 14581/14581 (removed 0) transitions.
// Phase 1: matrix 14581 rows 3966 cols
[2024-05-20 20:07:38] [INFO ] Computed 62 invariants in 910 ms
[2024-05-20 20:07:39] [INFO ] Implicit Places using invariants in 2081 ms returned []
Implicit Place search using SMT only with invariants took 2081 ms to find 0 implicit places.
[2024-05-20 20:07:39] [INFO ] Invariant cache hit.
[2024-05-20 20:07:46] [INFO ] Dead Transitions using invariants and state equation in 6525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9047 ms. Remains : 3966/3966 places, 14581/14581 transitions.
Built C files in :
/tmp/ltsmin11228964351595724417
[2024-05-20 20:07:46] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11228964351595724417
Running compilation step : cd /tmp/ltsmin11228964351595724417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11228964351595724417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11228964351595724417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 20:07:49] [INFO ] Flatten gal took : 235 ms
[2024-05-20 20:07:49] [INFO ] Flatten gal took : 240 ms
[2024-05-20 20:07:49] [INFO ] Time to serialize gal into /tmp/LTL7115681565012046877.gal : 44 ms
[2024-05-20 20:07:49] [INFO ] Time to serialize properties into /tmp/LTL12836511038719831816.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7115681565012046877.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12418549796823507012.hoa' '-atoms' '/tmp/LTL12836511038719831816.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/LTL12836511038719831816.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12418549796823507012.hoa
Detected timeout of ITS tools.
[2024-05-20 20:08:05] [INFO ] Flatten gal took : 218 ms
[2024-05-20 20:08:05] [INFO ] Flatten gal took : 241 ms
[2024-05-20 20:08:05] [INFO ] Time to serialize gal into /tmp/LTL7519487577709236695.gal : 44 ms
[2024-05-20 20:08:05] [INFO ] Time to serialize properties into /tmp/LTL85035407549994728.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7519487577709236695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL85035407549994728.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...273
Read 1 LTL properties
Checking formula 0 : !((F(G((("(Node58requestsent0>=1)")||(X("(Node58requestsent0<1)")))&&((X("(Node58requestsent0<1)"))||(F(("((Node17IsInserted<1)||(Node...208
Formula 0 simplified : GF((!"(Node58requestsent0>=1)" & X!"(Node58requestsent0<1)") | (X!"(Node58requestsent0<1)" & G(!"((Node17IsInserted<1)||(Node26Reque...194
Detected timeout of ITS tools.
[2024-05-20 20:08:20] [INFO ] Flatten gal took : 231 ms
[2024-05-20 20:08:20] [INFO ] Applying decomposition
[2024-05-20 20:08:21] [INFO ] Flatten gal took : 262 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/graph12674087572413147332.txt' '-o' '/tmp/graph12674087572413147332.bin' '-w' '/tmp/graph12674087572413147332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12674087572413147332.bin' '-l' '-1' '-v' '-w' '/tmp/graph12674087572413147332.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:08:21] [INFO ] Decomposing Gal with order
[2024-05-20 20:08:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:08:22] [INFO ] Removed a total of 10829 redundant transitions.
[2024-05-20 20:08:22] [INFO ] Flatten gal took : 1030 ms
[2024-05-20 20:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 7200 labels/synchronizations in 954 ms.
[2024-05-20 20:08:24] [INFO ] Time to serialize gal into /tmp/LTL9396696134718842420.gal : 51 ms
[2024-05-20 20:08:24] [INFO ] Time to serialize properties into /tmp/LTL8773779419930613432.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/LTL9396696134718842420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8773779419930613432.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((("(u60.Node58requestsent0>=1)")||(X("(u60.Node58requestsent0<1)")))&&((X("(u60.Node58requestsent0<1)"))||(F(("((u18.Node17IsIn...236
Formula 0 simplified : GF((!"(u60.Node58requestsent0>=1)" & X!"(u60.Node58requestsent0<1)") | (X!"(u60.Node58requestsent0<1)" & G(!"((u18.Node17IsInserted<...222
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14710501243108754419
[2024-05-20 20:08:39] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14710501243108754419
Running compilation step : cd /tmp/ltsmin14710501243108754419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14710501243108754419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14710501243108754419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-060-LTLFireability-10 finished in 306516 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(F(p0))||G(p1))))'
[2024-05-20 20:08:42] [INFO ] Flatten gal took : 355 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14112083971433004681
[2024-05-20 20:08:42] [INFO ] Too many transitions (21960) to apply POR reductions. Disabling POR matrices.
[2024-05-20 20:08:42] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14112083971433004681
Running compilation step : cd /tmp/ltsmin14112083971433004681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 20:08:43] [INFO ] Applying decomposition
[2024-05-20 20:08:43] [INFO ] Flatten gal took : 380 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/graph17367542171126686751.txt' '-o' '/tmp/graph17367542171126686751.bin' '-w' '/tmp/graph17367542171126686751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17367542171126686751.bin' '-l' '-1' '-v' '-w' '/tmp/graph17367542171126686751.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:08:44] [INFO ] Decomposing Gal with order
[2024-05-20 20:08:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:08:45] [INFO ] Removed a total of 10823 redundant transitions.
[2024-05-20 20:08:46] [INFO ] Flatten gal took : 1136 ms
[2024-05-20 20:08:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 15170 labels/synchronizations in 1093 ms.
[2024-05-20 20:08:47] [INFO ] Time to serialize gal into /tmp/LTLFireability781160390074009155.gal : 100 ms
[2024-05-20 20:08:47] [INFO ] Time to serialize properties into /tmp/LTLFireability15679609870200186044.ltl : 4 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/LTLFireability781160390074009155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15679609870200186044.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...276
Read 4 LTL properties
Checking formula 0 : !((F(("((i51.u187.Node47IsInserted>=1)&&(i43.i1.u214.Node53requestsent47>=1))")||(G("(i8.u31.Node58GiveAnswer7<1)")))))
Formula 0 simplified : G(!"((i51.u187.Node47IsInserted>=1)&&(i43.i1.u214.Node53requestsent47>=1))" & F!"(i8.u31.Node58GiveAnswer7<1)")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14112083971433004681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 180 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14112083971433004681;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 180 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-20 20:34:47] [INFO ] Flatten gal took : 9769 ms
[2024-05-20 20:34:47] [INFO ] Time to serialize gal into /tmp/LTLFireability11312478529118559280.gal : 137 ms
[2024-05-20 20:34:47] [INFO ] Time to serialize properties into /tmp/LTLFireability8232082047467498006.ltl : 12 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/LTLFireability11312478529118559280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8232082047467498006.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...298
Read 4 LTL properties
Checking formula 0 : !((F(("((Node47IsInserted>=1)&&(Node53requestsent47>=1))")||(G("(Node58GiveAnswer7<1)")))))
Formula 0 simplified : G(!"((Node47IsInserted>=1)&&(Node53requestsent47>=1))" & F!"(Node58GiveAnswer7<1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 474612 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15348768 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="CANInsertWithFailure-PT-060"
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 CANInsertWithFailure-PT-060, 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-171620521500088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-060.tgz
mv CANInsertWithFailure-PT-060 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 ;