About the Execution of 2023-gold for CANInsertWithFailure-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16020.088 | 3600000.00 | 12554049.00 | 4994.00 | FF?T?FFFF?F?FTFT | 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-171620521400067.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-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K 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 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 2.6M 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-020-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716224533975
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 17:02:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 17:02:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 17:02:15] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-05-20 17:02:15] [INFO ] Transformed 1044 places.
[2024-05-20 17:02:15] [INFO ] Transformed 2520 transitions.
[2024-05-20 17:02:15] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 113 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 17:02:16] [INFO ] Computed 22 invariants in 121 ms
[2024-05-20 17:02:16] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-20 17:02:16] [INFO ] Invariant cache hit.
[2024-05-20 17:02:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:02:20] [INFO ] Implicit Places using invariants and state equation in 3451 ms returned []
Implicit Place search using SMT with State Equation took 4093 ms to find 0 implicit places.
[2024-05-20 17:02:20] [INFO ] Invariant cache hit.
[2024-05-20 17:02:21] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5176 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 35 out of 1043 places after structural reductions.
[2024-05-20 17:02:21] [INFO ] Flatten gal took : 165 ms
[2024-05-20 17:02:21] [INFO ] Flatten gal took : 90 ms
[2024-05-20 17:02:21] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 34 out of 1043 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 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 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 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-20 17:02:22] [INFO ] Invariant cache hit.
[2024-05-20 17:02:22] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-20 17:02:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 17:02:23] [INFO ] After 861ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:4
[2024-05-20 17:02:23] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:02:24] [INFO ] After 437ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-20 17:02:24] [INFO ] After 1744ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-20 17:02:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-20 17:02:24] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:02:25] [INFO ] After 1152ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-20 17:02:27] [INFO ] After 1950ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2024-05-20 17:02:29] [INFO ] After 3278ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 882 ms.
[2024-05-20 17:02:30] [INFO ] After 5716ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 13 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1043 transition count 2386
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 909 transition count 2385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 908 transition count 2385
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 980 place count 553 transition count 2030
Drop transitions removed 321 transitions
Redundant transition composition rules discarded 321 transitions
Iterating global reduction 3 with 321 rules applied. Total rules applied 1301 place count 553 transition count 1709
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1304 place count 553 transition count 1706
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1307 place count 550 transition count 1706
Partial Free-agglomeration rule applied 471 times.
Drop transitions removed 471 transitions
Iterating global reduction 4 with 471 rules applied. Total rules applied 1778 place count 550 transition count 1706
Applied a total of 1778 rules in 311 ms. Remains 550 /1043 variables (removed 493) and now considering 1706/2520 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 550/1043 places, 1706/2520 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 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 4 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 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 322990 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322990 steps, saw 46962 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1706 rows 550 cols
[2024-05-20 17:02:33] [INFO ] Computed 22 invariants in 32 ms
[2024-05-20 17:02:34] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:02:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 17:02:34] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 17:02:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:02:34] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-20 17:02:34] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 17:02:34] [INFO ] State equation strengthened by 1581 read => feed constraints.
[2024-05-20 17:02:35] [INFO ] After 774ms SMT Verify possible using 1581 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-20 17:02:36] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 528 ms.
[2024-05-20 17:02:37] [INFO ] After 2885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 13 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1706/1706 transitions.
Applied a total of 0 rules in 45 ms. Remains 550 /550 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 550/550 places, 1706/1706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 1706/1706 transitions.
Applied a total of 0 rules in 36 ms. Remains 550 /550 variables (removed 0) and now considering 1706/1706 (removed 0) transitions.
[2024-05-20 17:02:37] [INFO ] Invariant cache hit.
[2024-05-20 17:02:37] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-20 17:02:37] [INFO ] Invariant cache hit.
[2024-05-20 17:02:38] [INFO ] State equation strengthened by 1581 read => feed constraints.
[2024-05-20 17:02:42] [INFO ] Implicit Places using invariants and state equation in 4416 ms returned []
Implicit Place search using SMT with State Equation took 4899 ms to find 0 implicit places.
[2024-05-20 17:02:42] [INFO ] Redundant transitions in 98 ms returned []
[2024-05-20 17:02:42] [INFO ] Invariant cache hit.
[2024-05-20 17:02:42] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5606 ms. Remains : 550/550 places, 1706/1706 transitions.
Graph (trivial) has 1511 edges and 550 vertex of which 431 / 550 are part of one of the 2 SCC in 4 ms
Free SCC test removed 429 places
Drop transitions removed 1104 transitions
Ensure Unique test removed 398 transitions
Reduce isomorphic transitions removed 1502 transitions.
Graph (complete) has 328 edges and 121 vertex of which 63 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 63 transition count 130
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 89 place count 32 transition count 83
Iterating global reduction 1 with 31 rules applied. Total rules applied 120 place count 32 transition count 83
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 136 place count 32 transition count 67
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 138 place count 31 transition count 66
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 140 place count 30 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 30 transition count 64
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 30 transition count 58
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 30 transition count 56
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 28 transition count 54
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 28 transition count 53
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 27 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 25 transition count 50
Applied a total of 158 rules in 22 ms. Remains 25 /550 variables (removed 525) and now considering 50/1706 (removed 1656) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-20 17:02:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 17:02:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:02:42] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 17:02:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:02:42] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 17:02:42] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-20 17:02:42] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 82 stabilizing places and 140 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 276 place count 905 transition count 2381
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 342 transitions
Redundant transition composition rules discarded 342 transitions
Iterating global reduction 2 with 342 rules applied. Total rules applied 1378 place count 525 transition count 1660
Applied a total of 1378 rules in 186 ms. Remains 525 /1043 variables (removed 518) and now considering 1660/2520 (removed 860) transitions.
// Phase 1: matrix 1660 rows 525 cols
[2024-05-20 17:02:43] [INFO ] Computed 22 invariants in 25 ms
[2024-05-20 17:02:43] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-20 17:02:43] [INFO ] Invariant cache hit.
[2024-05-20 17:02:43] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:02:45] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2024-05-20 17:02:45] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-20 17:02:45] [INFO ] Invariant cache hit.
[2024-05-20 17:02:46] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1660/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3100 ms. Remains : 525/1043 places, 1660/2520 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 150 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s78 s232)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-01 finished in 3307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 28 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 17:02:46] [INFO ] Computed 22 invariants in 45 ms
[2024-05-20 17:02:46] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-20 17:02:46] [INFO ] Invariant cache hit.
[2024-05-20 17:02:47] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:02:49] [INFO ] Implicit Places using invariants and state equation in 2773 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
[2024-05-20 17:02:49] [INFO ] Invariant cache hit.
[2024-05-20 17:02:50] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4171 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s252) (LEQ 3 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 211 reset in 494 ms.
Product exploration explored 100000 steps with 211 reset in 465 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, p0]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203190 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203190 steps, saw 51172 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 17:02:54] [INFO ] Invariant cache hit.
[2024-05-20 17:02:54] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2024-05-20 17:02:55] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-20 17:02:55] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:02:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-20 17:02:55] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-20 17:02:56] [INFO ] After 625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:02:56] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:02:57] [INFO ] After 548ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:02:57] [INFO ] After 678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-05-20 17:02:57] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 174 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 397751 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397751 steps, saw 56272 distinct states, run finished after 3003 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2024-05-20 17:03:00] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 17:03:00] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:03:00] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:03:00] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:03:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:03:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 17:03:01] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:01] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:03:01] [INFO ] After 178ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:01] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-20 17:03:01] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 26 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 28 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2024-05-20 17:03:01] [INFO ] Invariant cache hit.
[2024-05-20 17:03:02] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-20 17:03:02] [INFO ] Invariant cache hit.
[2024-05-20 17:03:02] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:03:06] [INFO ] Implicit Places using invariants and state equation in 4215 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
[2024-05-20 17:03:06] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-20 17:03:06] [INFO ] Invariant cache hit.
[2024-05-20 17:03:07] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5289 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
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 148 place count 14 transition count 23
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 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
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 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 8 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 17:03:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-20 17:03:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:03:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 17:03:07] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:03:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:03:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 17:03:07] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:07] [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 17:03:07] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, p0]
Stuttering acceptance computed with spot in 46 ms :[true, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 191 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 17:03:07] [INFO ] Computed 22 invariants in 23 ms
[2024-05-20 17:03:07] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-20 17:03:07] [INFO ] Invariant cache hit.
[2024-05-20 17:03:08] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:03:09] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2024-05-20 17:03:09] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:03:09] [INFO ] Invariant cache hit.
[2024-05-20 17:03:10] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2823 ms. Remains : 526/1043 places, 1661/2520 transitions.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, p0]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 381956 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381956 steps, saw 56542 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 17:03:13] [INFO ] Invariant cache hit.
[2024-05-20 17:03:13] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:03:13] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:03:13] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:03:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-20 17:03:14] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:03:14] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:03:14] [INFO ] After 192ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:14] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-20 17:03:14] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 76 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 388861 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388861 steps, saw 55038 distinct states, run finished after 3003 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2024-05-20 17:03:17] [INFO ] Computed 22 invariants in 23 ms
[2024-05-20 17:03:17] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:03:17] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:03:18] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:03:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:03:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:03:18] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:18] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 17:03:18] [INFO ] After 221ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:19] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-20 17:03:19] [INFO ] After 805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 23 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 24 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 17:03:19] [INFO ] Invariant cache hit.
[2024-05-20 17:03:19] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-20 17:03:19] [INFO ] Invariant cache hit.
[2024-05-20 17:03:19] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 17:03:23] [INFO ] Implicit Places using invariants and state equation in 4113 ms returned []
Implicit Place search using SMT with State Equation took 4486 ms to find 0 implicit places.
[2024-05-20 17:03:23] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:03:23] [INFO ] Invariant cache hit.
[2024-05-20 17:03:24] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5140 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
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 148 place count 15 transition count 22
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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 7 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 17:03:24] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 17:03:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:03:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 17:03:24] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:03:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 17:03:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-20 17:03:24] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:03:24] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-20 17:03:24] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, p0]
Stuttering acceptance computed with spot in 42 ms :[true, p0]
Stuttering acceptance computed with spot in 50 ms :[true, p0]
Product exploration explored 100000 steps with 952 reset in 428 ms.
Product exploration explored 100000 steps with 949 reset in 444 ms.
Built C files in :
/tmp/ltsmin10235782317749894796
[2024-05-20 17:03:25] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:03:25] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10235782317749894796
Running compilation step : cd /tmp/ltsmin10235782317749894796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2971 ms.
Running link step : cd /tmp/ltsmin10235782317749894796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10235782317749894796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9346054241103035937.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 17:03:40] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 17:03:40] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-20 17:03:40] [INFO ] Invariant cache hit.
[2024-05-20 17:03:41] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:03:42] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2024-05-20 17:03:42] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-20 17:03:42] [INFO ] Invariant cache hit.
[2024-05-20 17:03:43] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2708 ms. Remains : 526/526 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin1377698414860522942
[2024-05-20 17:03:43] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:03:43] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1377698414860522942
Running compilation step : cd /tmp/ltsmin1377698414860522942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2786 ms.
Running link step : cd /tmp/ltsmin1377698414860522942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1377698414860522942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10726633527646349609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 17:03:58] [INFO ] Flatten gal took : 60 ms
[2024-05-20 17:03:58] [INFO ] Flatten gal took : 72 ms
[2024-05-20 17:03:58] [INFO ] Time to serialize gal into /tmp/LTL7158532830005992892.gal : 32 ms
[2024-05-20 17:03:58] [INFO ] Time to serialize properties into /tmp/LTL10559938852149156107.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/LTL7158532830005992892.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8624787941915925054.hoa' '-atoms' '/tmp/LTL10559938852149156107.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/LTL10559938852149156107.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8624787941915925054.hoa
Detected timeout of ITS tools.
[2024-05-20 17:04:13] [INFO ] Flatten gal took : 43 ms
[2024-05-20 17:04:13] [INFO ] Flatten gal took : 47 ms
[2024-05-20 17:04:13] [INFO ] Time to serialize gal into /tmp/LTL8389588664790258919.gal : 6 ms
[2024-05-20 17:04:13] [INFO ] Time to serialize properties into /tmp/LTL15127068835249578754.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/LTL8389588664790258919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15127068835249578754.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("((Node17OKshare<3)&&(Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((Node17OKshare<3)&&(Node0DHTinfo2<3))"
Detected timeout of ITS tools.
[2024-05-20 17:04:28] [INFO ] Flatten gal took : 33 ms
[2024-05-20 17:04:28] [INFO ] Applying decomposition
[2024-05-20 17:04:28] [INFO ] Flatten gal took : 33 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/graph7073864714267922934.txt' '-o' '/tmp/graph7073864714267922934.bin' '-w' '/tmp/graph7073864714267922934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7073864714267922934.bin' '-l' '-1' '-v' '-w' '/tmp/graph7073864714267922934.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:04:28] [INFO ] Decomposing Gal with order
[2024-05-20 17:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:04:29] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-20 17:04:29] [INFO ] Flatten gal took : 246 ms
[2024-05-20 17:04:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 53 ms.
[2024-05-20 17:04:29] [INFO ] Time to serialize gal into /tmp/LTL2795622112021477495.gal : 16 ms
[2024-05-20 17:04:29] [INFO ] Time to serialize properties into /tmp/LTL16962679589193828148.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/LTL2795622112021477495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16962679589193828148.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((u19.Node17OKshare<3)&&(i1.u2.Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((u19.Node17OKshare<3)&&(i1.u2.Node0DHTinfo2<3))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15506196427038966595
[2024-05-20 17:04:44] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15506196427038966595
Running compilation step : cd /tmp/ltsmin15506196427038966595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2792 ms.
Running link step : cd /tmp/ltsmin15506196427038966595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15506196427038966595;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 133172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 26 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 17:04:59] [INFO ] Computed 22 invariants in 36 ms
[2024-05-20 17:04:59] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-20 17:04:59] [INFO ] Invariant cache hit.
[2024-05-20 17:05:00] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:05:02] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned []
Implicit Place search using SMT with State Equation took 3335 ms to find 0 implicit places.
[2024-05-20 17:05:02] [INFO ] Invariant cache hit.
[2024-05-20 17:05:03] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4227 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s312 s505)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 675 ms.
Product exploration explored 100000 steps with 33333 reset in 660 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-03 finished in 5921 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)||G(F(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 102 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 17:05:05] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 17:05:05] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-20 17:05:05] [INFO ] Invariant cache hit.
[2024-05-20 17:05:06] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 17:05:07] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2024-05-20 17:05:07] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-20 17:05:07] [INFO ] Invariant cache hit.
[2024-05-20 17:05:08] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2797 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s144 s175), p1:(GT 2 s517)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 964 reset in 483 ms.
Product exploration explored 100000 steps with 964 reset in 462 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 308675 steps, run timeout after 3005 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308675 steps, saw 42516 distinct states, run finished after 3008 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 17:05:12] [INFO ] Invariant cache hit.
[2024-05-20 17:05:12] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:05:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:13] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:05:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:05:13] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:13] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:13] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 17:05:14] [INFO ] After 287ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:14] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-20 17:05:14] [INFO ] After 1079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 68 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 358544 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358544 steps, saw 48151 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 17:05:17] [INFO ] Computed 22 invariants in 19 ms
[2024-05-20 17:05:17] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:05:17] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:18] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:05:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:05:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:18] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:18] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:05:18] [INFO ] After 250ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:18] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-05-20 17:05:19] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 28 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 23 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 17:05:19] [INFO ] Invariant cache hit.
[2024-05-20 17:05:19] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-20 17:05:19] [INFO ] Invariant cache hit.
[2024-05-20 17:05:19] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:05:23] [INFO ] Implicit Places using invariants and state equation in 4058 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
[2024-05-20 17:05:23] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:05:23] [INFO ] Invariant cache hit.
[2024-05-20 17:05:24] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5009 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
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 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 5 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2024-05-20 17:05:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 17:05:24] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:05:24] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:24] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 17:05:24] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 17:05:24] [INFO ] Computed 22 invariants in 13 ms
[2024-05-20 17:05:24] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-20 17:05:24] [INFO ] Invariant cache hit.
[2024-05-20 17:05:24] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 17:05:26] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2024-05-20 17:05:26] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-20 17:05:26] [INFO ] Invariant cache hit.
[2024-05-20 17:05:27] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2596 ms. Remains : 525/525 places, 1661/1661 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 375994 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375994 steps, saw 49535 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-20 17:05:30] [INFO ] Invariant cache hit.
[2024-05-20 17:05:30] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2024-05-20 17:05:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:30] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:05:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:05:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:31] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:31] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 17:05:31] [INFO ] After 297ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:31] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-20 17:05:31] [INFO ] After 1103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 73 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 362005 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 362005 steps, saw 48511 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 17:05:35] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 17:05:35] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:05:35] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:05:35] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:05:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:05:35] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:05:36] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:36] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:05:36] [INFO ] After 255ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:36] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-20 17:05:36] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 17:05:36] [INFO ] Invariant cache hit.
[2024-05-20 17:05:37] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-20 17:05:37] [INFO ] Invariant cache hit.
[2024-05-20 17:05:37] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:05:41] [INFO ] Implicit Places using invariants and state equation in 4156 ms returned []
Implicit Place search using SMT with State Equation took 4549 ms to find 0 implicit places.
[2024-05-20 17:05:41] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-20 17:05:41] [INFO ] Invariant cache hit.
[2024-05-20 17:05:41] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5168 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
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 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 5 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2024-05-20 17:05:41] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 17:05:41] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 17:05:41] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 17:05:41] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 17:05:41] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 968 reset in 440 ms.
Product exploration explored 100000 steps with 971 reset in 463 ms.
Built C files in :
/tmp/ltsmin5026418296803135215
[2024-05-20 17:05:43] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:05:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5026418296803135215
Running compilation step : cd /tmp/ltsmin5026418296803135215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2896 ms.
Running link step : cd /tmp/ltsmin5026418296803135215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5026418296803135215;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1074005154324508680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 30 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 17:05:58] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 17:05:58] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-20 17:05:58] [INFO ] Invariant cache hit.
[2024-05-20 17:05:59] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2024-05-20 17:06:00] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2024-05-20 17:06:00] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-20 17:06:00] [INFO ] Invariant cache hit.
[2024-05-20 17:06:01] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2601 ms. Remains : 525/525 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin10050624134642786780
[2024-05-20 17:06:01] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:06:01] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10050624134642786780
Running compilation step : cd /tmp/ltsmin10050624134642786780;'/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/ltsmin10050624134642786780;'/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/ltsmin10050624134642786780;'/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 17:06:04] [INFO ] Flatten gal took : 30 ms
[2024-05-20 17:06:04] [INFO ] Flatten gal took : 31 ms
[2024-05-20 17:06:04] [INFO ] Time to serialize gal into /tmp/LTL12609732988454615041.gal : 7 ms
[2024-05-20 17:06:04] [INFO ] Time to serialize properties into /tmp/LTL12074849917932023985.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12609732988454615041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15499202891641293357.hoa' '-atoms' '/tmp/LTL12074849917932023985.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...320
Loading property file /tmp/LTL12074849917932023985.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15499202891641293357.hoa
Detected timeout of ITS tools.
[2024-05-20 17:06:19] [INFO ] Flatten gal took : 46 ms
[2024-05-20 17:06:19] [INFO ] Flatten gal took : 30 ms
[2024-05-20 17:06:19] [INFO ] Time to serialize gal into /tmp/LTL5882134250607358303.gal : 22 ms
[2024-05-20 17:06:19] [INFO ] Time to serialize properties into /tmp/LTL2501268087358869647.ltl : 365 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/LTL5882134250607358303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2501268087358869647.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("(Node1requestsent2>Node2GiveAnswer12)"))||(G(F("(Node19GiveAnswer12<2)"))))))
Formula 0 simplified : G(F!"(Node1requestsent2>Node2GiveAnswer12)" & FG!"(Node19GiveAnswer12<2)")
Detected timeout of ITS tools.
[2024-05-20 17:06:34] [INFO ] Flatten gal took : 34 ms
[2024-05-20 17:06:34] [INFO ] Applying decomposition
[2024-05-20 17:06:34] [INFO ] Flatten gal took : 30 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/graph10533074450233152046.txt' '-o' '/tmp/graph10533074450233152046.bin' '-w' '/tmp/graph10533074450233152046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10533074450233152046.bin' '-l' '-1' '-v' '-w' '/tmp/graph10533074450233152046.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:06:34] [INFO ] Decomposing Gal with order
[2024-05-20 17:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:06:35] [INFO ] Removed a total of 1212 redundant transitions.
[2024-05-20 17:06:35] [INFO ] Flatten gal took : 99 ms
[2024-05-20 17:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 37 ms.
[2024-05-20 17:06:35] [INFO ] Time to serialize gal into /tmp/LTL1600769821128638313.gal : 29 ms
[2024-05-20 17:06:35] [INFO ] Time to serialize properties into /tmp/LTL5325778660895880506.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/LTL1600769821128638313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5325778660895880506.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("(gu21.Node1requestsent2>gu21.Node2GiveAnswer12)"))||(G(F("(gi0.gu13.Node19GiveAnswer12<2)"))))))
Formula 0 simplified : G(F!"(gu21.Node1requestsent2>gu21.Node2GiveAnswer12)" & FG!"(gi0.gu13.Node19GiveAnswer12<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17645376205877010036
[2024-05-20 17:06:50] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17645376205877010036
Running compilation step : cd /tmp/ltsmin17645376205877010036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2757 ms.
Running link step : cd /tmp/ltsmin17645376205877010036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17645376205877010036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-04 finished in 119973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G((p0||X(p1))))&&G(p2)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 24 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 17:07:05] [INFO ] Computed 22 invariants in 38 ms
[2024-05-20 17:07:05] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-20 17:07:05] [INFO ] Invariant cache hit.
[2024-05-20 17:07:06] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:07:08] [INFO ] Implicit Places using invariants and state equation in 3105 ms returned []
Implicit Place search using SMT with State Equation took 3483 ms to find 0 implicit places.
[2024-05-20 17:07:08] [INFO ] Invariant cache hit.
[2024-05-20 17:07:09] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4478 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s3), p0:(AND (LEQ s1003 s539) (LEQ 1 s3)), p1:(LEQ s1003 s539)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-05 finished in 4863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 907 transition count 2383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1032 place count 527 transition count 2004
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1373 place count 527 transition count 1663
Applied a total of 1373 rules in 102 ms. Remains 527 /1043 variables (removed 516) and now considering 1663/2520 (removed 857) transitions.
// Phase 1: matrix 1663 rows 527 cols
[2024-05-20 17:07:10] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 17:07:10] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-20 17:07:10] [INFO ] Invariant cache hit.
[2024-05-20 17:07:11] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:07:12] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-20 17:07:12] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-20 17:07:12] [INFO ] Invariant cache hit.
[2024-05-20 17:07:13] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 527/1043 places, 1663/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2852 ms. Remains : 527/1043 places, 1663/2520 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s66 s321), p1:(AND (LEQ 3 s419) (GT 3 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-08 finished in 3020 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)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 98 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:07:13] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 17:07:13] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-20 17:07:13] [INFO ] Invariant cache hit.
[2024-05-20 17:07:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:07:15] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2024-05-20 17:07:15] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:07:15] [INFO ] Invariant cache hit.
[2024-05-20 17:07:16] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2799 ms. Remains : 526/1043 places, 1662/2520 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s464 s326), p0:(GT 3 s345), p1:(AND (GT 2 s83) (GT 3 s345))], 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 977 reset in 514 ms.
Product exploration explored 100000 steps with 971 reset in 522 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (OR (AND p0 p2) p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 164 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 17:07:18] [INFO ] Invariant cache hit.
[2024-05-20 17:07:18] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:07:18] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:07:18] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 17:07:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:07:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:07:18] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-20 17:07:18] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:07:19] [INFO ] After 372ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-20 17:07:19] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 256 ms.
[2024-05-20 17:07:19] [INFO ] After 1642ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 65 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 338212 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338212 steps, saw 45259 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 17:07:23] [INFO ] Computed 22 invariants in 20 ms
[2024-05-20 17:07:23] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:07:23] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 17:07:23] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 17:07:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:07:23] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:07:24] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 17:07:24] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:07:24] [INFO ] After 397ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-20 17:07:24] [INFO ] After 793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 301 ms.
[2024-05-20 17:07:25] [INFO ] After 1780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 23 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2024-05-20 17:07:25] [INFO ] Invariant cache hit.
[2024-05-20 17:07:25] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-20 17:07:25] [INFO ] Invariant cache hit.
[2024-05-20 17:07:25] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:07:29] [INFO ] Implicit Places using invariants and state equation in 3992 ms returned []
Implicit Place search using SMT with State Equation took 4335 ms to find 0 implicit places.
[2024-05-20 17:07:29] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-20 17:07:29] [INFO ] Invariant cache hit.
[2024-05-20 17:07:30] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4899 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
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 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 4 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 17 rows 9 cols
[2024-05-20 17:07:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 17:07:30] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-20 17:07:30] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-20 17:07:30] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-20 17:07:30] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (OR (AND p0 p2) p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 278 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 25 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:07:30] [INFO ] Computed 22 invariants in 17 ms
[2024-05-20 17:07:30] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-20 17:07:30] [INFO ] Invariant cache hit.
[2024-05-20 17:07:31] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:07:32] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2024-05-20 17:07:32] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:07:32] [INFO ] Invariant cache hit.
[2024-05-20 17:07:33] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2719 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p2), (X p1), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 103 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 17:07:33] [INFO ] Invariant cache hit.
[2024-05-20 17:07:33] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:07:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:07:33] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:07:34] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:07:34] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:07:34] [INFO ] After 266ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:07:34] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-20 17:07:35] [INFO ] After 1218ms 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 4 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 66 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 340689 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340689 steps, saw 45534 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1661 rows 525 cols
[2024-05-20 17:07:38] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 17:07:38] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:07:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:07:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:07:38] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:07:38] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:07:39] [INFO ] After 308ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 17:07:39] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-20 17:07:39] [INFO ] After 1276ms 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 4 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 24 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2024-05-20 17:07:39] [INFO ] Invariant cache hit.
[2024-05-20 17:07:40] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-20 17:07:40] [INFO ] Invariant cache hit.
[2024-05-20 17:07:40] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2024-05-20 17:07:44] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 4547 ms to find 0 implicit places.
[2024-05-20 17:07:44] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-20 17:07:44] [INFO ] Invariant cache hit.
[2024-05-20 17:07:44] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5148 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
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 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 4 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 9 cols
[2024-05-20 17:07:44] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 17:07:44] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 17:07:44] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 17:07:44] [INFO ] After 13ms 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 17:07:44] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p2), (X p1), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 962 reset in 460 ms.
Product exploration explored 100000 steps with 963 reset in 516 ms.
Built C files in :
/tmp/ltsmin18237197046768757651
[2024-05-20 17:07:46] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:07:46] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18237197046768757651
Running compilation step : cd /tmp/ltsmin18237197046768757651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2859 ms.
Running link step : cd /tmp/ltsmin18237197046768757651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin18237197046768757651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8907094897749506735.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 21 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:08:01] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 17:08:01] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-20 17:08:01] [INFO ] Invariant cache hit.
[2024-05-20 17:08:02] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:08:03] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2024-05-20 17:08:03] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-20 17:08:03] [INFO ] Invariant cache hit.
[2024-05-20 17:08:04] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2776 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin3008398509098809468
[2024-05-20 17:08:04] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:08:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3008398509098809468
Running compilation step : cd /tmp/ltsmin3008398509098809468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2934 ms.
Running link step : cd /tmp/ltsmin3008398509098809468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3008398509098809468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2320911062122229310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 17:08:19] [INFO ] Flatten gal took : 71 ms
[2024-05-20 17:08:19] [INFO ] Flatten gal took : 53 ms
[2024-05-20 17:08:19] [INFO ] Time to serialize gal into /tmp/LTL5112532724299607958.gal : 6 ms
[2024-05-20 17:08:19] [INFO ] Time to serialize properties into /tmp/LTL10692503322871109099.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5112532724299607958.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4666897449692762338.hoa' '-atoms' '/tmp/LTL10692503322871109099.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/LTL10692503322871109099.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4666897449692762338.hoa
Detected timeout of ITS tools.
[2024-05-20 17:08:34] [INFO ] Flatten gal took : 29 ms
[2024-05-20 17:08:34] [INFO ] Flatten gal took : 28 ms
[2024-05-20 17:08:34] [INFO ] Time to serialize gal into /tmp/LTL6693857653467711905.gal : 6 ms
[2024-05-20 17:08:34] [INFO ] Time to serialize properties into /tmp/LTL7246889151070450994.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/LTL6693857653467711905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7246889151070450994.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 : !(((("(Node10GiveAnswer19<3)")U((G("(Node10GiveAnswer19<3)"))||("((Node13ResZone<2)&&(Node10GiveAnswer19<3))")))U((G(("(Node10GiveAnsw...415
Formula 0 simplified : (!"(Node10GiveAnswer19<3)" M !"((Node13ResZone<2)&&(Node10GiveAnswer19<3))") R (F(!"((Node13ResZone<2)&&(Node10GiveAnswer19<3))" & !...310
Detected timeout of ITS tools.
[2024-05-20 17:08:49] [INFO ] Flatten gal took : 28 ms
[2024-05-20 17:08:49] [INFO ] Applying decomposition
[2024-05-20 17:08:49] [INFO ] Flatten gal took : 28 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/graph14982982959577035413.txt' '-o' '/tmp/graph14982982959577035413.bin' '-w' '/tmp/graph14982982959577035413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14982982959577035413.bin' '-l' '-1' '-v' '-w' '/tmp/graph14982982959577035413.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:08:49] [INFO ] Decomposing Gal with order
[2024-05-20 17:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:08:49] [INFO ] Removed a total of 1207 redundant transitions.
[2024-05-20 17:08:49] [INFO ] Flatten gal took : 103 ms
[2024-05-20 17:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 764 labels/synchronizations in 38 ms.
[2024-05-20 17:08:49] [INFO ] Time to serialize gal into /tmp/LTL14980367373852888413.gal : 8 ms
[2024-05-20 17:08:49] [INFO ] Time to serialize properties into /tmp/LTL2145832552050627059.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/LTL14980367373852888413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2145832552050627059.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 : !(((("(gi0.gu21.Node10GiveAnswer19<3)")U((G("(gi0.gu21.Node10GiveAnswer19<3)"))||("((gi0.gu14.Node13ResZone<2)&&(gi0.gu21.Node10GiveAn...533
Formula 0 simplified : (!"(gi0.gu21.Node10GiveAnswer19<3)" M !"((gi0.gu14.Node13ResZone<2)&&(gi0.gu21.Node10GiveAnswer19<3))") R (F(!"((gi0.gu14.Node13ResZ...401
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14064263204076933420
[2024-05-20 17:09:05] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14064263204076933420
Running compilation step : cd /tmp/ltsmin14064263204076933420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2745 ms.
Running link step : cd /tmp/ltsmin14064263204076933420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14064263204076933420;'/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 ([]((LTLAPp0==true))||(LTLAPp1==true))) U ([](((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))||(X([]((LTLAPp2==true)))&&((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-09 finished in 126797 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))&&G((p1||X((G(p2) U (p1&&G(p2))))))))'
Support contains 7 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 26 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 17:09:20] [INFO ] Computed 22 invariants in 39 ms
[2024-05-20 17:09:20] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-20 17:09:20] [INFO ] Invariant cache hit.
[2024-05-20 17:09:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:09:23] [INFO ] Implicit Places using invariants and state equation in 3240 ms returned []
Implicit Place search using SMT with State Equation took 3594 ms to find 0 implicit places.
[2024-05-20 17:09:23] [INFO ] Invariant cache hit.
[2024-05-20 17:09:24] [INFO ] Dead Transitions using invariants and state equation in 952 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4577 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 1 s502) (LEQ s337 s849)), p1:(LEQ s88 s303), p2:(GT s429 s771)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5089 steps with 11 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-10 finished in 4821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((G(F(p1)) U p2))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 24 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2024-05-20 17:09:25] [INFO ] Invariant cache hit.
[2024-05-20 17:09:25] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-20 17:09:25] [INFO ] Invariant cache hit.
[2024-05-20 17:09:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:09:28] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 3010 ms to find 0 implicit places.
[2024-05-20 17:09:28] [INFO ] Invariant cache hit.
[2024-05-20 17:09:28] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3960 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s444), p0:(GT 3 s857), p1:(GT 1 s33)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33295 reset in 664 ms.
Product exploration explored 100000 steps with 33311 reset in 705 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 513 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 17:09:31] [INFO ] Invariant cache hit.
[2024-05-20 17:09:32] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-20 17:09:32] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:09:32] [INFO ] After 789ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2024-05-20 17:09:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:09:33] [INFO ] After 140ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:09:33] [INFO ] After 1234ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:09:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-20 17:09:33] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2024-05-20 17:09:34] [INFO ] After 883ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-20 17:09:35] [INFO ] After 816ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-20 17:09:35] [INFO ] After 1270ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 290 ms.
[2024-05-20 17:09:35] [INFO ] After 2723ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1377 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1379 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 4 with 420 rules applied. Total rules applied 1799 place count 524 transition count 1660
Applied a total of 1799 rules in 138 ms. Remains 524 /1043 variables (removed 519) and now considering 1660/2520 (removed 860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 524/1043 places, 1660/2520 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 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 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 346057 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346057 steps, saw 45529 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 17:09:39] [INFO ] Computed 22 invariants in 11 ms
[2024-05-20 17:09:39] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:09:39] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:09:39] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:09:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:09:39] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:09:40] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:09:40] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:09:40] [INFO ] After 326ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 17:09:41] [INFO ] After 667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-20 17:09:41] [INFO ] After 1482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 23 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 17:09:41] [INFO ] Invariant cache hit.
[2024-05-20 17:09:41] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-20 17:09:41] [INFO ] Invariant cache hit.
[2024-05-20 17:09:42] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:09:45] [INFO ] Implicit Places using invariants and state equation in 4226 ms returned []
Implicit Place search using SMT with State Equation took 4591 ms to find 0 implicit places.
[2024-05-20 17:09:45] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-20 17:09:45] [INFO ] Invariant cache hit.
[2024-05-20 17:09:46] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5203 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1532 edges and 524 vertex of which 438 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 215 edges and 88 vertex of which 28 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 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 41 rules applied. Total rules applied 43 place count 28 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 27 transition count 33
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 10 transition count 16
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 10 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 10 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 10 transition count 13
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 83 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 8 transition count 11
Applied a total of 84 rules in 4 ms. Remains 8 /524 variables (removed 516) and now considering 11/1660 (removed 1649) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 17:09:46] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 17:09:46] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:09:46] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:09:46] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 17:09:46] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 21 factoid took 1075 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 475 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 99 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:09:48] [INFO ] Computed 22 invariants in 19 ms
[2024-05-20 17:09:48] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-20 17:09:48] [INFO ] Invariant cache hit.
[2024-05-20 17:09:49] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:09:50] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
[2024-05-20 17:09:50] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-20 17:09:50] [INFO ] Invariant cache hit.
[2024-05-20 17:09:51] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2795 ms. Remains : 526/1043 places, 1662/2520 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 21 factoid took 703 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 17:09:52] [INFO ] Invariant cache hit.
[2024-05-20 17:09:52] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:09:52] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:09:53] [INFO ] After 404ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2024-05-20 17:09:53] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:09:53] [INFO ] After 132ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:09:53] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:09:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:09:53] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:09:54] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-20 17:09:54] [INFO ] After 384ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-20 17:09:54] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 194 ms.
[2024-05-20 17:09:55] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 424 place count 524 transition count 1660
Applied a total of 424 rules in 61 ms. Remains 524 /526 variables (removed 2) and now considering 1660/1662 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 524/526 places, 1660/1662 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 340808 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340808 steps, saw 44953 distinct states, run finished after 3005 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 17:09:58] [INFO ] Computed 22 invariants in 15 ms
[2024-05-20 17:09:58] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-20 17:09:58] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:09:58] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:09:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:09:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 17:09:59] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:09:59] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:09:59] [INFO ] After 333ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 17:10:00] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-20 17:10:00] [INFO ] After 1477ms 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 2 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 17:10:00] [INFO ] Invariant cache hit.
[2024-05-20 17:10:00] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-20 17:10:00] [INFO ] Invariant cache hit.
[2024-05-20 17:10:01] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:10:04] [INFO ] Implicit Places using invariants and state equation in 4090 ms returned []
Implicit Place search using SMT with State Equation took 4440 ms to find 0 implicit places.
[2024-05-20 17:10:04] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-20 17:10:04] [INFO ] Invariant cache hit.
[2024-05-20 17:10:05] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5040 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1532 edges and 524 vertex of which 438 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 215 edges and 88 vertex of which 28 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 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 41 rules applied. Total rules applied 43 place count 28 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 27 transition count 33
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 10 transition count 16
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 10 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 10 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 10 transition count 13
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 83 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 8 transition count 11
Applied a total of 84 rules in 4 ms. Remains 8 /524 variables (removed 516) and now considering 11/1660 (removed 1649) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 17:10:05] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 17:10:05] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:10:05] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:10:05] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 17:10:05] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 24 factoid took 1324 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 415 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 396 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 514 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Product exploration explored 100000 steps with 963 reset in 443 ms.
Product exploration explored 100000 steps with 965 reset in 457 ms.
Built C files in :
/tmp/ltsmin1515082606147719971
[2024-05-20 17:10:09] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:10:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1515082606147719971
Running compilation step : cd /tmp/ltsmin1515082606147719971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2844 ms.
Running link step : cd /tmp/ltsmin1515082606147719971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1515082606147719971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18397004489298428047.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 24 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:10:24] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 17:10:24] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-20 17:10:24] [INFO ] Invariant cache hit.
[2024-05-20 17:10:24] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:10:26] [INFO ] Implicit Places using invariants and state equation in 2123 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2024-05-20 17:10:26] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-20 17:10:26] [INFO ] Invariant cache hit.
[2024-05-20 17:10:27] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2949 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin11995145456365748843
[2024-05-20 17:10:27] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:10:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11995145456365748843
Running compilation step : cd /tmp/ltsmin11995145456365748843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2931 ms.
Running link step : cd /tmp/ltsmin11995145456365748843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11995145456365748843;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14559146538783220303.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 17:10:42] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:10:42] [INFO ] Flatten gal took : 33 ms
[2024-05-20 17:10:42] [INFO ] Time to serialize gal into /tmp/LTL6234845390239619809.gal : 6 ms
[2024-05-20 17:10:42] [INFO ] Time to serialize properties into /tmp/LTL46643084512862105.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6234845390239619809.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14339547781078047857.hoa' '-atoms' '/tmp/LTL46643084512862105.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL46643084512862105.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14339547781078047857.hoa
Detected timeout of ITS tools.
[2024-05-20 17:10:57] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:10:57] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:10:57] [INFO ] Time to serialize gal into /tmp/LTL18402186218020857861.gal : 5 ms
[2024-05-20 17:10:57] [INFO ] Time to serialize properties into /tmp/LTL5589782590874787784.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/LTL18402186218020857861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5589782590874787784.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G("(Node15requestsent2<3)")))||(G((G(F("(Node2ID<1)")))U("(Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(Node15requestsent2<3)" & F(FG!"(Node2ID<1)" R !"(Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
[2024-05-20 17:11:12] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:11:12] [INFO ] Applying decomposition
[2024-05-20 17:11:12] [INFO ] Flatten gal took : 27 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/graph6777825918585730998.txt' '-o' '/tmp/graph6777825918585730998.bin' '-w' '/tmp/graph6777825918585730998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6777825918585730998.bin' '-l' '-1' '-v' '-w' '/tmp/graph6777825918585730998.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:11:12] [INFO ] Decomposing Gal with order
[2024-05-20 17:11:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:11:12] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-20 17:11:12] [INFO ] Flatten gal took : 86 ms
[2024-05-20 17:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 20 ms.
[2024-05-20 17:11:12] [INFO ] Time to serialize gal into /tmp/LTL16726314111134932411.gal : 8 ms
[2024-05-20 17:11:12] [INFO ] Time to serialize properties into /tmp/LTL14277878824184497547.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/LTL16726314111134932411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14277878824184497547.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 : !(((X(G("(u17.Node15requestsent2<3)")))||(G((G(F("(i2.u3.Node2ID<1)")))U("(u7.Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(u17.Node15requestsent2<3)" & F(FG!"(i2.u3.Node2ID<1)" R !"(u7.Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8046997722477125716
[2024-05-20 17:11:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8046997722477125716
Running compilation step : cd /tmp/ltsmin8046997722477125716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2792 ms.
Running link step : cd /tmp/ltsmin8046997722477125716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8046997722477125716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true)))||[](([](<>((LTLAPp1==true))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 137893 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(F(!p0))||(F(!p0)&&X(p1))))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 28 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2024-05-20 17:11:42] [INFO ] Computed 22 invariants in 34 ms
[2024-05-20 17:11:43] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-20 17:11:43] [INFO ] Invariant cache hit.
[2024-05-20 17:11:43] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 17:11:46] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 3558 ms to find 0 implicit places.
[2024-05-20 17:11:46] [INFO ] Invariant cache hit.
[2024-05-20 17:11:47] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4473 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ s323 s478) (LEQ s734 s1018)), p1:(GT 2 s588)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 467 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-12 finished in 4681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-02
Stuttering acceptance computed with spot in 81 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 134 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 17:11:47] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 17:11:48] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-20 17:11:48] [INFO ] Invariant cache hit.
[2024-05-20 17:11:48] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:11:49] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
[2024-05-20 17:11:49] [INFO ] Invariant cache hit.
[2024-05-20 17:11:50] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2782 ms. Remains : 526/1043 places, 1661/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s111) (LEQ 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 942 reset in 408 ms.
Product exploration explored 100000 steps with 937 reset in 437 ms.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, p0]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 387307 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 387307 steps, saw 57266 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 17:11:54] [INFO ] Invariant cache hit.
[2024-05-20 17:11:54] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:11:54] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:11:55] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:11:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:11:55] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:11:55] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:11:55] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:11:55] [INFO ] After 215ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:11:55] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-20 17:11:55] [INFO ] After 774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 65 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384683 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384683 steps, saw 54493 distinct states, run finished after 3003 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2024-05-20 17:11:58] [INFO ] Computed 22 invariants in 17 ms
[2024-05-20 17:11:59] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:11:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 17:11:59] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:11:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:11:59] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:11:59] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:11:59] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 17:12:00] [INFO ] After 225ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:00] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-20 17:12:00] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 25 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 17:12:00] [INFO ] Invariant cache hit.
[2024-05-20 17:12:00] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-20 17:12:00] [INFO ] Invariant cache hit.
[2024-05-20 17:12:00] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 17:12:04] [INFO ] Implicit Places using invariants and state equation in 4215 ms returned []
Implicit Place search using SMT with State Equation took 4575 ms to find 0 implicit places.
[2024-05-20 17:12:04] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:12:04] [INFO ] Invariant cache hit.
[2024-05-20 17:12:05] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5170 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
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 148 place count 15 transition count 22
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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 5 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 17:12:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-20 17:12:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 17:12:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 17:12:05] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:12:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 17:12:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 17:12:05] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:05] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 17:12:05] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, p0]
Stuttering acceptance computed with spot in 61 ms :[true, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 27 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 17:12:05] [INFO ] Computed 22 invariants in 21 ms
[2024-05-20 17:12:05] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-20 17:12:05] [INFO ] Invariant cache hit.
[2024-05-20 17:12:06] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:12:07] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
[2024-05-20 17:12:07] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-20 17:12:07] [INFO ] Invariant cache hit.
[2024-05-20 17:12:08] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2706 ms. Remains : 526/526 places, 1661/1661 transitions.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, p0]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 376728 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376728 steps, saw 55733 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 17:12:11] [INFO ] Invariant cache hit.
[2024-05-20 17:12:11] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:12:11] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:12:12] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:12:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-05-20 17:12:12] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:12:12] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:12] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:12:12] [INFO ] After 197ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:12] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-20 17:12:12] [INFO ] After 781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 66 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386946 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386946 steps, saw 54796 distinct states, run finished after 3002 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2024-05-20 17:12:15] [INFO ] Computed 22 invariants in 19 ms
[2024-05-20 17:12:16] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:12:16] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2024-05-20 17:12:16] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:12:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:12:16] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:12:16] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:16] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 17:12:16] [INFO ] After 212ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:17] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-20 17:12:17] [INFO ] After 761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 23 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2024-05-20 17:12:17] [INFO ] Invariant cache hit.
[2024-05-20 17:12:17] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-20 17:12:17] [INFO ] Invariant cache hit.
[2024-05-20 17:12:17] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2024-05-20 17:12:21] [INFO ] Implicit Places using invariants and state equation in 4436 ms returned []
Implicit Place search using SMT with State Equation took 4832 ms to find 0 implicit places.
[2024-05-20 17:12:22] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 17:12:22] [INFO ] Invariant cache hit.
[2024-05-20 17:12:22] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5469 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
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 148 place count 15 transition count 22
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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 3 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-20 17:12:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-20 17:12:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 17:12:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 17:12:22] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 17:12:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-20 17:12:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-20 17:12:22] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 17:12:22] [INFO ] After 8ms 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 17:12:22] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, p0]
Stuttering acceptance computed with spot in 39 ms :[true, p0]
Stuttering acceptance computed with spot in 41 ms :[true, p0]
Product exploration explored 100000 steps with 943 reset in 410 ms.
Product exploration explored 100000 steps with 938 reset in 436 ms.
Built C files in :
/tmp/ltsmin5503964565650058200
[2024-05-20 17:12:23] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:12:23] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5503964565650058200
Running compilation step : cd /tmp/ltsmin5503964565650058200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2904 ms.
Running link step : cd /tmp/ltsmin5503964565650058200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5503964565650058200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6799372218335489460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 30 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2024-05-20 17:12:38] [INFO ] Computed 22 invariants in 17 ms
[2024-05-20 17:12:39] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-20 17:12:39] [INFO ] Invariant cache hit.
[2024-05-20 17:12:39] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:12:41] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2024-05-20 17:12:41] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-20 17:12:41] [INFO ] Invariant cache hit.
[2024-05-20 17:12:41] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2986 ms. Remains : 526/526 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin17055538779210953925
[2024-05-20 17:12:41] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:12:41] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17055538779210953925
Running compilation step : cd /tmp/ltsmin17055538779210953925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2922 ms.
Running link step : cd /tmp/ltsmin17055538779210953925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17055538779210953925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1907329593286244137.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 17:12:56] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:12:56] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:12:56] [INFO ] Time to serialize gal into /tmp/LTL11278218476428007241.gal : 5 ms
[2024-05-20 17:12:56] [INFO ] Time to serialize properties into /tmp/LTL14615162248078596042.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/LTL11278218476428007241.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2355893310622354039.hoa' '-atoms' '/tmp/LTL14615162248078596042.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14615162248078596042.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2355893310622354039.hoa
Detected timeout of ITS tools.
[2024-05-20 17:13:11] [INFO ] Flatten gal took : 26 ms
[2024-05-20 17:13:12] [INFO ] Flatten gal took : 28 ms
[2024-05-20 17:13:12] [INFO ] Time to serialize gal into /tmp/LTL7937780162709649774.gal : 5 ms
[2024-05-20 17:13:12] [INFO ] Time to serialize properties into /tmp/LTL5991644878898160187.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/LTL7937780162709649774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5991644878898160187.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 : !((X(G("((Node17OKshare<3)&&(Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((Node17OKshare<3)&&(Node0DHTinfo2<3))"
Detected timeout of ITS tools.
[2024-05-20 17:13:27] [INFO ] Flatten gal took : 37 ms
[2024-05-20 17:13:27] [INFO ] Applying decomposition
[2024-05-20 17:13:27] [INFO ] Flatten gal took : 27 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/graph3618638002292935632.txt' '-o' '/tmp/graph3618638002292935632.bin' '-w' '/tmp/graph3618638002292935632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3618638002292935632.bin' '-l' '-1' '-v' '-w' '/tmp/graph3618638002292935632.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:13:27] [INFO ] Decomposing Gal with order
[2024-05-20 17:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:13:27] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-20 17:13:27] [INFO ] Flatten gal took : 78 ms
[2024-05-20 17:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 25 ms.
[2024-05-20 17:13:27] [INFO ] Time to serialize gal into /tmp/LTL9269060173487816168.gal : 9 ms
[2024-05-20 17:13:27] [INFO ] Time to serialize properties into /tmp/LTL12338170834849717525.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/LTL9269060173487816168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12338170834849717525.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("((u19.Node17OKshare<3)&&(i1.u2.Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((u19.Node17OKshare<3)&&(i1.u2.Node0DHTinfo2<3))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11259688464206301606
[2024-05-20 17:13:42] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11259688464206301606
Running compilation step : cd /tmp/ltsmin11259688464206301606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2711 ms.
Running link step : cd /tmp/ltsmin11259688464206301606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11259688464206301606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 130005 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)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((G(F(p1)) U p2))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-11
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 83 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:13:58] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 17:13:58] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-20 17:13:58] [INFO ] Invariant cache hit.
[2024-05-20 17:13:58] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:14:00] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
[2024-05-20 17:14:00] [INFO ] Invariant cache hit.
[2024-05-20 17:14:00] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2738 ms. Remains : 526/1043 places, 1662/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s210), p0:(GT 3 s428), p1:(GT 1 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33444 reset in 627 ms.
Product exploration explored 100000 steps with 33184 reset in 621 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 527 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 463 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 17:14:03] [INFO ] Invariant cache hit.
[2024-05-20 17:14:03] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-20 17:14:03] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:14:04] [INFO ] After 428ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2024-05-20 17:14:04] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:14:04] [INFO ] After 135ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:14:04] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:14:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-20 17:14:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:14:04] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-20 17:14:05] [INFO ] After 345ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-20 17:14:05] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-20 17:14:05] [INFO ] After 1516ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 424 place count 524 transition count 1660
Applied a total of 424 rules in 66 ms. Remains 524 /526 variables (removed 2) and now considering 1660/1662 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 524/526 places, 1660/1662 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 342119 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342119 steps, saw 45109 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 17:14:09] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 17:14:09] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:14:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 17:14:09] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:14:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:14:09] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 17:14:10] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:14:10] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:14:10] [INFO ] After 329ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 17:14:10] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 208 ms.
[2024-05-20 17:14:11] [INFO ] After 1477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 25 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 27 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 17:14:11] [INFO ] Invariant cache hit.
[2024-05-20 17:14:11] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-20 17:14:11] [INFO ] Invariant cache hit.
[2024-05-20 17:14:11] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:14:16] [INFO ] Implicit Places using invariants and state equation in 5039 ms returned []
Implicit Place search using SMT with State Equation took 5410 ms to find 0 implicit places.
[2024-05-20 17:14:16] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-20 17:14:16] [INFO ] Invariant cache hit.
[2024-05-20 17:14:17] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6003 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1532 edges and 524 vertex of which 438 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 215 edges and 88 vertex of which 28 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 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 41 rules applied. Total rules applied 43 place count 28 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 27 transition count 33
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 10 transition count 16
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 10 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 10 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 10 transition count 13
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 83 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 8 transition count 11
Applied a total of 84 rules in 5 ms. Remains 8 /524 variables (removed 516) and now considering 11/1660 (removed 1649) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 17:14:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 17:14:17] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:14:17] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:14:17] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 17:14:17] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) p0))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 21 factoid took 1091 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 453 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 24 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:14:19] [INFO ] Computed 22 invariants in 18 ms
[2024-05-20 17:14:19] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-20 17:14:19] [INFO ] Invariant cache hit.
[2024-05-20 17:14:19] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:14:21] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2024-05-20 17:14:21] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-20 17:14:21] [INFO ] Invariant cache hit.
[2024-05-20 17:14:21] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2715 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 21 factoid took 981 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-20 17:14:23] [INFO ] Invariant cache hit.
[2024-05-20 17:14:23] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-05-20 17:14:23] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-20 17:14:24] [INFO ] After 435ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2024-05-20 17:14:24] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:14:24] [INFO ] After 140ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:14:24] [INFO ] After 773ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-20 17:14:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:14:24] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 17:14:25] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-20 17:14:25] [INFO ] After 386ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2024-05-20 17:14:25] [INFO ] After 684ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 187 ms.
[2024-05-20 17:14:26] [INFO ] After 1516ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 424 place count 524 transition count 1660
Applied a total of 424 rules in 67 ms. Remains 524 /526 variables (removed 2) and now considering 1660/1662 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 524/526 places, 1660/1662 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 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 4 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 4 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 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 293558 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293558 steps, saw 39797 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1660 rows 524 cols
[2024-05-20 17:14:29] [INFO ] Computed 22 invariants in 10 ms
[2024-05-20 17:14:29] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:14:29] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:14:30] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:14:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-20 17:14:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 17:14:30] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:14:30] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:14:30] [INFO ] After 344ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 17:14:31] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 202 ms.
[2024-05-20 17:14:31] [INFO ] After 1503ms 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 1 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 23 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 22 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-20 17:14:31] [INFO ] Invariant cache hit.
[2024-05-20 17:14:31] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-20 17:14:31] [INFO ] Invariant cache hit.
[2024-05-20 17:14:32] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2024-05-20 17:14:36] [INFO ] Implicit Places using invariants and state equation in 4503 ms returned []
Implicit Place search using SMT with State Equation took 4866 ms to find 0 implicit places.
[2024-05-20 17:14:36] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-20 17:14:36] [INFO ] Invariant cache hit.
[2024-05-20 17:14:36] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5451 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1532 edges and 524 vertex of which 438 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 215 edges and 88 vertex of which 28 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 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 41 rules applied. Total rules applied 43 place count 28 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 27 transition count 33
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 10 transition count 16
Iterating global reduction 2 with 17 rules applied. Total rules applied 78 place count 10 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 10 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 10 transition count 13
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 83 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 8 transition count 11
Applied a total of 84 rules in 4 ms. Remains 8 /524 variables (removed 516) and now considering 11/1660 (removed 1649) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 8 cols
[2024-05-20 17:14:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 17:14:37] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 17:14:37] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 17:14:37] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-20 17:14:37] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 24 factoid took 1268 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 419 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Stuttering acceptance computed with spot in 445 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 (NOT p2)), false]
Product exploration explored 100000 steps with 966 reset in 463 ms.
Product exploration explored 100000 steps with 965 reset in 485 ms.
Built C files in :
/tmp/ltsmin10032548595854637727
[2024-05-20 17:14:40] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:14:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10032548595854637727
Running compilation step : cd /tmp/ltsmin10032548595854637727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2792 ms.
Running link step : cd /tmp/ltsmin10032548595854637727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10032548595854637727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1140608558046777610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 25 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2024-05-20 17:14:55] [INFO ] Computed 22 invariants in 16 ms
[2024-05-20 17:14:55] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-20 17:14:55] [INFO ] Invariant cache hit.
[2024-05-20 17:14:56] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2024-05-20 17:14:57] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
[2024-05-20 17:14:57] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-20 17:14:57] [INFO ] Invariant cache hit.
[2024-05-20 17:14:58] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2822 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin15771399544493069344
[2024-05-20 17:14:58] [INFO ] Too many transitions (1662) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:14:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15771399544493069344
Running compilation step : cd /tmp/ltsmin15771399544493069344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2954 ms.
Running link step : cd /tmp/ltsmin15771399544493069344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15771399544493069344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4308574546744780230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 17:15:13] [INFO ] Flatten gal took : 26 ms
[2024-05-20 17:15:13] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:15:13] [INFO ] Time to serialize gal into /tmp/LTL13307693861949051719.gal : 8 ms
[2024-05-20 17:15:13] [INFO ] Time to serialize properties into /tmp/LTL2890031917959791915.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/LTL13307693861949051719.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10440679519732302969.hoa' '-atoms' '/tmp/LTL2890031917959791915.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2890031917959791915.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10440679519732302969.hoa
Detected timeout of ITS tools.
[2024-05-20 17:15:28] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:15:28] [INFO ] Flatten gal took : 27 ms
[2024-05-20 17:15:28] [INFO ] Time to serialize gal into /tmp/LTL11267293288299153854.gal : 5 ms
[2024-05-20 17:15:28] [INFO ] Time to serialize properties into /tmp/LTL1684588547978018466.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/LTL11267293288299153854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1684588547978018466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G("(Node15requestsent2<3)")))||(G((G(F("(Node2ID<1)")))U("(Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(Node15requestsent2<3)" & F(FG!"(Node2ID<1)" R !"(Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
[2024-05-20 17:15:43] [INFO ] Flatten gal took : 26 ms
[2024-05-20 17:15:43] [INFO ] Applying decomposition
[2024-05-20 17:15:43] [INFO ] Flatten gal took : 27 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/graph4106143637592766848.txt' '-o' '/tmp/graph4106143637592766848.bin' '-w' '/tmp/graph4106143637592766848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4106143637592766848.bin' '-l' '-1' '-v' '-w' '/tmp/graph4106143637592766848.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:15:43] [INFO ] Decomposing Gal with order
[2024-05-20 17:15:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:15:43] [INFO ] Removed a total of 1197 redundant transitions.
[2024-05-20 17:15:43] [INFO ] Flatten gal took : 74 ms
[2024-05-20 17:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 19 ms.
[2024-05-20 17:15:43] [INFO ] Time to serialize gal into /tmp/LTL15155811208422304158.gal : 7 ms
[2024-05-20 17:15:43] [INFO ] Time to serialize properties into /tmp/LTL5504167869926696506.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/LTL15155811208422304158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5504167869926696506.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(G("(u17.Node15requestsent2<3)")))||(G((G(F("(i0.u3.Node2ID<1)")))U("(u7.Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(u17.Node15requestsent2<3)" & F(FG!"(i0.u3.Node2ID<1)" R !"(u7.Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin118197905196643611
[2024-05-20 17:15:59] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin118197905196643611
Running compilation step : cd /tmp/ltsmin118197905196643611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2797 ms.
Running link step : cd /tmp/ltsmin118197905196643611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin118197905196643611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true)))||[](([](<>((LTLAPp1==true))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 136419 ms.
[2024-05-20 17:16:14] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7027798276620509605
[2024-05-20 17:16:14] [INFO ] Too many transitions (2520) to apply POR reductions. Disabling POR matrices.
[2024-05-20 17:16:14] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7027798276620509605
Running compilation step : cd /tmp/ltsmin7027798276620509605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 17:16:14] [INFO ] Applying decomposition
[2024-05-20 17:16:14] [INFO ] Flatten gal took : 46 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/graph16331022529350753674.txt' '-o' '/tmp/graph16331022529350753674.bin' '-w' '/tmp/graph16331022529350753674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16331022529350753674.bin' '-l' '-1' '-v' '-w' '/tmp/graph16331022529350753674.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:16:14] [INFO ] Decomposing Gal with order
[2024-05-20 17:16:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:16:14] [INFO ] Removed a total of 1209 redundant transitions.
[2024-05-20 17:16:14] [INFO ] Flatten gal took : 94 ms
[2024-05-20 17:16:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 724 labels/synchronizations in 22 ms.
[2024-05-20 17:16:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality14436167049288176199.gal : 10 ms
[2024-05-20 17:16:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality15427973963238284534.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14436167049288176199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15427973963238284534.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !((X(G(!("((gi0.gi19.gu69.Node17OKshare>=3)||(gi0.gi0.gu1.Node0DHTinfo2>=3))")))))
Formula 0 simplified : XF"((gi0.gi19.gu69.Node17OKshare>=3)||(gi0.gi0.gu1.Node0DHTinfo2>=3))"
Compilation finished in 4756 ms.
Running link step : cd /tmp/ltsmin7027798276620509605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7027798276620509605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](!(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7027798276620509605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](!(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7027798276620509605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 17:40:55] [INFO ] Flatten gal took : 151 ms
[2024-05-20 17:40:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality12182739075112937338.gal : 12 ms
[2024-05-20 17:40:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality9363503225370476837.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/LTLCardinality12182739075112937338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9363503225370476837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((X(G(!("((Node17OKshare>=3)||(Node0DHTinfo2>=3))")))))
Formula 0 simplified : XF"((Node17OKshare>=3)||(Node0DHTinfo2>=3))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7027798276620509605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7027798276620509605;'/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' '(((LTLAPp3==true) U ([]((LTLAPp3==true))||(LTLAPp4==true))) U ([](((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))||(X([]((LTLAPp5==true)))&&((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7027798276620509605;'/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' '(((LTLAPp3==true) U ([]((LTLAPp3==true))||(LTLAPp4==true))) U ([](((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))||(X([]((LTLAPp5==true)))&&((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7027798276620509605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp6==true)))||[](([](<>((LTLAPp7==true))) U (LTLAPp8==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2328604 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15290672 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-020"
export BK_EXAMINATION="LTLCardinality"
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-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521400067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-020.tgz
mv CANInsertWithFailure-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;