About the Execution of ITS-Tools for CANInsertWithFailure-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFTFFTFF?FF???F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813700316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CANInsertWithFailure-PT-080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813700316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748835765569
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:42:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:42:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:42:50] [INFO ] Load time of PNML (sax parser for PT used): 1863 ms
[2025-06-02 03:42:50] [INFO ] Transformed 13764 places.
[2025-06-02 03:42:50] [INFO ] Transformed 38880 transitions.
[2025-06-02 03:42:50] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 2241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 7011 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2025-06-02 03:43:11] [INFO ] Computed 82 invariants in 12647 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:42] [INFO ] Implicit Places using invariants in 44156 ms returned []
Implicit Place search using SMT only with invariants took 44218 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 03:43:42] [INFO ] Invariant cache hit.
[2025-06-02 03:43:43] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 165283ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 165533ms
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216959 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 44 out of 13763 places after structural reductions.
[2025-06-02 03:46:30] [INFO ] Flatten gal took : 1613 ms
[2025-06-02 03:46:31] [INFO ] Flatten gal took : 1109 ms
[2025-06-02 03:46:33] [INFO ] Input system was already deterministic with 38880 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (19 resets) in 5315 ms. (7 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
[2025-06-02 03:46:36] [INFO ] Invariant cache hit.
[2025-06-02 03:46:36] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp19 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13590/13607 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:46:41] [INFO ] Deduced a trap composed of 5 places in 968 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:46:42] [INFO ] Deduced a trap composed of 5 places in 769 ms of which 23 ms to minimize.
SMT process timed out in 5724ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 13763 transition count 38324
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 13207 transition count 38324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1112 place count 13207 transition count 38323
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 6310 Post agglomeration using F-continuation condition.Transition count delta: 6310
Deduced a syphon composed of 6310 places in 22 ms
Reduce places removed 6310 places and 0 transitions.
Iterating global reduction 2 with 12620 rules applied. Total rules applied 13734 place count 6896 transition count 32013
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13738 place count 6896 transition count 32009
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13742 place count 6892 transition count 32009
Partial Free-agglomeration rule applied 6480 times.
Drop transitions (Partial Free agglomeration) removed 6480 transitions
Iterating global reduction 3 with 6480 rules applied. Total rules applied 20222 place count 6892 transition count 32009
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 20302 place count 6892 transition count 32009
Applied a total of 20302 rules in 26590 ms. Remains 6892 /13763 variables (removed 6871) and now considering 32009/38880 (removed 6871) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26591 ms. Remains : 6892/13763 places, 32009/38880 transitions.
RANDOM walk for 40000 steps (81 resets) in 4649 ms. (8 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
[2025-06-02 03:47:10] [INFO ] Flow matrix only has 32007 transitions (discarded 2 similar events)
// Phase 1: matrix 32007 rows 6892 cols
[2025-06-02 03:47:13] [INFO ] Computed 82 invariants in 2789 ms
[2025-06-02 03:47:13] [INFO ] State equation strengthened by 31738 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6726/6732 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:15] [INFO ] Deduced a trap composed of 2 places in 301 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:15] [INFO ] Deduced a trap composed of 2 places in 521 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:16] [INFO ] Deduced a trap composed of 2 places in 515 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:17] [INFO ] Deduced a trap composed of 2 places in 508 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:18] [INFO ] Deduced a trap composed of 2 places in 502 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:18] [INFO ] Deduced a trap composed of 2 places in 507 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:19] [INFO ] Deduced a trap composed of 2 places in 496 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:20] [INFO ] Deduced a trap composed of 2 places in 490 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:20] [INFO ] Deduced a trap composed of 2 places in 493 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:21] [INFO ] Deduced a trap composed of 2 places in 503 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:22] [INFO ] Deduced a trap composed of 2 places in 481 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:22] [INFO ] Deduced a trap composed of 2 places in 486 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:23] [INFO ] Deduced a trap composed of 2 places in 495 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:24] [INFO ] Deduced a trap composed of 2 places in 498 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:24] [INFO ] Deduced a trap composed of 2 places in 492 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:25] [INFO ] Deduced a trap composed of 2 places in 493 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:26] [INFO ] Deduced a trap composed of 2 places in 509 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:26] [INFO ] Deduced a trap composed of 2 places in 510 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:27] [INFO ] Deduced a trap composed of 2 places in 509 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:28] [INFO ] Deduced a trap composed of 2 places in 499 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6732 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:29] [INFO ] Deduced a trap composed of 2 places in 493 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:29] [INFO ] Deduced a trap composed of 2 places in 485 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:30] [INFO ] Deduced a trap composed of 2 places in 486 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:31] [INFO ] Deduced a trap composed of 2 places in 494 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:31] [INFO ] Deduced a trap composed of 2 places in 486 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:32] [INFO ] Deduced a trap composed of 2 places in 486 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:33] [INFO ] Deduced a trap composed of 2 places in 482 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:33] [INFO ] Deduced a trap composed of 2 places in 476 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:34] [INFO ] Deduced a trap composed of 2 places in 476 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:35] [INFO ] Deduced a trap composed of 2 places in 474 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:35] [INFO ] Deduced a trap composed of 2 places in 466 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:36] [INFO ] Deduced a trap composed of 2 places in 475 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:37] [INFO ] Deduced a trap composed of 2 places in 477 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:37] [INFO ] Deduced a trap composed of 2 places in 460 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:38] [INFO ] Deduced a trap composed of 2 places in 464 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:38] [INFO ] Deduced a trap composed of 2 places in 477 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:39] [INFO ] Deduced a trap composed of 2 places in 724 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:40] [INFO ] Deduced a trap composed of 2 places in 324 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:40] [INFO ] Deduced a trap composed of 2 places in 324 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:41] [INFO ] Deduced a trap composed of 2 places in 328 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/6732 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:42] [INFO ] Deduced a trap composed of 2 places in 322 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:43] [INFO ] Deduced a trap composed of 2 places in 324 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:43] [INFO ] Deduced a trap composed of 2 places in 317 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:44] [INFO ] Deduced a trap composed of 2 places in 315 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:44] [INFO ] Deduced a trap composed of 2 places in 318 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:45] [INFO ] Deduced a trap composed of 2 places in 307 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:45] [INFO ] Deduced a trap composed of 2 places in 314 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:46] [INFO ] Deduced a trap composed of 2 places in 320 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:46] [INFO ] Deduced a trap composed of 2 places in 312 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:46] [INFO ] Deduced a trap composed of 2 places in 310 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:47] [INFO ] Deduced a trap composed of 2 places in 312 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:47] [INFO ] Deduced a trap composed of 2 places in 309 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:48] [INFO ] Deduced a trap composed of 2 places in 315 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:48] [INFO ] Deduced a trap composed of 2 places in 396 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:49] [INFO ] Deduced a trap composed of 2 places in 302 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:50] [INFO ] Deduced a trap composed of 2 places in 439 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:50] [INFO ] Deduced a trap composed of 2 places in 403 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:50] [INFO ] Deduced a trap composed of 2 places in 276 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:51] [INFO ] Deduced a trap composed of 2 places in 297 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:51] [INFO ] Deduced a trap composed of 2 places in 271 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6732 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:52] [INFO ] Deduced a trap composed of 2 places in 261 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:52] [INFO ] Deduced a trap composed of 2 places in 266 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:52] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:53] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:53] [INFO ] Deduced a trap composed of 2 places in 259 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:54] [INFO ] Deduced a trap composed of 2 places in 271 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:54] [INFO ] Deduced a trap composed of 2 places in 290 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:54] [INFO ] Deduced a trap composed of 2 places in 258 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:55] [INFO ] Deduced a trap composed of 2 places in 257 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:55] [INFO ] Deduced a trap composed of 2 places in 271 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:56] [INFO ] Deduced a trap composed of 2 places in 396 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:56] [INFO ] Deduced a trap composed of 2 places in 274 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:57] [INFO ] Deduced a trap composed of 2 places in 348 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:57] [INFO ] Deduced a trap composed of 2 places in 294 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:57] [INFO ] Deduced a trap composed of 2 places in 249 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:58] [INFO ] Deduced a trap composed of 2 places in 250 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:47:58] [INFO ] Deduced a trap composed of 2 places in 273 ms of which 5 ms to minimize.
SMT process timed out in 48383ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 6892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6892/6892 places, 32009/32009 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 6887 transition count 32004
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 6887 transition count 32004
Applied a total of 12 rules in 9683 ms. Remains 6887 /6892 variables (removed 5) and now considering 32004/32009 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9683 ms. Remains : 6887/6892 places, 32004/32009 transitions.
RANDOM walk for 40000 steps (80 resets) in 1752 ms. (22 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
// Phase 1: matrix 32004 rows 6887 cols
[2025-06-02 03:48:11] [INFO ] Computed 82 invariants in 2950 ms
[2025-06-02 03:48:11] [INFO ] State equation strengthened by 31752 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6724/6725 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:48:13] [INFO ] Deduced a trap composed of 2 places in 298 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6725 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6725 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6883 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6883 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6885 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:48:38] [INFO ] Deduced a trap composed of 84 places in 22642 ms of which 1082 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/6885 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6885 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 38889/38891 variables, and 6969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43107 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6885/6887 constraints, ReadFeed: 0/31752 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6724/6725 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6725 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6725 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6883 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6883 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6885 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6885 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6885 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32004/38889 variables, 6885/6969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 38889/38891 variables, and 38721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37913 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6885/6887 constraints, ReadFeed: 31752/31752 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84145ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 6887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6887/6887 places, 32004/32004 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 6883 transition count 32000
Applied a total of 8 rules in 5273 ms. Remains 6883 /6887 variables (removed 4) and now considering 32000/32004 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5273 ms. Remains : 6883/6887 places, 32000/32004 transitions.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||(p1&&X((F(p2)||G(p1)))))) U X(p3))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4789 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2025-06-02 03:49:54] [INFO ] Computed 82 invariants in 11081 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:50:28] [INFO ] Performed 1118/13763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 03:50:28] [INFO ] Implicit Places using invariants in 44807 ms returned []
Implicit Place search using SMT only with invariants took 44808 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 03:50:28] [INFO ] Invariant cache hit.
[2025-06-02 03:50:28] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 175561ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 175676ms
Finished structural reductions in LTL mode , in 1 iterations and 225383 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 1015 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-00
Stuttering criterion allowed to conclude after 1729 steps with 0 reset in 126 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-00 finished in 226774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G((F(p1)||p0)))))||(p1 U (p2||G(p1))))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4077 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2025-06-02 03:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:03] [INFO ] Performed 1099/13763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 03:54:04] [INFO ] Implicit Places using invariants in 34416 ms returned []
Implicit Place search using SMT only with invariants took 34417 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 03:54:04] [INFO ] Invariant cache hit.
[2025-06-02 03:54:04] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 176478ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 176544ms
Finished structural reductions in LTL mode , in 1 iterations and 215084 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 7508 ms.
Product exploration explored 100000 steps with 50000 reset in 6563 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-03 finished in 230020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(X(F(p2)))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4829 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2025-06-02 03:57:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:57:53] [INFO ] Performed 4281/13763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 03:57:54] [INFO ] Implicit Places using invariants in 33546 ms returned []
Implicit Place search using SMT only with invariants took 33548 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 03:57:54] [INFO ] Invariant cache hit.
[2025-06-02 03:57:54] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 186473ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 186534ms
Finished structural reductions in LTL mode , in 1 iterations and 224951 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-04
Stuttering criterion allowed to conclude after 1884 steps with 0 reset in 51 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-04 finished in 225316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p0))&&X(X(p1)))) U p2)))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4968 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2025-06-02 04:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:01:37] [INFO ] Implicit Places using invariants in 31842 ms returned []
Implicit Place search using SMT only with invariants took 31844 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 04:01:37] [INFO ] Invariant cache hit.
[2025-06-02 04:01:37] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 198537ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 198601ms
Finished structural reductions in LTL mode , in 1 iterations and 235454 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-05
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-05 finished in 236069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1 U p2))&&F(p3)&&p0)))'
Support contains 6 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4289 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2025-06-02 04:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:05:34] [INFO ] Implicit Places using invariants in 32937 ms returned []
Implicit Place search using SMT only with invariants took 32939 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 04:05:34] [INFO ] Invariant cache hit.
[2025-06-02 04:05:34] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 183553ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 183617ms
Finished structural reductions in LTL mode , in 1 iterations and 220886 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-07 finished in 221242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 16 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 14884 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2025-06-02 04:08:53] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
// Phase 1: matrix 25840 rows 6884 cols
[2025-06-02 04:08:58] [INFO ] Computed 82 invariants in 5432 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:09:16] [INFO ] Implicit Places using invariants in 23775 ms returned []
Implicit Place search using SMT only with invariants took 23776 ms to find 0 implicit places.
Running 31921 sub problems to find dead transitions.
[2025-06-02 04:09:17] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2025-06-02 04:09:17] [INFO ] Invariant cache hit.
[2025-06-02 04:09:17] [INFO ] State equation strengthened by 19117 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6883 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31921 unsolved
SMT process timed out in 135446ms, After SMT, problems are : Problem set: 0 solved, 31921 unsolved
Search for dead transitions found 0 dead transitions in 135494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174327 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-08
Stuttering criterion allowed to conclude after 367 steps with 0 reset in 12 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-08 finished in 174472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3849 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2025-06-02 04:11:48] [INFO ] Computed 82 invariants in 11460 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:12:21] [INFO ] Implicit Places using invariants in 44500 ms returned []
Implicit Place search using SMT only with invariants took 44502 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 04:12:21] [INFO ] Invariant cache hit.
[2025-06-02 04:12:21] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 196149ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 196220ms
Finished structural reductions in LTL mode , in 1 iterations and 244611 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-09
Product exploration explored 100000 steps with 49 reset in 2657 ms.
Product exploration explored 100000 steps with 50 reset in 2773 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 158 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (17 resets) in 2402 ms. (16 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
[2025-06-02 04:15:44] [INFO ] Invariant cache hit.
[2025-06-02 04:15:44] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13601/52643 variables, and 1 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13601/52643 variables, and 1 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/80 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13763 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5736ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 16 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13761 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13762 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6479 times.
Drop transitions (Partial Free agglomeration) removed 6479 transitions
Iterating global reduction 3 with 6479 rules applied. Total rules applied 20241 place count 6882 transition count 31999
Applied a total of 20241 rules in 18444 ms. Remains 6882 /13763 variables (removed 6881) and now considering 31999/38880 (removed 6881) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18445 ms. Remains : 6882/13763 places, 31999/38880 transitions.
RANDOM walk for 40000 steps (81 resets) in 1894 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69661 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69661 steps, saw 63382 distinct states, run finished after 3012 ms. (steps per millisecond=23 ) properties seen :0
[2025-06-02 04:16:12] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
// Phase 1: matrix 31997 rows 6882 cols
[2025-06-02 04:16:15] [INFO ] Computed 82 invariants in 2935 ms
[2025-06-02 04:16:15] [INFO ] State equation strengthened by 31756 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6718/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:16:17] [INFO ] Deduced a trap composed of 2 places in 440 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:16:18] [INFO ] Deduced a trap composed of 2 places in 450 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:16:43] [INFO ] Deduced a trap composed of 84 places in 23068 ms of which 1274 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:17:04] [INFO ] Deduced a trap composed of 86 places in 20653 ms of which 1109 ms to minimize.
SMT process timed out in 51937ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2587 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2588 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2570 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2025-06-02 04:17:09] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2025-06-02 04:17:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:17:38] [INFO ] Implicit Places using invariants in 29358 ms returned []
Implicit Place search using SMT only with invariants took 29363 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2025-06-02 04:17:39] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2025-06-02 04:17:39] [INFO ] Invariant cache hit.
[2025-06-02 04:17:39] [INFO ] State equation strengthened by 31756 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 139009ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 139118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171106 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 497 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 17 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 12766 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2025-06-02 04:20:11] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2025-06-02 04:20:16] [INFO ] Computed 82 invariants in 4837 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:20:34] [INFO ] Implicit Places using invariants in 22976 ms returned []
Implicit Place search using SMT only with invariants took 22977 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2025-06-02 04:20:34] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2025-06-02 04:20:34] [INFO ] Invariant cache hit.
[2025-06-02 04:20:34] [INFO ] State equation strengthened by 19118 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 135869ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 135923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171697 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Computed a total of 243 stabilizing places and 400 stable transitions
Computed a total of 243 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (97 resets) in 2015 ms. (19 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/3 properties
[2025-06-02 04:22:51] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2025-06-02 04:22:51] [INFO ] Invariant cache hit.
[2025-06-02 04:22:51] [INFO ] State equation strengthened by 19118 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6719/6721 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:22:53] [INFO ] Deduced a trap composed of 2 places in 423 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6721 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6721 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6879 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6879 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6881 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:23:19] [INFO ] Deduced a trap composed of 86 places in 23476 ms of which 1260 ms to minimize.
SMT process timed out in 28033ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 6883 transition count 31999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6882 transition count 31999
Partial Free-agglomeration rule applied 6479 times.
Drop transitions (Partial Free agglomeration) removed 6479 transitions
Iterating global reduction 1 with 6479 rules applied. Total rules applied 6481 place count 6882 transition count 31999
Applied a total of 6481 rules in 7337 ms. Remains 6882 /6883 variables (removed 1) and now considering 31999/32000 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7338 ms. Remains : 6882/6883 places, 31999/32000 transitions.
RANDOM walk for 40000 steps (83 resets) in 2501 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 68267 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 68267 steps, saw 63181 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2025-06-02 04:23:30] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
// Phase 1: matrix 31997 rows 6882 cols
[2025-06-02 04:23:33] [INFO ] Computed 82 invariants in 2752 ms
[2025-06-02 04:23:33] [INFO ] State equation strengthened by 31756 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6718/6720 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:23:35] [INFO ] Deduced a trap composed of 2 places in 513 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:23:36] [INFO ] Deduced a trap composed of 2 places in 534 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6720 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6720 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 158/6878 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6878 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6880 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:24:02] [INFO ] Deduced a trap composed of 84 places in 23631 ms of which 1135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:24:24] [INFO ] Deduced a trap composed of 86 places in 21864 ms of which 1076 ms to minimize.
SMT process timed out in 53579ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 6882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2946 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2946 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6882/6882 places, 31999/31999 transitions.
Applied a total of 0 rules in 2743 ms. Remains 6882 /6882 variables (removed 0) and now considering 31999/31999 (removed 0) transitions.
[2025-06-02 04:24:30] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2025-06-02 04:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:24:59] [INFO ] Implicit Places using invariants in 29209 ms returned []
Implicit Place search using SMT only with invariants took 29210 ms to find 0 implicit places.
Running 31919 sub problems to find dead transitions.
[2025-06-02 04:24:59] [INFO ] Flow matrix only has 31997 transitions (discarded 2 similar events)
[2025-06-02 04:24:59] [INFO ] Invariant cache hit.
[2025-06-02 04:24:59] [INFO ] State equation strengthened by 31756 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6881 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31919 unsolved
SMT process timed out in 142280ms, After SMT, problems are : Problem set: 0 solved, 31919 unsolved
Search for dead transitions found 0 dead transitions in 142335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174327 ms. Remains : 6882/6882 places, 31999/31999 transitions.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 459 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 248 reset in 3292 ms.
Product exploration explored 100000 steps with 246 reset in 3173 ms.
Built C files in :
/tmp/ltsmin13931574497394168504
[2025-06-02 04:27:29] [INFO ] Too many transitions (32000) to apply POR reductions. Disabling POR matrices.
[2025-06-02 04:27:29] [INFO ] Built C files in 466ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13931574497394168504
Running compilation step : cd /tmp/ltsmin13931574497394168504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin13931574497394168504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin13931574497394168504;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 2207 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2025-06-02 04:27:34] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2025-06-02 04:27:40] [INFO ] Computed 82 invariants in 5289 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:27:59] [INFO ] Implicit Places using invariants in 24088 ms returned []
Implicit Place search using SMT only with invariants took 24095 ms to find 0 implicit places.
Running 31920 sub problems to find dead transitions.
[2025-06-02 04:27:59] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2025-06-02 04:27:59] [INFO ] Invariant cache hit.
[2025-06-02 04:27:59] [INFO ] State equation strengthened by 19118 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6882 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31920 unsolved
SMT process timed out in 133680ms, After SMT, problems are : Problem set: 0 solved, 31920 unsolved
Search for dead transitions found 0 dead transitions in 133733ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 160066 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Built C files in :
/tmp/ltsmin7444726057362036064
[2025-06-02 04:30:12] [INFO ] Too many transitions (32000) to apply POR reductions. Disabling POR matrices.
[2025-06-02 04:30:13] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7444726057362036064
Running compilation step : cd /tmp/ltsmin7444726057362036064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin7444726057362036064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin7444726057362036064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 04:30:18] [INFO ] Flatten gal took : 1148 ms
[2025-06-02 04:30:19] [INFO ] Flatten gal took : 650 ms
[2025-06-02 04:30:19] [INFO ] Time to serialize gal into /tmp/LTL10792361716178673710.gal : 270 ms
[2025-06-02 04:30:19] [INFO ] Time to serialize properties into /tmp/LTL1809783052558611913.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10792361716178673710.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14567147244981540356.hoa' '-atoms' '/tmp/LTL1809783052558611913.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1809783052558611913.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14567147244981540356.hoa
Detected timeout of ITS tools.
[2025-06-02 04:30:35] [INFO ] Flatten gal took : 583 ms
[2025-06-02 04:30:36] [INFO ] Flatten gal took : 576 ms
[2025-06-02 04:30:36] [INFO ] Time to serialize gal into /tmp/LTL8009798125564100618.gal : 284 ms
[2025-06-02 04:30:36] [INFO ] Time to serialize properties into /tmp/LTL17762785833922889948.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8009798125564100618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17762785833922889948.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(Node52requestsent15<1)"))||(G("(Node2requestsent48<1)")))))
Formula 0 simplified : X(F!"(Node52requestsent15<1)" & F!"(Node2requestsent48<1)")
Detected timeout of ITS tools.
[2025-06-02 04:30:52] [INFO ] Flatten gal took : 692 ms
[2025-06-02 04:30:52] [INFO ] Applying decomposition
[2025-06-02 04:30:53] [INFO ] Flatten gal took : 581 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18184689575126985055.txt' '-o' '/tmp/graph18184689575126985055.bin' '-w' '/tmp/graph18184689575126985055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18184689575126985055.bin' '-l' '-1' '-v' '-w' '/tmp/graph18184689575126985055.weights' '-q' '0' '-e' '0.001'
[2025-06-02 04:30:55] [INFO ] Decomposing Gal with order
[2025-06-02 04:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 04:31:02] [INFO ] Removed a total of 25416 redundant transitions.
[2025-06-02 04:31:03] [INFO ] Flatten gal took : 6411 ms
[2025-06-02 04:31:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 18803 labels/synchronizations in 7575 ms.
[2025-06-02 04:31:11] [INFO ] Time to serialize gal into /tmp/LTL11325518306202759723.gal : 181 ms
[2025-06-02 04:31:11] [INFO ] Time to serialize properties into /tmp/LTL5758942485578854084.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11325518306202759723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5758942485578854084.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(u53.Node52requestsent15<1)"))||(G("(u3.Node2requestsent48<1)")))))
Formula 0 simplified : X(F!"(u53.Node52requestsent15<1)" & F!"(u3.Node2requestsent48<1)")
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-09 finished in 1193747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||X(X(F(p1))))) U G(p2))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4208 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2025-06-02 04:31:42] [INFO ] Computed 82 invariants in 11521 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:32:15] [INFO ] Performed 1113/13763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 04:32:15] [INFO ] Implicit Places using invariants in 45265 ms returned []
Implicit Place search using SMT only with invariants took 45267 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 04:32:16] [INFO ] Invariant cache hit.
[2025-06-02 04:32:16] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 179408ms, After SMT, problems are : Problem set: 0 solved, 38800 unsolved
Search for dead transitions found 0 dead transitions in 179471ms
Finished structural reductions in LTL mode , in 1 iterations and 228983 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLFireability-11
Product exploration explored 100000 steps with 24995 reset in 3831 ms.
Product exploration explored 100000 steps with 25101 reset in 3919 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (19 resets) in 2127 ms. (18 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
[2025-06-02 04:35:24] [INFO ] Invariant cache hit.
[2025-06-02 04:35:24] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13599/13601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:35:28] [INFO ] Deduced a trap composed of 5 places in 1020 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:35:30] [INFO ] Deduced a trap composed of 5 places in 1072 ms of which 32 ms to minimize.
SMT process timed out in 5308ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 14 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13759 place count 6884 transition count 32000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6480 times.
Drop transitions (Partial Free agglomeration) removed 6480 transitions
Iterating global reduction 3 with 6480 rules applied. Total rules applied 20240 place count 6883 transition count 32000
Applied a total of 20240 rules in 17817 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17819 ms. Remains : 6883/13763 places, 32000/38880 transitions.
RANDOM walk for 29133 steps (60 resets) in 1546 ms. (18 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 313 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 13205 transition count 38321
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 18 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 2 with 12636 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 12257 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2025-06-02 04:36:01] [INFO ] Flow matrix only has 25842 transitions (discarded 6161 similar events)
// Phase 1: matrix 25842 rows 6886 cols
[2025-06-02 04:36:06] [INFO ] Computed 82 invariants in 5421 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:36:26] [INFO ] Implicit Places using invariants in 24698 ms returned []
Implicit Place search using SMT only with invariants took 24700 ms to find 0 implicit places.
Running 31923 sub problems to find dead transitions.
[2025-06-02 04:36:26] [INFO ] Flow matrix only has 25842 transitions (discarded 6161 similar events)
[2025-06-02 04:36:26] [INFO ] Invariant cache hit.
[2025-06-02 04:36:26] [INFO ] State equation strengthened by 19116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6885 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 31923 unsolved
SMT process timed out in 134149ms, After SMT, problems are : Problem set: 0 solved, 31923 unsolved
Search for dead transitions found 0 dead transitions in 134202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171195 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Computed a total of 241 stabilizing places and 400 stable transitions
Computed a total of 241 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 32620 steps (80 resets) in 1294 ms. (25 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 386 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 245 reset in 3066 ms.
Stack based approach found an accepted trace after 21862 steps with 54 reset with depth 389 and stack size 388 in 664 ms.
FORMULA CANInsertWithFailure-PT-080-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLFireability-11 finished in 439176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3971 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2025-06-02 04:39:01] [INFO ] Computed 82 invariants in 11370 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:39:34] [INFO ] Performed 1113/13763 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 04:39:34] [INFO ] Implicit Places using invariants in 44947 ms returned []
Implicit Place search using SMT only with invariants took 44948 ms to find 0 implicit places.
Running 38800 sub problems to find dead transitions.
[2025-06-02 04:39:34] [INFO ] Invariant cache hit.
[2025-06-02 04:39:34] [INFO ] State equation strengthened by 12720 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-080, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813700316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-080.tgz
mv CANInsertWithFailure-PT-080 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;