About the Execution of 2023-gold for CANInsertWithFailure-PT-040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.787 | 3600000.00 | 11205784.00 | 5106.30 | FFT?FT?FFFF?TFFF | 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-171620521500078.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-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500078
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 9.8M 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-040-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716229710073
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-040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 18:28:31] [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 18:28:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:28:31] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2024-05-20 18:28:31] [INFO ] Transformed 3684 places.
[2024-05-20 18:28:32] [INFO ] Transformed 9840 transitions.
[2024-05-20 18:28:32] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 568 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:28:33] [INFO ] Computed 42 invariants in 475 ms
[2024-05-20 18:28:34] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2024-05-20 18:28:34] [INFO ] Invariant cache hit.
[2024-05-20 18:28:37] [INFO ] Implicit Places using invariants and state equation in 2912 ms returned []
Implicit Place search using SMT with State Equation took 4275 ms to find 0 implicit places.
[2024-05-20 18:28:37] [INFO ] Invariant cache hit.
[2024-05-20 18:28:42] [INFO ] Dead Transitions using invariants and state equation in 4989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9840 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 43 out of 3683 places after structural reductions.
[2024-05-20 18:28:42] [INFO ] Flatten gal took : 387 ms
[2024-05-20 18:28:42] [INFO ] Flatten gal took : 236 ms
[2024-05-20 18:28:43] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 37 out of 3683 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 31) seen :14
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 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 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 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
Running SMT prover for 16 properties.
[2024-05-20 18:28:44] [INFO ] Invariant cache hit.
[2024-05-20 18:28:45] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2024-05-20 18:28:45] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:28:56] [INFO ] After 10137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:5
[2024-05-20 18:28:56] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:29:00] [INFO ] After 3499ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-20 18:29:00] [INFO ] After 15852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-20 18:29:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 39 ms returned sat
[2024-05-20 18:29:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:29:12] [INFO ] After 10504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-20 18:29:25] [INFO ] After 12608ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-20 18:29:25] [INFO ] After 12609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-20 18:29:25] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 9 properties in 329 ms.
Support contains 10 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
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 558 place count 3404 transition count 9561
Performed 1555 Post agglomeration using F-continuation condition.Transition count delta: 1555
Deduced a syphon composed of 1555 places in 6 ms
Reduce places removed 1555 places and 0 transitions.
Iterating global reduction 2 with 3110 rules applied. Total rules applied 3668 place count 1849 transition count 8006
Drop transitions removed 1478 transitions
Redundant transition composition rules discarded 1478 transitions
Iterating global reduction 2 with 1478 rules applied. Total rules applied 5146 place count 1849 transition count 6528
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5148 place count 1849 transition count 6526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5150 place count 1847 transition count 6526
Partial Free-agglomeration rule applied 1558 times.
Drop transitions removed 1558 transitions
Iterating global reduction 3 with 1558 rules applied. Total rules applied 6708 place count 1847 transition count 6526
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 6746 place count 1847 transition count 6526
Applied a total of 6746 rules in 1793 ms. Remains 1847 /3683 variables (removed 1836) and now considering 6526/9840 (removed 3314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1794 ms. Remains : 1847/3683 places, 6526/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6526 rows 1847 cols
[2024-05-20 18:29:27] [INFO ] Computed 42 invariants in 215 ms
[2024-05-20 18:29:28] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:29:28] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-20 18:29:30] [INFO ] After 2132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-20 18:29:30] [INFO ] State equation strengthened by 6311 read => feed constraints.
[2024-05-20 18:29:31] [INFO ] After 942ms SMT Verify possible using 6311 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:29:31] [INFO ] After 3613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:29:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-20 18:29:31] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-20 18:29:34] [INFO ] After 2093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:29:35] [INFO ] After 1760ms SMT Verify possible using 6311 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 18:29:37] [INFO ] After 3211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1194 ms.
[2024-05-20 18:29:38] [INFO ] After 6947ms 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 0 properties in 30 ms.
Support contains 7 out of 1847 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1847/1847 places, 6526/6526 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1845 transition count 6524
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1845 transition count 6524
Applied a total of 5 rules in 409 ms. Remains 1845 /1847 variables (removed 2) and now considering 6524/6526 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 1845/1847 places, 6524/6526 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6524 rows 1845 cols
[2024-05-20 18:29:39] [INFO ] Computed 42 invariants in 145 ms
[2024-05-20 18:29:39] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-20 18:29:39] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:29:41] [INFO ] After 2334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:29:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 18:29:42] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-20 18:29:44] [INFO ] After 1951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:29:44] [INFO ] State equation strengthened by 6316 read => feed constraints.
[2024-05-20 18:29:45] [INFO ] After 1509ms SMT Verify possible using 6316 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:29:46] [INFO ] After 2524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 585 ms.
[2024-05-20 18:29:47] [INFO ] After 5510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6524/6524 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 1845 transition count 6524
Applied a total of 82 rules in 326 ms. Remains 1845 /1845 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 1845/1845 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 105140 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105140 steps, saw 26211 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6524 rows 1845 cols
[2024-05-20 18:29:50] [INFO ] Computed 42 invariants in 147 ms
[2024-05-20 18:29:51] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:29:51] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:29:53] [INFO ] After 2582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:29:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:29:53] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 18:29:55] [INFO ] After 1982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:29:55] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2024-05-20 18:29:58] [INFO ] After 2053ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:29:59] [INFO ] After 3044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 556 ms.
[2024-05-20 18:29:59] [INFO ] After 6027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6524/6524 transitions.
Applied a total of 0 rules in 173 ms. Remains 1845 /1845 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 1845/1845 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6524/6524 transitions.
Applied a total of 0 rules in 157 ms. Remains 1845 /1845 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-20 18:29:59] [INFO ] Invariant cache hit.
[2024-05-20 18:30:01] [INFO ] Implicit Places using invariants in 2053 ms returned []
[2024-05-20 18:30:01] [INFO ] Invariant cache hit.
[2024-05-20 18:30:02] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2024-05-20 18:30:03] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
[2024-05-20 18:30:03] [INFO ] Redundant transitions in 646 ms returned []
[2024-05-20 18:30:03] [INFO ] Invariant cache hit.
[2024-05-20 18:30:06] [INFO ] Dead Transitions using invariants and state equation in 2830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6908 ms. Remains : 1845/1845 places, 6524/6524 transitions.
Graph (trivial) has 6195 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 12 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1628 transitions
Reduce isomorphic transitions removed 6189 transitions.
Graph (complete) has 578 edges and 210 vertex of which 93 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.1 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 93 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 119 place count 93 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 92 transition count 179
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 17 transition count 67
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 17 transition count 67
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 17 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 16 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 16 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 313 place count 16 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 314 place count 15 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 316 place count 14 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 14 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 14 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 13 transition count 22
Applied a total of 320 rules in 78 ms. Remains 13 /1845 variables (removed 1832) and now considering 22/6524 (removed 6502) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 13 cols
[2024-05-20 18:30:06] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 18:30:06] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-20 18:30:06] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:30:06] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:30:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:30:06] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:30:06] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 18:30:06] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA CANInsertWithFailure-PT-040-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(p0) U p1)&&!p0))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 241 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:30:08] [INFO ] Computed 42 invariants in 430 ms
[2024-05-20 18:30:08] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2024-05-20 18:30:08] [INFO ] Invariant cache hit.
[2024-05-20 18:30:12] [INFO ] Implicit Places using invariants and state equation in 3126 ms returned []
Implicit Place search using SMT with State Equation took 4358 ms to find 0 implicit places.
[2024-05-20 18:30:12] [INFO ] Invariant cache hit.
[2024-05-20 18:30:17] [INFO ] Dead Transitions using invariants and state equation in 5394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10014 ms. Remains : 3683/3683 places, 9840/9840 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 233 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2781 1), p0:(LT s680 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 835 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-00 finished in 10344 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))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1494 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 18:30:19] [INFO ] Computed 42 invariants in 236 ms
[2024-05-20 18:30:20] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2024-05-20 18:30:20] [INFO ] Invariant cache hit.
[2024-05-20 18:30:21] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:30:24] [INFO ] Implicit Places using invariants and state equation in 3718 ms returned []
Implicit Place search using SMT with State Equation took 5083 ms to find 0 implicit places.
[2024-05-20 18:30:24] [INFO ] Redundant transitions in 575 ms returned []
[2024-05-20 18:30:25] [INFO ] Invariant cache hit.
[2024-05-20 18:30:27] [INFO ] Dead Transitions using invariants and state equation in 2780 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9969 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s447 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 10080 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)) U (X((p1 U p2))||G(p3))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 302 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:30:28] [INFO ] Computed 42 invariants in 476 ms
[2024-05-20 18:30:30] [INFO ] Implicit Places using invariants in 2444 ms returned []
[2024-05-20 18:30:30] [INFO ] Invariant cache hit.
[2024-05-20 18:30:33] [INFO ] Implicit Places using invariants and state equation in 3036 ms returned []
Implicit Place search using SMT with State Equation took 5492 ms to find 0 implicit places.
[2024-05-20 18:30:33] [INFO ] Invariant cache hit.
[2024-05-20 18:30:39] [INFO ] Dead Transitions using invariants and state equation in 5436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11248 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(LT s187 1), p0:(OR (GEQ s3458 1) (LT s812 1)), p2:(GEQ s3248 1), p1:(GEQ s3458 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 104 reset in 845 ms.
Product exploration explored 100000 steps with 104 reset in 1019 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 669 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 15 states, 47 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 842 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) 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 20) 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 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-20 18:30:43] [INFO ] Invariant cache hit.
[2024-05-20 18:30:44] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-05-20 18:30:44] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 43 ms returned sat
[2024-05-20 18:30:44] [INFO ] After 1041ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:10
[2024-05-20 18:30:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned sat
[2024-05-20 18:30:45] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:30:51] [INFO ] After 5750ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2024-05-20 18:30:51] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:31:07] [INFO ] After 15675ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :5 sat :9
[2024-05-20 18:31:09] [INFO ] After 17933ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :9
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 18:31:09] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :9
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1738 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1753 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-20 18:31:12] [INFO ] Computed 42 invariants in 147 ms
[2024-05-20 18:31:13] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-20 18:31:13] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:31:13] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-20 18:31:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:31:13] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:31:16] [INFO ] After 2916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-20 18:31:16] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:31:20] [INFO ] After 3293ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-20 18:31:22] [INFO ] After 5665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1573 ms.
[2024-05-20 18:31:24] [INFO ] After 10893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 183 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2024-05-20 18:31:24] [INFO ] Invariant cache hit.
[2024-05-20 18:31:25] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:31:25] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:31:25] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 18:31:25] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:31:25] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:31:28] [INFO ] After 2581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 18:31:28] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:31:31] [INFO ] After 2978ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-20 18:31:33] [INFO ] After 5165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1422 ms.
[2024-05-20 18:31:35] [INFO ] After 9881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 196 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 85485 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85485 steps, saw 24447 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-20 18:31:38] [INFO ] Invariant cache hit.
[2024-05-20 18:31:39] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:31:39] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:31:39] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 18:31:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:31:39] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:31:42] [INFO ] After 2574ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 18:31:42] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:31:45] [INFO ] After 3038ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-20 18:31:47] [INFO ] After 5202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1420 ms.
[2024-05-20 18:31:49] [INFO ] After 9891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 53 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 198 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 190 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-20 18:31:49] [INFO ] Invariant cache hit.
[2024-05-20 18:31:51] [INFO ] Implicit Places using invariants in 2018 ms returned []
[2024-05-20 18:31:51] [INFO ] Invariant cache hit.
[2024-05-20 18:31:52] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:32:04] [INFO ] Implicit Places using invariants and state equation in 12696 ms returned []
Implicit Place search using SMT with State Equation took 14746 ms to find 0 implicit places.
[2024-05-20 18:32:05] [INFO ] Redundant transitions in 501 ms returned []
[2024-05-20 18:32:05] [INFO ] Invariant cache hit.
[2024-05-20 18:32:07] [INFO ] Dead Transitions using invariants and state equation in 2733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18199 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Graph (trivial) has 6272 edges and 1846 vertex of which 1679 / 1846 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 418 edges and 169 vertex of which 49 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.0 ms
Discarding 120 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 48 transition count 56
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 121 place count 11 transition count 19
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 9 transition count 14
Applied a total of 164 rules in 14 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 14 rows 9 cols
[2024-05-20 18:32:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:32:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 18:32:07] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 18:32:07] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-20 18:32:07] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p3 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3))), (G (NOT (AND (NOT p0) p1 p2 p3))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (AND p0 (NOT p1) p2 p3)), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND p1 (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND (NOT p2) p3))), (F (NOT p3)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 28 factoid took 1142 ms. Reduced automaton from 15 states, 47 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 744 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 633 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Applied a total of 5149 rules in 1041 ms. Remains 1848 /3683 variables (removed 1835) and now considering 6526/9840 (removed 3314) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-20 18:32:11] [INFO ] Computed 42 invariants in 133 ms
[2024-05-20 18:32:12] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-05-20 18:32:12] [INFO ] Invariant cache hit.
[2024-05-20 18:32:13] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-20 18:32:16] [INFO ] Implicit Places using invariants and state equation in 3585 ms returned []
Implicit Place search using SMT with State Equation took 4888 ms to find 0 implicit places.
[2024-05-20 18:32:17] [INFO ] Redundant transitions in 662 ms returned []
[2024-05-20 18:32:17] [INFO ] Invariant cache hit.
[2024-05-20 18:32:19] [INFO ] Dead Transitions using invariants and state equation in 2762 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1848/3683 places, 6526/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9381 ms. Remains : 1848/3683 places, 6526/9840 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Detected a total of 125/1848 stabilizing places and 202/6526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p3), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 34 factoid took 834 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 619 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2024-05-20 18:32:22] [INFO ] Invariant cache hit.
[2024-05-20 18:32:22] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:32:22] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:32:23] [INFO ] After 617ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2024-05-20 18:32:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:32:23] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:32:26] [INFO ] After 2723ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2024-05-20 18:32:26] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-20 18:32:28] [INFO ] After 2523ms SMT Verify possible using 4755 Read/Feed constraints in natural domain returned unsat :2 sat :10
[2024-05-20 18:32:31] [INFO ] After 4843ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 1469 ms.
[2024-05-20 18:32:32] [INFO ] After 9772ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 3 properties in 29 ms.
Support contains 4 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 1 with 1641 rules applied. Total rules applied 1645 place count 1846 transition count 6524
Applied a total of 1645 rules in 514 ms. Remains 1846 /1848 variables (removed 2) and now considering 6524/6526 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 1846/1848 places, 6524/6526 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 18 ms. (steps per millisecond=555 ) 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 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2024-05-20 18:32:34] [INFO ] Computed 42 invariants in 139 ms
[2024-05-20 18:32:34] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-05-20 18:32:34] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-20 18:32:34] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:32:34] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:32:34] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:32:37] [INFO ] After 2466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:32:37] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:32:39] [INFO ] After 1910ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:32:40] [INFO ] After 3472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 972 ms.
[2024-05-20 18:32:41] [INFO ] After 7495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 233 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 87592 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87592 steps, saw 24756 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 18:32:45] [INFO ] Invariant cache hit.
[2024-05-20 18:32:46] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:32:46] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:32:46] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:32:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:32:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:32:48] [INFO ] After 2251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:32:49] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:32:51] [INFO ] After 2425ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:32:52] [INFO ] After 3939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1037 ms.
[2024-05-20 18:32:54] [INFO ] After 7800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 37 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 200 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 195 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2024-05-20 18:32:54] [INFO ] Invariant cache hit.
[2024-05-20 18:32:56] [INFO ] Implicit Places using invariants in 1865 ms returned []
[2024-05-20 18:32:56] [INFO ] Invariant cache hit.
[2024-05-20 18:32:57] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:33:08] [INFO ] Implicit Places using invariants and state equation in 12131 ms returned []
Implicit Place search using SMT with State Equation took 14001 ms to find 0 implicit places.
[2024-05-20 18:33:08] [INFO ] Redundant transitions in 489 ms returned []
[2024-05-20 18:33:08] [INFO ] Invariant cache hit.
[2024-05-20 18:33:11] [INFO ] Dead Transitions using invariants and state equation in 2602 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17301 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Graph (trivial) has 6272 edges and 1846 vertex of which 1679 / 1846 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1677 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 418 edges and 169 vertex of which 49 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.0 ms
Discarding 120 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 48 transition count 56
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 121 place count 11 transition count 19
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 9 transition count 14
Applied a total of 164 rules in 20 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 14 rows 9 cols
[2024-05-20 18:33:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 18:33:11] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:33:11] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:33:11] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-20 18:33:11] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X p3), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 p3)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT p3))), (X (X p3)), (F (AND p0 p1 p2 (NOT p3))), (F (AND p0 (NOT p1) p2 p3)), (F (AND p0 p1 p2 p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND (NOT p2) p3))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (NOT p3)), (F (AND (NOT p0) (NOT p2) p3)), (F (AND p1 (NOT p2) p3))]
Knowledge based reduction with 36 factoid took 1371 ms. Reduced automaton from 14 states, 43 edges and 4 AP (stutter insensitive) to 14 states, 43 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 519 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 512 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 516 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 488 reset in 931 ms.
Product exploration explored 100000 steps with 492 reset in 967 ms.
Built C files in :
/tmp/ltsmin6078556748245656528
[2024-05-20 18:33:16] [INFO ] Too many transitions (6526) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:33:16] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6078556748245656528
Running compilation step : cd /tmp/ltsmin6078556748245656528;'/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/ltsmin6078556748245656528;'/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/ltsmin6078556748245656528;'/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 1848 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1848/1848 places, 6526/6526 transitions.
Applied a total of 0 rules in 199 ms. Remains 1848 /1848 variables (removed 0) and now considering 6526/6526 (removed 0) transitions.
// Phase 1: matrix 6526 rows 1848 cols
[2024-05-20 18:33:20] [INFO ] Computed 42 invariants in 124 ms
[2024-05-20 18:33:21] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2024-05-20 18:33:21] [INFO ] Invariant cache hit.
[2024-05-20 18:33:22] [INFO ] State equation strengthened by 4755 read => feed constraints.
[2024-05-20 18:33:24] [INFO ] Implicit Places using invariants and state equation in 3575 ms returned []
Implicit Place search using SMT with State Equation took 4797 ms to find 0 implicit places.
[2024-05-20 18:33:25] [INFO ] Redundant transitions in 468 ms returned []
[2024-05-20 18:33:25] [INFO ] Invariant cache hit.
[2024-05-20 18:33:27] [INFO ] Dead Transitions using invariants and state equation in 2737 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8221 ms. Remains : 1848/1848 places, 6526/6526 transitions.
Built C files in :
/tmp/ltsmin5535409397643785533
[2024-05-20 18:33:27] [INFO ] Too many transitions (6526) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:33:28] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5535409397643785533
Running compilation step : cd /tmp/ltsmin5535409397643785533;'/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/ltsmin5535409397643785533;'/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/ltsmin5535409397643785533;'/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 18:33:31] [INFO ] Flatten gal took : 123 ms
[2024-05-20 18:33:31] [INFO ] Flatten gal took : 123 ms
[2024-05-20 18:33:31] [INFO ] Time to serialize gal into /tmp/LTL6707677358485034790.gal : 36 ms
[2024-05-20 18:33:31] [INFO ] Time to serialize properties into /tmp/LTL2307963688393857572.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/LTL6707677358485034790.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6320782568757232580.hoa' '-atoms' '/tmp/LTL2307963688393857572.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/LTL2307963688393857572.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6320782568757232580.hoa
Detected timeout of ITS tools.
[2024-05-20 18:33:46] [INFO ] Flatten gal took : 123 ms
[2024-05-20 18:33:47] [INFO ] Flatten gal took : 110 ms
[2024-05-20 18:33:47] [INFO ] Time to serialize gal into /tmp/LTL12786162805136285349.gal : 23 ms
[2024-05-20 18:33:47] [INFO ] Time to serialize properties into /tmp/LTL4053099025838240996.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/LTL12786162805136285349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4053099025838240996.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("((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))")))U((X(("(Node37GiveAnswer4>=1)")U("(Node34GiveAnswer16>=1)")))||(G("(Node13I...165
Formula 0 simplified : FG!"((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))" R (X(!"(Node37GiveAnswer4>=1)" R !"(Node34GiveAnswer16>=1)") & F!"(Node13ID<1)")
Detected timeout of ITS tools.
[2024-05-20 18:34:02] [INFO ] Flatten gal took : 123 ms
[2024-05-20 18:34:02] [INFO ] Applying decomposition
[2024-05-20 18:34:02] [INFO ] Flatten gal took : 124 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/graph16454628359851834237.txt' '-o' '/tmp/graph16454628359851834237.bin' '-w' '/tmp/graph16454628359851834237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16454628359851834237.bin' '-l' '-1' '-v' '-w' '/tmp/graph16454628359851834237.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:34:02] [INFO ] Decomposing Gal with order
[2024-05-20 18:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:34:03] [INFO ] Removed a total of 4799 redundant transitions.
[2024-05-20 18:34:03] [INFO ] Flatten gal took : 917 ms
[2024-05-20 18:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 313 ms.
[2024-05-20 18:34:04] [INFO ] Time to serialize gal into /tmp/LTL6409649588443061668.gal : 37 ms
[2024-05-20 18:34:04] [INFO ] Time to serialize properties into /tmp/LTL10135165064404664746.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/LTL6409649588443061668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10135165064404664746.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 : !(((G(F("((u5.Node37GiveAnswer4>=1)||(u9.Node3GiveAnswer8<1))")))U((X(("(u5.Node37GiveAnswer4>=1)")U("(u18.Node34GiveAnswer16>=1)")))|...185
Formula 0 simplified : FG!"((u5.Node37GiveAnswer4>=1)||(u9.Node3GiveAnswer8<1))" R (X(!"(u5.Node37GiveAnswer4>=1)" R !"(u18.Node34GiveAnswer16>=1)") & F!"(...175
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4889957531009368801
[2024-05-20 18:34:19] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4889957531009368801
Running compilation step : cd /tmp/ltsmin4889957531009368801;'/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/ltsmin4889957531009368801;'/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/ltsmin4889957531009368801;'/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-040-LTLFireability-03 finished in 234722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1 U !p2))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 267 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:34:23] [INFO ] Computed 42 invariants in 404 ms
[2024-05-20 18:34:25] [INFO ] Implicit Places using invariants in 2381 ms returned []
[2024-05-20 18:34:25] [INFO ] Invariant cache hit.
[2024-05-20 18:34:28] [INFO ] Implicit Places using invariants and state equation in 2999 ms returned []
Implicit Place search using SMT with State Equation took 5422 ms to find 0 implicit places.
[2024-05-20 18:34:28] [INFO ] Invariant cache hit.
[2024-05-20 18:34:33] [INFO ] Dead Transitions using invariants and state equation in 5664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11356 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s441 1) (GEQ s2183 1)), p1:(GEQ s1944 1), p0:(OR (GEQ s2976 1) (LT s441 1) (LT s2183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2914 ms.
Product exploration explored 100000 steps with 50000 reset in 2619 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), true, (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 38 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 17156 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((((p1 U p2)||p0)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 287 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 18:34:40] [INFO ] Invariant cache hit.
[2024-05-20 18:34:42] [INFO ] Implicit Places using invariants in 2032 ms returned []
[2024-05-20 18:34:42] [INFO ] Invariant cache hit.
[2024-05-20 18:34:45] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 5139 ms to find 0 implicit places.
[2024-05-20 18:34:45] [INFO ] Invariant cache hit.
[2024-05-20 18:34:50] [INFO ] Dead Transitions using invariants and state equation in 5682 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11112 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p4) p3), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4) p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1 (NOT p4) p3), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1) (NOT p4) p3), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1 (NOT p4) p3), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p4) p3), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4) p3), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1 (NOT p4) p3), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s2491 1), p0:(OR (LT s2491 1) (LT s1220 1)), p1:(AND (GEQ s273 1) (GEQ s1379 1)), p4:(LT s2599 1), p3:(AND (GEQ s2491 1) (GEQ s1220 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33294 reset in 1976 ms.
Product exploration explored 100000 steps with 33163 reset in 2033 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X (OR p2 p0 p1)), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X (OR p2 p0 p1))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 254 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Interrupted probabilistic random walk after 57434 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 57434 steps, saw 44251 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :2
Running SMT prover for 11 properties.
[2024-05-20 18:34:59] [INFO ] Invariant cache hit.
[2024-05-20 18:34:59] [INFO ] [Real]Absence check using 40 positive place invariants in 33 ms returned sat
[2024-05-20 18:34:59] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-20 18:35:02] [INFO ] After 3845ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2024-05-20 18:35:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 33 ms returned sat
[2024-05-20 18:35:03] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2024-05-20 18:35:08] [INFO ] After 4685ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :4
[2024-05-20 18:35:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:35:23] [INFO ] After 15368ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2024-05-20 18:35:26] [INFO ] After 18463ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 835 ms.
[2024-05-20 18:35:27] [INFO ] After 24784ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5159 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions removed 1638 transitions
Iterating global reduction 3 with 1638 rules applied. Total rules applied 6799 place count 1843 transition count 6519
Applied a total of 6799 rules in 1512 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1512 ms. Remains : 1843/3683 places, 6519/9840 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 18:35:29] [INFO ] Computed 42 invariants in 145 ms
[2024-05-20 18:35:30] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:35:30] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:35:31] [INFO ] After 1948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:35:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2024-05-20 18:35:32] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:35:34] [INFO ] After 1790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:35:34] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:35:35] [INFO ] After 1349ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:35:36] [INFO ] After 2182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 555 ms.
[2024-05-20 18:35:36] [INFO ] After 4961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 198 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 87739 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87739 steps, saw 25499 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-20 18:35:40] [INFO ] Invariant cache hit.
[2024-05-20 18:35:40] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:35:40] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:35:42] [INFO ] After 2059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:35:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:35:42] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:35:44] [INFO ] After 2205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:35:44] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:35:46] [INFO ] After 1320ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:35:47] [INFO ] After 2169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 646 ms.
[2024-05-20 18:35:47] [INFO ] After 5448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 203 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 199 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 18:35:48] [INFO ] Invariant cache hit.
[2024-05-20 18:35:50] [INFO ] Implicit Places using invariants in 1834 ms returned []
[2024-05-20 18:35:50] [INFO ] Invariant cache hit.
[2024-05-20 18:35:50] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:35:51] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 3103 ms to find 0 implicit places.
[2024-05-20 18:35:51] [INFO ] Redundant transitions in 494 ms returned []
[2024-05-20 18:35:51] [INFO ] Invariant cache hit.
[2024-05-20 18:35:54] [INFO ] Dead Transitions using invariants and state equation in 2605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6415 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6264 edges and 1843 vertex of which 1676 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1674 places
Drop transitions removed 4709 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6341 transitions.
Graph (complete) has 420 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.0 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 51 transition count 60
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 120 place count 14 transition count 23
Iterating global reduction 2 with 37 rules applied. Total rules applied 157 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 13 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 11 ms. Remains 11 /1843 variables (removed 1832) and now considering 17/6519 (removed 6502) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 11 cols
[2024-05-20 18:35:54] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:35:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:35:54] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:35:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:35:54] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:35:54] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 18:35:54] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X (OR p2 p0 p1)), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X (OR p2 p0 p1))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (AND p0 p1 (NOT p2) p3 (NOT p4)))), (G (OR p0 p1 p2)), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 387 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 1026 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:35:56] [INFO ] Computed 42 invariants in 142 ms
[2024-05-20 18:35:57] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-20 18:35:57] [INFO ] Invariant cache hit.
[2024-05-20 18:35:58] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:36:01] [INFO ] Implicit Places using invariants and state equation in 3650 ms returned []
Implicit Place search using SMT with State Equation took 4976 ms to find 0 implicit places.
[2024-05-20 18:36:01] [INFO ] Redundant transitions in 484 ms returned []
[2024-05-20 18:36:01] [INFO ] Invariant cache hit.
[2024-05-20 18:36:04] [INFO ] Dead Transitions using invariants and state equation in 2622 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9120 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (OR p1 p2 (NOT p3) p4)), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 137 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2024-05-20 18:36:05] [INFO ] Invariant cache hit.
[2024-05-20 18:36:05] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:36:05] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:36:05] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2024-05-20 18:36:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:36:05] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:36:08] [INFO ] After 2488ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2024-05-20 18:36:08] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:36:10] [INFO ] After 1807ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2024-05-20 18:36:11] [INFO ] After 3073ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 814 ms.
[2024-05-20 18:36:12] [INFO ] After 6910ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 592 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 1843/1845 places, 6519/6521 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 5) 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 5) 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 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 18:36:13] [INFO ] Computed 42 invariants in 155 ms
[2024-05-20 18:36:13] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-20 18:36:13] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:36:13] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:36:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:36:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-20 18:36:16] [INFO ] After 2168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:36:16] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:36:18] [INFO ] After 1642ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 18:36:19] [INFO ] After 2646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 671 ms.
[2024-05-20 18:36:19] [INFO ] After 5976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 213 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 85655 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85655 steps, saw 25181 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 18:36:23] [INFO ] Invariant cache hit.
[2024-05-20 18:36:23] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:36:23] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:36:23] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:36:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:36:24] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-20 18:36:26] [INFO ] After 2009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:36:26] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:36:28] [INFO ] After 1932ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 18:36:29] [INFO ] After 2951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 662 ms.
[2024-05-20 18:36:29] [INFO ] After 6100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 225 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 215 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 18:36:30] [INFO ] Invariant cache hit.
[2024-05-20 18:36:32] [INFO ] Implicit Places using invariants in 1892 ms returned []
[2024-05-20 18:36:32] [INFO ] Invariant cache hit.
[2024-05-20 18:36:33] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:36:33] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 3069 ms to find 0 implicit places.
[2024-05-20 18:36:33] [INFO ] Redundant transitions in 504 ms returned []
[2024-05-20 18:36:33] [INFO ] Invariant cache hit.
[2024-05-20 18:36:36] [INFO ] Dead Transitions using invariants and state equation in 2686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6490 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6264 edges and 1843 vertex of which 1676 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1674 places
Drop transitions removed 4709 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6341 transitions.
Graph (complete) has 420 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.0 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 51 transition count 60
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 120 place count 14 transition count 23
Iterating global reduction 2 with 37 rules applied. Total rules applied 157 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 13 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 11 ms. Remains 11 /1843 variables (removed 1832) and now considering 17/6519 (removed 6502) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 17 rows 11 cols
[2024-05-20 18:36:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:36:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 18:36:36] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:36:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:36:36] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:36:36] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 18:36:36] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (OR p1 p2 (NOT p3) p4)), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (G (OR p1 p2 (NOT p3) p4)), (G (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p3 (NOT p4))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))))]
Knowledge based reduction with 24 factoid took 252 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Product exploration explored 100000 steps with 33308 reset in 1660 ms.
Product exploration explored 100000 steps with 33246 reset in 1668 ms.
Built C files in :
/tmp/ltsmin16600030260987741452
[2024-05-20 18:36:40] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:36:40] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16600030260987741452
Running compilation step : cd /tmp/ltsmin16600030260987741452;'/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/ltsmin16600030260987741452;'/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/ltsmin16600030260987741452;'/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 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 206 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:36:44] [INFO ] Computed 42 invariants in 144 ms
[2024-05-20 18:36:45] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2024-05-20 18:36:45] [INFO ] Invariant cache hit.
[2024-05-20 18:36:46] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:36:49] [INFO ] Implicit Places using invariants and state equation in 4216 ms returned []
Implicit Place search using SMT with State Equation took 5479 ms to find 0 implicit places.
[2024-05-20 18:36:50] [INFO ] Redundant transitions in 481 ms returned []
[2024-05-20 18:36:50] [INFO ] Invariant cache hit.
[2024-05-20 18:36:52] [INFO ] Dead Transitions using invariants and state equation in 2596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8770 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Built C files in :
/tmp/ltsmin4221557481841549474
[2024-05-20 18:36:52] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:36:52] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4221557481841549474
Running compilation step : cd /tmp/ltsmin4221557481841549474;'/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/ltsmin4221557481841549474;'/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/ltsmin4221557481841549474;'/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 18:36:55] [INFO ] Flatten gal took : 115 ms
[2024-05-20 18:36:56] [INFO ] Flatten gal took : 133 ms
[2024-05-20 18:36:56] [INFO ] Time to serialize gal into /tmp/LTL13283380165841522725.gal : 21 ms
[2024-05-20 18:36:56] [INFO ] Time to serialize properties into /tmp/LTL8301930241326255072.prop : 3 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/LTL13283380165841522725.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8061677925911918982.hoa' '-atoms' '/tmp/LTL8301930241326255072.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8301930241326255072.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8061677925911918982.hoa
Detected timeout of ITS tools.
[2024-05-20 18:37:11] [INFO ] Flatten gal took : 106 ms
[2024-05-20 18:37:11] [INFO ] Flatten gal took : 116 ms
[2024-05-20 18:37:11] [INFO ] Time to serialize gal into /tmp/LTL112250378944454442.gal : 20 ms
[2024-05-20 18:37:11] [INFO ] Time to serialize properties into /tmp/LTL4525459744607915111.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/LTL112250378944454442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4525459744607915111.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G((("((Node24requestsent29<1)||(Node8GiveAnswer17<1))")||(("((Node19IsInserted>=1)&&(Node10requestsent19>=1))")U("(Node24requests...415
Formula 0 simplified : GF((!"((Node24requestsent29<1)||(Node8GiveAnswer17<1))" & (!"((Node19IsInserted>=1)&&(Node10requestsent19>=1))" R !"(Node24requestse...342
Detected timeout of ITS tools.
[2024-05-20 18:37:26] [INFO ] Flatten gal took : 113 ms
[2024-05-20 18:37:26] [INFO ] Applying decomposition
[2024-05-20 18:37:26] [INFO ] Flatten gal took : 107 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/graph8337607146360134230.txt' '-o' '/tmp/graph8337607146360134230.bin' '-w' '/tmp/graph8337607146360134230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8337607146360134230.bin' '-l' '-1' '-v' '-w' '/tmp/graph8337607146360134230.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:37:27] [INFO ] Decomposing Gal with order
[2024-05-20 18:37:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:37:27] [INFO ] Removed a total of 4814 redundant transitions.
[2024-05-20 18:37:27] [INFO ] Flatten gal took : 408 ms
[2024-05-20 18:37:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 200 ms.
[2024-05-20 18:37:27] [INFO ] Time to serialize gal into /tmp/LTL7117537980590794720.gal : 33 ms
[2024-05-20 18:37:27] [INFO ] Time to serialize properties into /tmp/LTL13334132475259350720.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/LTL7117537980590794720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13334132475259350720.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((("((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))")||(("((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))")U(...467
Formula 0 simplified : GF((!"((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))" & (!"((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))" R !"...386
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8835295714040764581
[2024-05-20 18:37:43] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8835295714040764581
Running compilation step : cd /tmp/ltsmin8835295714040764581;'/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/ltsmin8835295714040764581;'/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/ltsmin8835295714040764581;'/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-040-LTLFireability-06 finished in 186282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 266 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:37:46] [INFO ] Computed 42 invariants in 402 ms
[2024-05-20 18:37:48] [INFO ] Implicit Places using invariants in 2307 ms returned []
[2024-05-20 18:37:48] [INFO ] Invariant cache hit.
[2024-05-20 18:37:51] [INFO ] Implicit Places using invariants and state equation in 2905 ms returned []
Implicit Place search using SMT with State Equation took 5215 ms to find 0 implicit places.
[2024-05-20 18:37:51] [INFO ] Invariant cache hit.
[2024-05-20 18:37:56] [INFO ] Dead Transitions using invariants and state equation in 5354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10835 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3682 1)), p0:(GEQ s1380 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1076 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-08 finished in 11304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 282 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 18:37:57] [INFO ] Invariant cache hit.
[2024-05-20 18:37:59] [INFO ] Implicit Places using invariants in 2023 ms returned []
[2024-05-20 18:37:59] [INFO ] Invariant cache hit.
[2024-05-20 18:38:02] [INFO ] Implicit Places using invariants and state equation in 3031 ms returned []
Implicit Place search using SMT with State Equation took 5055 ms to find 0 implicit places.
[2024-05-20 18:38:02] [INFO ] Invariant cache hit.
[2024-05-20 18:38:08] [INFO ] Dead Transitions using invariants and state equation in 5528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10867 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(LT s1358 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3569 steps with 4 reset in 28 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-09 finished in 11015 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))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 292 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 18:38:08] [INFO ] Invariant cache hit.
[2024-05-20 18:38:10] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2024-05-20 18:38:10] [INFO ] Invariant cache hit.
[2024-05-20 18:38:12] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 3637 ms to find 0 implicit places.
[2024-05-20 18:38:12] [INFO ] Invariant cache hit.
[2024-05-20 18:38:17] [INFO ] Dead Transitions using invariants and state equation in 5643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9574 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (GEQ s2592 1) (GEQ s91 1) (GEQ s306 1)), p0:(AND (GEQ s264 1) (GEQ s497 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-10 finished in 9744 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(p1)&&F(p2)) U (G(((X(p1)&&F(p2))||X(G(p1))))||(!p3&&((X(p1)&&F(p2))||X(G(p1))))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 279 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 18:38:18] [INFO ] Invariant cache hit.
[2024-05-20 18:38:19] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-20 18:38:19] [INFO ] Invariant cache hit.
[2024-05-20 18:38:22] [INFO ] Implicit Places using invariants and state equation in 3053 ms returned []
Implicit Place search using SMT with State Equation took 3857 ms to find 0 implicit places.
[2024-05-20 18:38:22] [INFO ] Invariant cache hit.
[2024-05-20 18:38:27] [INFO ] Dead Transitions using invariants and state equation in 5700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9837 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 2} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={1, 2} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0, 2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={1, 2} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3 p1), acceptance={1, 2} source=3 dest: 3}], [{ cond=p0, acceptance={0, 2} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p3), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p0) p3 p1), acceptance={1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={1, 2} source=5 dest: 3}, { cond=(NOT p2), acceptance={0, 2} source=5 dest: 5}]], initial=0, aps=[p0:(LT s1912 1), p2:(LT s102 1), p3:(AND (GEQ s119 1) (GEQ s889 1)), p1:(LT s1550 1)], nbAcceptance=3, 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 105 reset in 1049 ms.
Product exploration explored 100000 steps with 105 reset in 1102 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1)))]
Knowledge based reduction with 37 factoid took 903 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2024-05-20 18:38:32] [INFO ] Invariant cache hit.
[2024-05-20 18:38:33] [INFO ] [Real]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-20 18:38:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:38:38] [INFO ] After 4522ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:12
[2024-05-20 18:38:38] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:38:42] [INFO ] After 4653ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-20 18:38:42] [INFO ] After 10800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-20 18:38:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-20 18:38:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:38:51] [INFO ] After 6750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-20 18:39:04] [INFO ] After 13259ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-20 18:39:07] [INFO ] After 16460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 18:39:07] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 2 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1440 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 1845/3683 places, 6522/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) 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 14) 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 14) 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 14) 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 14) 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 14) seen :0
Interrupted probabilistic random walk after 81007 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 81007 steps, saw 23457 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-20 18:39:13] [INFO ] Computed 42 invariants in 157 ms
[2024-05-20 18:39:13] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:39:13] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:39:16] [INFO ] After 2052ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:12
[2024-05-20 18:39:16] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:39:17] [INFO ] After 1043ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-20 18:39:17] [INFO ] After 4025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-20 18:39:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:39:17] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:39:21] [INFO ] After 3607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-20 18:39:24] [INFO ] After 2966ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-20 18:39:28] [INFO ] After 6587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2538 ms.
[2024-05-20 18:39:31] [INFO ] After 13735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 215 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 14) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2024-05-20 18:39:31] [INFO ] Invariant cache hit.
[2024-05-20 18:39:32] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:39:32] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:39:34] [INFO ] After 2013ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:10
[2024-05-20 18:39:34] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:39:35] [INFO ] After 903ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:39:35] [INFO ] After 3745ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:39:36] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-20 18:39:36] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:39:39] [INFO ] After 3279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 18:39:42] [INFO ] After 3127ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-20 18:39:46] [INFO ] After 6282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2083 ms.
[2024-05-20 18:39:48] [INFO ] After 12532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 207 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 79508 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79508 steps, saw 23236 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 12 properties.
[2024-05-20 18:39:52] [INFO ] Invariant cache hit.
[2024-05-20 18:39:52] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:39:52] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:39:54] [INFO ] After 1950ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:10
[2024-05-20 18:39:54] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:39:55] [INFO ] After 914ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:39:55] [INFO ] After 3655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:39:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:39:56] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:39:59] [INFO ] After 3160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 18:40:02] [INFO ] After 3093ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-20 18:40:06] [INFO ] After 6353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2114 ms.
[2024-05-20 18:40:08] [INFO ] After 12492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 218 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 196 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-20 18:40:08] [INFO ] Invariant cache hit.
[2024-05-20 18:40:10] [INFO ] Implicit Places using invariants in 1889 ms returned []
[2024-05-20 18:40:10] [INFO ] Invariant cache hit.
[2024-05-20 18:40:11] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:40:11] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 3139 ms to find 0 implicit places.
[2024-05-20 18:40:12] [INFO ] Redundant transitions in 496 ms returned []
[2024-05-20 18:40:12] [INFO ] Invariant cache hit.
[2024-05-20 18:40:14] [INFO ] Dead Transitions using invariants and state equation in 2619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6464 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND (NOT p2) p3 p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p0 p3)), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT p2)), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 37 factoid took 1480 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 277 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:40:17] [INFO ] Computed 42 invariants in 397 ms
[2024-05-20 18:40:19] [INFO ] Implicit Places using invariants in 2356 ms returned []
[2024-05-20 18:40:19] [INFO ] Invariant cache hit.
[2024-05-20 18:40:22] [INFO ] Implicit Places using invariants and state equation in 2981 ms returned []
Implicit Place search using SMT with State Equation took 5339 ms to find 0 implicit places.
[2024-05-20 18:40:22] [INFO ] Invariant cache hit.
[2024-05-20 18:40:28] [INFO ] Dead Transitions using invariants and state equation in 5607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11224 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 37 factoid took 859 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2024-05-20 18:40:29] [INFO ] Invariant cache hit.
[2024-05-20 18:40:30] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-05-20 18:40:30] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2024-05-20 18:40:36] [INFO ] After 4779ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:11
[2024-05-20 18:40:36] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:40:41] [INFO ] After 4749ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-20 18:40:41] [INFO ] After 11217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-20 18:40:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-20 18:40:42] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2024-05-20 18:40:49] [INFO ] After 7015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-20 18:41:01] [INFO ] After 11864ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :15
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2024-05-20 18:41:06] [INFO ] After 16255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 18:41:06] [INFO ] After 25100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1558 Post agglomeration using F-continuation condition.Transition count delta: 1558
Deduced a syphon composed of 1558 places in 2 ms
Reduce places removed 1558 places and 0 transitions.
Iterating global reduction 3 with 3116 rules applied. Total rules applied 3672 place count 1847 transition count 8004
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 3 with 1480 rules applied. Total rules applied 5152 place count 1847 transition count 6524
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5154 place count 1847 transition count 6522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5156 place count 1845 transition count 6522
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 4 with 1640 rules applied. Total rules applied 6796 place count 1845 transition count 6522
Applied a total of 6796 rules in 1419 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6522/9840 (removed 3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1420 ms. Remains : 1845/3683 places, 6522/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 6522 rows 1845 cols
[2024-05-20 18:41:08] [INFO ] Computed 42 invariants in 152 ms
[2024-05-20 18:41:08] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:41:09] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:41:11] [INFO ] After 1930ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2024-05-20 18:41:11] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:41:12] [INFO ] After 785ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:41:12] [INFO ] After 3599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:41:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:41:12] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:41:15] [INFO ] After 2790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 18:41:18] [INFO ] After 2869ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-20 18:41:22] [INFO ] After 6374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2110 ms.
[2024-05-20 18:41:24] [INFO ] After 12122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 200 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 80895 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80895 steps, saw 23432 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 12 properties.
[2024-05-20 18:41:28] [INFO ] Invariant cache hit.
[2024-05-20 18:41:28] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:41:28] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:41:30] [INFO ] After 2037ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2024-05-20 18:41:30] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:41:31] [INFO ] After 745ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:41:31] [INFO ] After 3644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 18:41:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:41:32] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:41:35] [INFO ] After 3451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 18:41:38] [INFO ] After 2852ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-20 18:41:41] [INFO ] After 5967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2134 ms.
[2024-05-20 18:41:44] [INFO ] After 12334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 217 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6522/6522 transitions.
Applied a total of 0 rules in 208 ms. Remains 1845 /1845 variables (removed 0) and now considering 6522/6522 (removed 0) transitions.
[2024-05-20 18:41:44] [INFO ] Invariant cache hit.
[2024-05-20 18:41:46] [INFO ] Implicit Places using invariants in 1929 ms returned []
[2024-05-20 18:41:46] [INFO ] Invariant cache hit.
[2024-05-20 18:41:47] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2024-05-20 18:41:47] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 3215 ms to find 0 implicit places.
[2024-05-20 18:41:48] [INFO ] Redundant transitions in 486 ms returned []
[2024-05-20 18:41:48] [INFO ] Invariant cache hit.
[2024-05-20 18:41:50] [INFO ] Dead Transitions using invariants and state equation in 2593 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6518 ms. Remains : 1845/1845 places, 6522/6522 transitions.
Graph (trivial) has 6270 edges and 1845 vertex of which 1678 / 1845 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4714 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6346 transitions.
Graph (complete) has 418 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.1 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 52 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 51 transition count 59
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 118 place count 15 transition count 23
Iterating global reduction 2 with 36 rules applied. Total rules applied 154 place count 15 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 15 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 14 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 14 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 13 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 12 transition count 17
Applied a total of 162 rules in 13 ms. Remains 12 /1845 variables (removed 1833) and now considering 17/6522 (removed 6505) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 17 rows 12 cols
[2024-05-20 18:41:50] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:41:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 18:41:50] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:7
[2024-05-20 18:41:50] [INFO ] After 15ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-20 18:41:50] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:7
[2024-05-20 18:41:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:41:50] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 18:41:50] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-20 18:41:50] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Knowledge obtained : [(AND p0 p2 (NOT p3) p1), (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2) p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p3)))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND p0 p3)), (F (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))), (F (NOT p2)), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 37 factoid took 1433 ms. Reduced automaton from 6 states, 28 edges and 4 AP (stutter sensitive) to 6 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 105 reset in 735 ms.
Product exploration explored 100000 steps with 106 reset in 742 ms.
Applying partial POR strategy [false, false, true, true, false, true]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 3683 transition count 9840
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 198 place count 3683 transition count 9840
Deduced a syphon composed of 239 places in 3 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 239 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 319 place count 3603 transition count 9760
Deduced a syphon composed of 159 places in 3 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 399 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3036
Deduced a syphon composed of 1756 places in 3 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1996 place count 3603 transition count 12796
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 2153 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 2 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 2310 place count 3446 transition count 12639
Deduced a syphon composed of 1599 places in 2 ms
Drop transitions removed 1480 transitions
Redundant transition composition rules discarded 1480 transitions
Iterating global reduction 1 with 1480 rules applied. Total rules applied 3790 place count 3446 transition count 11159
Deduced a syphon composed of 1599 places in 1 ms
Applied a total of 3790 rules in 1984 ms. Remains 3446 /3683 variables (removed 237) and now considering 11159/9840 (removed -1319) transitions.
// Phase 1: matrix 11159 rows 3446 cols
[2024-05-20 18:41:57] [INFO ] Computed 42 invariants in 362 ms
[2024-05-20 18:42:03] [INFO ] Dead Transitions using invariants and state equation in 6306 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3446/3683 places, 11159/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8293 ms. Remains : 3446/3683 places, 11159/9840 transitions.
Built C files in :
/tmp/ltsmin5704082083841114247
[2024-05-20 18:42:03] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5704082083841114247
Running compilation step : cd /tmp/ltsmin5704082083841114247;'/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/ltsmin5704082083841114247;'/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/ltsmin5704082083841114247;'/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 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 281 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:42:07] [INFO ] Computed 42 invariants in 411 ms
[2024-05-20 18:42:09] [INFO ] Implicit Places using invariants in 2354 ms returned []
[2024-05-20 18:42:09] [INFO ] Invariant cache hit.
[2024-05-20 18:42:12] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 5372 ms to find 0 implicit places.
[2024-05-20 18:42:12] [INFO ] Invariant cache hit.
[2024-05-20 18:42:17] [INFO ] Dead Transitions using invariants and state equation in 5138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10792 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Built C files in :
/tmp/ltsmin9732000929185138291
[2024-05-20 18:42:17] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9732000929185138291
Running compilation step : cd /tmp/ltsmin9732000929185138291;'/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/ltsmin9732000929185138291;'/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/ltsmin9732000929185138291;'/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 18:42:20] [INFO ] Flatten gal took : 160 ms
[2024-05-20 18:42:20] [INFO ] Flatten gal took : 159 ms
[2024-05-20 18:42:20] [INFO ] Time to serialize gal into /tmp/LTL13527768495384549910.gal : 28 ms
[2024-05-20 18:42:20] [INFO ] Time to serialize properties into /tmp/LTL5221129421062104287.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/LTL13527768495384549910.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5935311945379200755.hoa' '-atoms' '/tmp/LTL5221129421062104287.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5221129421062104287.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5935311945379200755.hoa
Detected timeout of ITS tools.
[2024-05-20 18:42:36] [INFO ] Flatten gal took : 186 ms
[2024-05-20 18:42:36] [INFO ] Flatten gal took : 190 ms
[2024-05-20 18:42:36] [INFO ] Time to serialize gal into /tmp/LTL14707597340310428692.gal : 98 ms
[2024-05-20 18:42:36] [INFO ] Time to serialize properties into /tmp/LTL5681561846316735426.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/LTL14707597340310428692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5681561846316735426.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(("(Node17GiveAnswer11<1)")||(((X("(Node12GiveAnswer26<1)"))&&(F("(Node7DHTinfo<1)")))U((G((X(G("(Node12GiveAnswer26<1)")))||((X...367
Formula 0 simplified : GF(!"(Node17GiveAnswer11<1)" & ((X!"(Node12GiveAnswer26<1)" | G!"(Node7DHTinfo<1)") R (F((X!"(Node12GiveAnswer26<1)" | G!"(Node7DHTi...336
Detected timeout of ITS tools.
[2024-05-20 18:42:51] [INFO ] Flatten gal took : 189 ms
[2024-05-20 18:42:51] [INFO ] Applying decomposition
[2024-05-20 18:42:51] [INFO ] Flatten gal took : 200 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/graph15876373779950383498.txt' '-o' '/tmp/graph15876373779950383498.bin' '-w' '/tmp/graph15876373779950383498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15876373779950383498.bin' '-l' '-1' '-v' '-w' '/tmp/graph15876373779950383498.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:42:52] [INFO ] Decomposing Gal with order
[2024-05-20 18:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:42:52] [INFO ] Removed a total of 4817 redundant transitions.
[2024-05-20 18:42:53] [INFO ] Flatten gal took : 420 ms
[2024-05-20 18:42:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4604 labels/synchronizations in 280 ms.
[2024-05-20 18:42:53] [INFO ] Time to serialize gal into /tmp/LTL8480763554287424335.gal : 67 ms
[2024-05-20 18:42:53] [INFO ] Time to serialize properties into /tmp/LTL11308715527032274064.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/LTL8480763554287424335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11308715527032274064.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(("(u46.Node17GiveAnswer11<1)")||(((X("(i47.u107.Node12GiveAnswer26<1)"))&&(F("(i11.i1.u28.Node7DHTinfo<1)")))U((G((X(G("(i47.u1...464
Formula 0 simplified : GF(!"(u46.Node17GiveAnswer11<1)" & ((X!"(i47.u107.Node12GiveAnswer26<1)" | G!"(i11.i1.u28.Node7DHTinfo<1)") R (F((X!"(i47.u107.Node1...433
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4956081821326278260
[2024-05-20 18:43:08] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4956081821326278260
Running compilation step : cd /tmp/ltsmin4956081821326278260;'/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/ltsmin4956081821326278260;'/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/ltsmin4956081821326278260;'/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-040-LTLFireability-11 finished in 293484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X((G(p1) U X(p2))))||p0))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 292 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 18:43:11] [INFO ] Invariant cache hit.
[2024-05-20 18:43:13] [INFO ] Implicit Places using invariants in 1976 ms returned []
[2024-05-20 18:43:13] [INFO ] Invariant cache hit.
[2024-05-20 18:43:16] [INFO ] Implicit Places using invariants and state equation in 3023 ms returned []
Implicit Place search using SMT with State Equation took 5003 ms to find 0 implicit places.
[2024-05-20 18:43:16] [INFO ] Invariant cache hit.
[2024-05-20 18:43:22] [INFO ] Dead Transitions using invariants and state equation in 5576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10874 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s119 1) (LT s733 1)), p1:(LT s660 1), p2:(AND (GEQ s119 1) (GEQ s733 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1827 ms.
Product exploration explored 100000 steps with 33333 reset in 1766 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 14909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 1123 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:43:27] [INFO ] Computed 42 invariants in 150 ms
[2024-05-20 18:43:28] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2024-05-20 18:43:28] [INFO ] Invariant cache hit.
[2024-05-20 18:43:29] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:43:32] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4967 ms to find 0 implicit places.
[2024-05-20 18:43:33] [INFO ] Redundant transitions in 476 ms returned []
[2024-05-20 18:43:33] [INFO ] Invariant cache hit.
[2024-05-20 18:43:35] [INFO ] Dead Transitions using invariants and state equation in 2799 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9375 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s161 1) (GEQ s1070 1)), p1:(LT s428 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 492 reset in 982 ms.
Product exploration explored 100000 steps with 496 reset in 1041 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:43:38] [INFO ] Invariant cache hit.
[2024-05-20 18:43:38] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:43:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:43:40] [INFO ] After 1460ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:43:40] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:43:40] [INFO ] After 458ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:43:40] [INFO ] After 2246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:43:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:43:40] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:43:42] [INFO ] After 1520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:43:42] [INFO ] After 425ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:43:43] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-20 18:43:43] [INFO ] After 2616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1)))
Knowledge based reduction with 13 factoid took 151 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 17033 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)) U (X((p1 U p2))||G(p3))))'
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((((p1 U p2)||p0)&&((p1 U p2)||X((!p3 U (p4||G(!p3)))))))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-040-LTLFireability-06
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 931 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:43:45] [INFO ] Computed 42 invariants in 146 ms
[2024-05-20 18:43:46] [INFO ] Implicit Places using invariants in 1288 ms returned []
[2024-05-20 18:43:46] [INFO ] Invariant cache hit.
[2024-05-20 18:43:47] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:43:50] [INFO ] Implicit Places using invariants and state equation in 4054 ms returned []
Implicit Place search using SMT with State Equation took 5344 ms to find 0 implicit places.
[2024-05-20 18:43:50] [INFO ] Invariant cache hit.
[2024-05-20 18:43:53] [INFO ] Dead Transitions using invariants and state equation in 2791 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9068 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p4) p3), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4) p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1 (NOT p4) p3), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1) (NOT p4) p3), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1 (NOT p4) p3), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p4) p3), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p4) p3), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1 (NOT p4) p3), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s1233 1), p0:(OR (LT s1233 1) (LT s581 1)), p1:(AND (GEQ s119 1) (GEQ s663 1)), p4:(LT s1289 1), p3:(AND (GEQ s1233 1) (GEQ s581 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33221 reset in 1733 ms.
Product exploration explored 100000 steps with 33267 reset in 1745 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X (OR p2 p0 p1)), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X (OR p2 p0 p1))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 238 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 4 states, 27 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
[2024-05-20 18:43:57] [INFO ] Invariant cache hit.
[2024-05-20 18:43:57] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:43:57] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:43:59] [INFO ] After 2132ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:3
[2024-05-20 18:43:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:43:59] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:44:01] [INFO ] After 1845ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2024-05-20 18:44:01] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:44:03] [INFO ] After 1680ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2024-05-20 18:44:05] [INFO ] After 3097ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 658 ms.
[2024-05-20 18:44:05] [INFO ] After 6027ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 629 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 1843/1845 places, 6519/6521 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) 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 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 18:44:06] [INFO ] Computed 42 invariants in 156 ms
[2024-05-20 18:44:06] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:44:06] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:44:08] [INFO ] After 1899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:44:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:44:08] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:44:10] [INFO ] After 2028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:44:10] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:44:11] [INFO ] After 810ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:44:12] [INFO ] After 1117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 211 ms.
[2024-05-20 18:44:12] [INFO ] After 3695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 229 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 95130 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95130 steps, saw 26410 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:44:15] [INFO ] Invariant cache hit.
[2024-05-20 18:44:15] [INFO ] [Real]Absence check using 40 positive place invariants in 17 ms returned sat
[2024-05-20 18:44:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:44:17] [INFO ] After 1827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:44:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:44:17] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:44:19] [INFO ] After 2113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:44:19] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:44:20] [INFO ] After 719ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:44:20] [INFO ] After 998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 367 ms.
[2024-05-20 18:44:21] [INFO ] After 3845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 219 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 214 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 18:44:21] [INFO ] Invariant cache hit.
[2024-05-20 18:44:23] [INFO ] Implicit Places using invariants in 1941 ms returned []
[2024-05-20 18:44:23] [INFO ] Invariant cache hit.
[2024-05-20 18:44:24] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:44:24] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 3134 ms to find 0 implicit places.
[2024-05-20 18:44:25] [INFO ] Redundant transitions in 486 ms returned []
[2024-05-20 18:44:25] [INFO ] Invariant cache hit.
[2024-05-20 18:44:28] [INFO ] Dead Transitions using invariants and state equation in 2737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6611 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6264 edges and 1843 vertex of which 1676 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1674 places
Drop transitions removed 4709 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6341 transitions.
Graph (complete) has 420 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.1 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 51 transition count 60
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 120 place count 14 transition count 23
Iterating global reduction 2 with 37 rules applied. Total rules applied 157 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 13 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 26 ms. Remains 11 /1843 variables (removed 1832) and now considering 17/6519 (removed 6502) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 11 cols
[2024-05-20 18:44:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:44:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:44:28] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:44:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 18:44:28] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:44:28] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 18:44:28] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) p4 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3))), (X (OR p2 p0 p1)), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3))))), (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) p0 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 p1 (NOT p4) p3)))), (X (X (OR p2 p0 p1))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND p1 (NOT p4) (NOT p3)))))), (X (X (NOT (OR (AND p2 (NOT p4) p3) (AND p0 (NOT p4) p3) (AND p1 (NOT p4) p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (AND p0 p1 (NOT p2) p3 (NOT p4)))), (G (OR p0 p1 p2)), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3 (NOT p4))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2) (NOT p3) (NOT p4)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 34 factoid took 450 ms. Reduced automaton from 4 states, 27 edges and 5 AP (stutter sensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 202 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:44:29] [INFO ] Computed 42 invariants in 137 ms
[2024-05-20 18:44:30] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2024-05-20 18:44:30] [INFO ] Invariant cache hit.
[2024-05-20 18:44:31] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:44:33] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 4667 ms to find 0 implicit places.
[2024-05-20 18:44:34] [INFO ] Redundant transitions in 475 ms returned []
[2024-05-20 18:44:34] [INFO ] Invariant cache hit.
[2024-05-20 18:44:37] [INFO ] Dead Transitions using invariants and state equation in 2835 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8207 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (OR p1 p2 (NOT p3) p4)), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 125 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 18:44:38] [INFO ] Invariant cache hit.
[2024-05-20 18:44:38] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:44:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:44:38] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2024-05-20 18:44:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:44:38] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:44:40] [INFO ] After 2021ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-20 18:44:41] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:44:42] [INFO ] After 1859ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-20 18:44:43] [INFO ] After 2873ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 707 ms.
[2024-05-20 18:44:44] [INFO ] After 6060ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 596 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 1843/1845 places, 6519/6521 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 88198 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88198 steps, saw 25553 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 18:44:48] [INFO ] Computed 42 invariants in 154 ms
[2024-05-20 18:44:49] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:44:49] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:44:49] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:44:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:44:49] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-20 18:44:51] [INFO ] After 2143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:44:51] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:44:53] [INFO ] After 1698ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 18:44:54] [INFO ] After 2739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 701 ms.
[2024-05-20 18:44:55] [INFO ] After 6048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 218 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 215 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 18:44:55] [INFO ] Invariant cache hit.
[2024-05-20 18:44:57] [INFO ] Implicit Places using invariants in 1887 ms returned []
[2024-05-20 18:44:57] [INFO ] Invariant cache hit.
[2024-05-20 18:44:58] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:45:10] [INFO ] Implicit Places using invariants and state equation in 13087 ms returned []
Implicit Place search using SMT with State Equation took 14980 ms to find 0 implicit places.
[2024-05-20 18:45:11] [INFO ] Redundant transitions in 491 ms returned []
[2024-05-20 18:45:11] [INFO ] Invariant cache hit.
[2024-05-20 18:45:13] [INFO ] Dead Transitions using invariants and state equation in 2653 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18351 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6264 edges and 1843 vertex of which 1676 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1674 places
Drop transitions removed 4709 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6341 transitions.
Graph (complete) has 420 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.0 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 51 transition count 60
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 120 place count 14 transition count 23
Iterating global reduction 2 with 37 rules applied. Total rules applied 157 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 13 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 10 ms. Remains 11 /1843 variables (removed 1832) and now considering 17/6519 (removed 6502) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 17 rows 11 cols
[2024-05-20 18:45:13] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:45:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:45:13] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:45:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:45:13] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:45:13] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 18:45:13] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) p4), (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4))))), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (OR p1 p2 (NOT p3) p4)), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND p1 p3 (NOT p4)) (AND p2 p3 (NOT p4)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (OR p1 p2 (NOT p3) p4))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p4)) (AND p2 (NOT p3) (NOT p4)))))), (G (OR p1 p2 (NOT p3) p4)), (G (NOT (AND (NOT p1) (NOT p2) p3 (NOT p4)))), (G (NOT (AND p1 (NOT p2) p3 (NOT p4))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) p4))))]
Knowledge based reduction with 24 factoid took 219 ms. Reduced automaton from 3 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4)), (AND (NOT p1) (NOT p2) p3 (NOT p4))]
Product exploration explored 100000 steps with 33222 reset in 1624 ms.
Product exploration explored 100000 steps with 33440 reset in 1616 ms.
Built C files in :
/tmp/ltsmin7012328178372683036
[2024-05-20 18:45:17] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:45:17] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7012328178372683036
Running compilation step : cd /tmp/ltsmin7012328178372683036;'/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/ltsmin7012328178372683036;'/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/ltsmin7012328178372683036;'/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 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 201 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:45:21] [INFO ] Computed 42 invariants in 141 ms
[2024-05-20 18:45:22] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2024-05-20 18:45:22] [INFO ] Invariant cache hit.
[2024-05-20 18:45:23] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:45:26] [INFO ] Implicit Places using invariants and state equation in 3867 ms returned []
Implicit Place search using SMT with State Equation took 5140 ms to find 0 implicit places.
[2024-05-20 18:45:26] [INFO ] Redundant transitions in 485 ms returned []
[2024-05-20 18:45:26] [INFO ] Invariant cache hit.
[2024-05-20 18:45:29] [INFO ] Dead Transitions using invariants and state equation in 2723 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8556 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Built C files in :
/tmp/ltsmin14689667987412296438
[2024-05-20 18:45:29] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:45:29] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14689667987412296438
Running compilation step : cd /tmp/ltsmin14689667987412296438;'/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/ltsmin14689667987412296438;'/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/ltsmin14689667987412296438;'/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 18:45:32] [INFO ] Flatten gal took : 119 ms
[2024-05-20 18:45:32] [INFO ] Flatten gal took : 105 ms
[2024-05-20 18:45:32] [INFO ] Time to serialize gal into /tmp/LTL10793327337739402686.gal : 18 ms
[2024-05-20 18:45:32] [INFO ] Time to serialize properties into /tmp/LTL7687587179056354787.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/LTL10793327337739402686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1190736626267389761.hoa' '-atoms' '/tmp/LTL7687587179056354787.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7687587179056354787.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1190736626267389761.hoa
Detected timeout of ITS tools.
[2024-05-20 18:45:47] [INFO ] Flatten gal took : 94 ms
[2024-05-20 18:45:48] [INFO ] Flatten gal took : 99 ms
[2024-05-20 18:45:48] [INFO ] Time to serialize gal into /tmp/LTL5090812075767808906.gal : 18 ms
[2024-05-20 18:45:48] [INFO ] Time to serialize properties into /tmp/LTL3358282074777250696.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/LTL5090812075767808906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3358282074777250696.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((("((Node24requestsent29<1)||(Node8GiveAnswer17<1))")||(("((Node19IsInserted>=1)&&(Node10requestsent19>=1))")U("(Node24requests...415
Formula 0 simplified : GF((!"((Node24requestsent29<1)||(Node8GiveAnswer17<1))" & (!"((Node19IsInserted>=1)&&(Node10requestsent19>=1))" R !"(Node24requestse...342
Detected timeout of ITS tools.
[2024-05-20 18:46:03] [INFO ] Flatten gal took : 107 ms
[2024-05-20 18:46:03] [INFO ] Applying decomposition
[2024-05-20 18:46:03] [INFO ] Flatten gal took : 114 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/graph9301472088458953834.txt' '-o' '/tmp/graph9301472088458953834.bin' '-w' '/tmp/graph9301472088458953834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9301472088458953834.bin' '-l' '-1' '-v' '-w' '/tmp/graph9301472088458953834.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:46:03] [INFO ] Decomposing Gal with order
[2024-05-20 18:46:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:46:04] [INFO ] Removed a total of 4814 redundant transitions.
[2024-05-20 18:46:04] [INFO ] Flatten gal took : 399 ms
[2024-05-20 18:46:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 200 ms.
[2024-05-20 18:46:04] [INFO ] Time to serialize gal into /tmp/LTL17357436688977405816.gal : 38 ms
[2024-05-20 18:46:04] [INFO ] Time to serialize properties into /tmp/LTL11361549216738369327.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/LTL17357436688977405816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11361549216738369327.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 : !((F(G((("((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))")||(("((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))")U(...467
Formula 0 simplified : GF((!"((u25.Node24requestsent29<1)||(u18.Node8GiveAnswer17<1))" & (!"((u20.Node19IsInserted>=1)&&(u11.Node10requestsent19>=1))" R !"...386
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5394584586412181420
[2024-05-20 18:46:19] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5394584586412181420
Running compilation step : cd /tmp/ltsmin5394584586412181420;'/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/ltsmin5394584586412181420;'/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/ltsmin5394584586412181420;'/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-040-LTLFireability-06 finished in 158916 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(p1)&&F(p2)) U (G(((X(p1)&&F(p2))||X(G(p1))))||(!p3&&((X(p1)&&F(p2))||X(G(p1))))))))))'
[2024-05-20 18:46:22] [INFO ] Flatten gal took : 179 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4288087295174121641
[2024-05-20 18:46:23] [INFO ] Too many transitions (9840) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:46:23] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4288087295174121641
Running compilation step : cd /tmp/ltsmin4288087295174121641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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 18:46:23] [INFO ] Applying decomposition
[2024-05-20 18:46:23] [INFO ] Flatten gal took : 212 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/graph15098090425394729313.txt' '-o' '/tmp/graph15098090425394729313.bin' '-w' '/tmp/graph15098090425394729313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15098090425394729313.bin' '-l' '-1' '-v' '-w' '/tmp/graph15098090425394729313.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:46:23] [INFO ] Decomposing Gal with order
[2024-05-20 18:46:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:46:24] [INFO ] Removed a total of 4813 redundant transitions.
[2024-05-20 18:46:24] [INFO ] Flatten gal took : 469 ms
[2024-05-20 18:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4684 labels/synchronizations in 296 ms.
[2024-05-20 18:46:24] [INFO ] Time to serialize gal into /tmp/LTLFireability4577252315440871908.gal : 45 ms
[2024-05-20 18:46:24] [INFO ] Time to serialize properties into /tmp/LTLFireability15372235151884182752.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/LTLFireability4577252315440871908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15372235151884182752.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !(((G(F("((i8.u19.Node37GiveAnswer4>=1)||(u159.Node3GiveAnswer8<1))")))U((X(("(i8.u19.Node37GiveAnswer4>=1)")U("(i27.u65.Node34GiveAns...200
Formula 0 simplified : FG!"((i8.u19.Node37GiveAnswer4>=1)||(u159.Node3GiveAnswer8<1))" R (X(!"(i8.u19.Node37GiveAnswer4>=1)" R !"(i27.u65.Node34GiveAnswer1...190
Compilation finished in 50422 ms.
Running link step : cd /tmp/ltsmin4288087295174121641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 179 ms.
Running LTSmin : cd /tmp/ltsmin4288087295174121641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (X(((LTLAPp1==true) U (LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4288087295174121641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true))) U (X(((LTLAPp1==true) U (LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4288087295174121641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((((LTLAPp5==true) U (LTLAPp6==true))||(LTLAPp4==true))&&(((LTLAPp5==true) U (LTLAPp6==true))||X((!(LTLAPp7==true) U ((LTLAPp8==true)||[](!(LTLAPp7==true)))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 19:12:25] [INFO ] Flatten gal took : 1184 ms
[2024-05-20 19:12:25] [INFO ] Time to serialize gal into /tmp/LTLFireability18063794383216993134.gal : 94 ms
[2024-05-20 19:12:25] [INFO ] Time to serialize properties into /tmp/LTLFireability6417930915062391033.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/LTLFireability18063794383216993134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6417930915062391033.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 3 LTL properties
Checking formula 0 : !(((G(F("((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))")))U((X(("(Node37GiveAnswer4>=1)")U("(Node34GiveAnswer16>=1)")))||(G("(Node13I...165
Formula 0 simplified : FG!"((Node37GiveAnswer4>=1)||(Node3GiveAnswer8<1))" R (X(!"(Node37GiveAnswer4>=1)" R !"(Node34GiveAnswer16>=1)") & F!"(Node13ID<1)")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin4288087295174121641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((((LTLAPp5==true) U (LTLAPp6==true))||(LTLAPp4==true))&&(((LTLAPp5==true) U (LTLAPp6==true))||X((!(LTLAPp7==true) U ((LTLAPp8==true)||[](!(LTLAPp7==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4288087295174121641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp9==true)||((X((LTLAPp10==true))&&<>((LTLAPp11==true))) U ([](((X((LTLAPp10==true))&&<>((LTLAPp11==true)))||X([]((LTLAPp10==true)))))||(!(LTLAPp12==true)&&((X((LTLAPp10==true))&&<>((LTLAPp11==true)))||X([]((LTLAPp10==true))))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6154036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16016516 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-040"
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-040, 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-171620521500078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 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 ;