About the Execution of ITS-Tools for EisenbergMcGuire-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 490.411 | 295901.00 | 346510.00 | 1416.60 | FFFFFFFTFFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266300148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716509894169
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 00:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 00:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:18:16] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-24 00:18:16] [INFO ] Transformed 117 places.
[2024-05-24 00:18:16] [INFO ] Transformed 216 transitions.
[2024-05-24 00:18:16] [INFO ] Found NUPN structural information;
[2024-05-24 00:18:16] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 111 transition count 198
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 111 transition count 198
Applied a total of 12 rules in 42 ms. Remains 111 /117 variables (removed 6) and now considering 198/216 (removed 18) transitions.
[2024-05-24 00:18:16] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:18:16] [INFO ] Computed 10 invariants in 10 ms
[2024-05-24 00:18:17] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-24 00:18:17] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:18:17] [INFO ] Invariant cache hit.
[2024-05-24 00:18:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:18:17] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:18:17] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:18:17] [INFO ] Invariant cache hit.
[2024-05-24 00:18:17] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:18:18] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 11 ms to minimize.
[2024-05-24 00:18:18] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 20 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-24 00:18:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 16 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 3 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:18:20] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-24 00:18:21] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:18:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:18:21] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:18:21] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-24 00:18:21] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-24 00:18:22] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 33 ms to minimize.
[2024-05-24 00:18:22] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-24 00:18:22] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:18:25] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:18:25] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13750 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:18:32] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:18:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-24 00:18:35] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-05-24 00:18:35] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:18:36] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11385 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 25299ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 25323ms
Starting structural reductions in LTL mode, iteration 1 : 111/117 places, 198/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26164 ms. Remains : 111/117 places, 198/216 transitions.
Support contains 31 out of 111 places after structural reductions.
[2024-05-24 00:18:42] [INFO ] Flatten gal took : 70 ms
[2024-05-24 00:18:43] [INFO ] Flatten gal took : 27 ms
[2024-05-24 00:18:43] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 30 out of 111 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (8 resets) in 2555 ms. (15 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
[2024-05-24 00:18:44] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:18:44] [INFO ] Invariant cache hit.
[2024-05-24 00:18:44] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 91/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-24 00:18:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 7 ms to minimize.
[2024-05-24 00:18:44] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:18:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 135/246 variables, 111/124 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 44/168 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 168 constraints, problems are : Problem set: 1 solved, 6 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 92/108 variables, 6/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/111 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-24 00:18:45] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 7/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 135/246 variables, 111/131 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 44/175 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 5/180 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 180 constraints, problems are : Problem set: 2 solved, 5 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 1383ms problems are : Problem set: 2 solved, 5 unsolved
Parikh walk visited 0 properties in 1803 ms.
Support contains 13 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 197
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 2 place count 110 transition count 168
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 60 place count 81 transition count 168
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 75 transition count 162
Applied a total of 72 rules in 63 ms. Remains 75 /111 variables (removed 36) and now considering 162/198 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 75/111 places, 162/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 17150 steps, run visited all 5 properties in 102 ms. (steps per millisecond=168 )
Probabilistic random walk after 17150 steps, saw 4560 distinct states, run finished after 108 ms. (steps per millisecond=158 ) properties seen :5
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 7 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 196
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4 place count 109 transition count 167
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 62 place count 80 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 74 transition count 161
Applied a total of 74 rules in 34 ms. Remains 74 /111 variables (removed 37) and now considering 161/198 (removed 37) transitions.
[2024-05-24 00:18:48] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2024-05-24 00:18:48] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 00:18:48] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-24 00:18:48] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:18:48] [INFO ] Invariant cache hit.
[2024-05-24 00:18:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:18:48] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-24 00:18:48] [INFO ] Redundant transitions in 6 ms returned []
Running 158 sub problems to find dead transitions.
[2024-05-24 00:18:48] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:18:48] [INFO ] Invariant cache hit.
[2024-05-24 00:18:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 00:18:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 12 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:18:50] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:18:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:18:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 98/172 variables, 74/106 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:18:54] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:18:54] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:18:54] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 153 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 98/172 variables, 74/109 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 44/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 158/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:18:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:00] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 313 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7604 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 27/27 constraints]
After SMT, in 15809ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 15812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/111 places, 161/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16152 ms. Remains : 74/111 places, 161/198 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-00
Product exploration explored 100000 steps with 23 reset in 325 ms.
Product exploration explored 100000 steps with 24 reset in 223 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/4 properties
BEST_FIRST walk for 692 steps (0 resets) in 10 ms. (62 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 161/161 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-05-24 00:19:06] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:19:06] [INFO ] Invariant cache hit.
[2024-05-24 00:19:06] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 00:19:06] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:19:06] [INFO ] Invariant cache hit.
[2024-05-24 00:19:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:19:06] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-24 00:19:06] [INFO ] Redundant transitions in 6 ms returned []
Running 158 sub problems to find dead transitions.
[2024-05-24 00:19:06] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:19:06] [INFO ] Invariant cache hit.
[2024-05-24 00:19:06] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:19:07] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:19:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 00:19:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:09] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:10] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 98/172 variables, 74/106 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:11] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:19:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:19:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 153 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8070 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 98/172 variables, 74/109 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 44/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 158/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:16] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:19:18] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 313 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7826 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 27/27 constraints]
After SMT, in 15965ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 15968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16264 ms. Remains : 74/74 places, 161/161 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/4 properties
BEST_FIRST walk for 768 steps (0 resets) in 7 ms. (96 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 27 reset in 177 ms.
Product exploration explored 100000 steps with 26 reset in 154 ms.
Built C files in :
/tmp/ltsmin15606765776164148058
[2024-05-24 00:19:23] [INFO ] Computing symmetric may disable matrix : 161 transitions.
[2024-05-24 00:19:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:19:23] [INFO ] Computing symmetric may enable matrix : 161 transitions.
[2024-05-24 00:19:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:19:23] [INFO ] Computing Do-Not-Accords matrix : 161 transitions.
[2024-05-24 00:19:23] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:19:23] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15606765776164148058
Running compilation step : cd /tmp/ltsmin15606765776164148058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin15606765776164148058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15606765776164148058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased332118063159485662.hoa' '--buchi-type=spotba'
LTSmin run took 348 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-00 finished in 36450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 00:19:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:19:24] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 00:19:24] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-24 00:19:24] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:19:24] [INFO ] Invariant cache hit.
[2024-05-24 00:19:25] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:19:25] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:19:25] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:19:25] [INFO ] Invariant cache hit.
[2024-05-24 00:19:25] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 4 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:19:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:19:27] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:19:28] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:19:28] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:19:28] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:19:32] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:19:32] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:19:38] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:19:41] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:19:41] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:19:41] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:19:42] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23730ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23733ms
Finished structural reductions in LTL mode , in 1 iterations and 24102 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-01 finished in 24471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(G(!p1)) U (!p2&&X(G(!p1))))||p0))))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 196
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 109 transition count 166
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 73 transition count 160
Applied a total of 76 rules in 24 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
[2024-05-24 00:19:49] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 00:19:49] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 00:19:49] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-24 00:19:49] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:19:49] [INFO ] Invariant cache hit.
[2024-05-24 00:19:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:19:49] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-24 00:19:49] [INFO ] Redundant transitions in 5 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-24 00:19:49] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:19:49] [INFO ] Invariant cache hit.
[2024-05-24 00:19:49] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
[2024-05-24 00:19:50] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:19:51] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:19:51] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-24 00:19:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:19:51] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:19:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:19:52] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-05-24 00:19:52] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:19:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:19:53] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 97/170 variables, 73/104 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:19:54] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:19:54] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 150 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7823 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/106 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 307 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4448 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints]
After SMT, in 12317ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 12320ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/111 places, 160/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12708 ms. Remains : 73/111 places, 160/198 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 232 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 149 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
Probably explored full state space saw : 5747 states, properties seen :3
Probabilistic random walk after 22988 steps, saw 5747 distinct states, run finished after 148 ms. (steps per millisecond=155 ) properties seen :3
Explored full state space saw : 5747 states, properties seen :0
Exhaustive walk after 22988 steps, saw 5747 distinct states, run finished after 127 ms. (steps per millisecond=181 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p2 p0)), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p2), (F (NOT (OR (NOT p2) p0))), (F p1)]
Knowledge based reduction with 20 factoid took 338 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 160/160 transitions.
Applied a total of 0 rules in 7 ms. Remains 73 /73 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-24 00:20:03] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:20:03] [INFO ] Invariant cache hit.
[2024-05-24 00:20:04] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-24 00:20:04] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:20:04] [INFO ] Invariant cache hit.
[2024-05-24 00:20:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:20:04] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-24 00:20:04] [INFO ] Redundant transitions in 1 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-24 00:20:04] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:20:04] [INFO ] Invariant cache hit.
[2024-05-24 00:20:04] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:20:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:20:04] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:20:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:20:07] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-05-24 00:20:07] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:20:07] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:07] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 97/170 variables, 73/104 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:09] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:20:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 150 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7679 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/106 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 307 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints]
After SMT, in 12149ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 12151ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12470 ms. Remains : 73/73 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4950 steps, run visited all 1 properties in 14 ms. (steps per millisecond=353 )
Probabilistic random walk after 4950 steps, saw 1533 distinct states, run finished after 14 ms. (steps per millisecond=353 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Built C files in :
/tmp/ltsmin4983398758771065794
[2024-05-24 00:20:17] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2024-05-24 00:20:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:20:17] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2024-05-24 00:20:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:20:17] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2024-05-24 00:20:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:20:17] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4983398758771065794
Running compilation step : cd /tmp/ltsmin4983398758771065794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 582 ms.
Running link step : cd /tmp/ltsmin4983398758771065794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4983398758771065794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5489335815050144875.hoa' '--buchi-type=spotba'
LTSmin run took 481 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-02 finished in 29135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 00:20:18] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:20:18] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:20:18] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 00:20:18] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:20:18] [INFO ] Invariant cache hit.
[2024-05-24 00:20:18] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:20:18] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:20:18] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:20:18] [INFO ] Invariant cache hit.
[2024-05-24 00:20:18] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 3 ms to minimize.
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:20:19] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:20:20] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:20:21] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:20:21] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:20:21] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:20:21] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:20:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:20:21] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:20:22] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:20:25] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:20:25] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11674 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:20:31] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:20:33] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:20:34] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:20:34] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:20:35] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 22736ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 22739ms
Finished structural reductions in LTL mode , in 1 iterations and 23068 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-03
Product exploration explored 100000 steps with 14207 reset in 135 ms.
Stack based approach found an accepted trace after 258 steps with 39 reset with depth 11 and stack size 11 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-03 finished in 23373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 196
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 109 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 6 place count 108 transition count 166
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 64 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 76 place count 73 transition count 160
Applied a total of 76 rules in 22 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
[2024-05-24 00:20:41] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 00:20:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:20:41] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 00:20:41] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:20:41] [INFO ] Invariant cache hit.
[2024-05-24 00:20:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:20:42] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-24 00:20:42] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-24 00:20:42] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:20:42] [INFO ] Invariant cache hit.
[2024-05-24 00:20:42] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:20:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:20:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:20:42] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-24 00:20:42] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:20:43] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/98 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/142 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:20:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:20:45] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:20:45] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-05-24 00:20:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 147 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5808 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:48] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:20:48] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:20:48] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:20:48] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:49] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 97/170 variables, 73/108 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 44/152 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 157/309 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:52] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:20:52] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/170 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:20:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/170 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 14 (OVERLAPS) 0/170 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 312 constraints, problems are : Problem set: 0 solved, 157 unsolved in 10767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 28/28 constraints]
After SMT, in 16610ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 16612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/111 places, 160/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16949 ms. Remains : 73/111 places, 160/198 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-04
Product exploration explored 100000 steps with 39 reset in 127 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-04 finished in 17169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 108 transition count 166
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 79 transition count 166
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 74 transition count 161
Applied a total of 74 rules in 20 ms. Remains 74 /111 variables (removed 37) and now considering 161/198 (removed 37) transitions.
[2024-05-24 00:20:58] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2024-05-24 00:20:58] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:20:59] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 00:20:59] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:20:59] [INFO ] Invariant cache hit.
[2024-05-24 00:20:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:20:59] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-24 00:20:59] [INFO ] Redundant transitions in 1 ms returned []
Running 158 sub problems to find dead transitions.
[2024-05-24 00:20:59] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-05-24 00:20:59] [INFO ] Invariant cache hit.
[2024-05-24 00:20:59] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:20:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:20:59] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 4 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:21:00] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:21:01] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 98/172 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:21:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-24 00:21:02] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:21:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:21:04] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 152 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7921 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:21:07] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/109 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/153 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 158/311 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-24 00:21:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 312 constraints, problems are : Problem set: 0 solved, 158 unsolved in 6927 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 26/26 constraints]
After SMT, in 14891ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 14893ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/111 places, 161/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15231 ms. Remains : 74/111 places, 161/198 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-05
Product exploration explored 100000 steps with 2934 reset in 107 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-05 finished in 15387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 00:21:14] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-05-24 00:21:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:21:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-24 00:21:14] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:21:14] [INFO ] Invariant cache hit.
[2024-05-24 00:21:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:21:14] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:21:14] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:21:14] [INFO ] Invariant cache hit.
[2024-05-24 00:21:14] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:15] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-24 00:21:15] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-24 00:21:15] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:21:15] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:21:15] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:21:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:21:16] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:21:17] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:21:17] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:21:17] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:21:17] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-24 00:21:17] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:21:18] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-24 00:21:18] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:21] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:21:21] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12395 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:28] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:30] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-24 00:21:30] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:21:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:21:32] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 11159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23599ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23602ms
Finished structural reductions in LTL mode , in 1 iterations and 23941 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-07 finished in 24323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(G((F(p1) U p2)))))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 00:21:38] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:21:38] [INFO ] Invariant cache hit.
[2024-05-24 00:21:38] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 00:21:38] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:21:38] [INFO ] Invariant cache hit.
[2024-05-24 00:21:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:21:39] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:21:39] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:21:39] [INFO ] Invariant cache hit.
[2024-05-24 00:21:39] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:39] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-24 00:21:39] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 00:21:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:21:41] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:21:42] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:21:42] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:21:42] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:46] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:21:46] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:52] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:21:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:21:54] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:21:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 00:21:55] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10820 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23037ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23040ms
Finished structural reductions in LTL mode , in 1 iterations and 23399 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 513 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 832 reset in 112 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-09 finished in 24054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 00:22:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:22:02] [INFO ] Invariant cache hit.
[2024-05-24 00:22:02] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 00:22:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:22:02] [INFO ] Invariant cache hit.
[2024-05-24 00:22:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:22:03] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:22:03] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:22:03] [INFO ] Invariant cache hit.
[2024-05-24 00:22:03] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:22:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 2 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:22:05] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:22:06] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-24 00:22:06] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:22:06] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:10] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 3 ms to minimize.
[2024-05-24 00:22:10] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12074 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:16] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:18] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:22:18] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
[2024-05-24 00:22:19] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-05-24 00:22:20] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10833 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 22949ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 22952ms
Finished structural reductions in LTL mode , in 1 iterations and 23298 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-10
Product exploration explored 100000 steps with 607 reset in 102 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-10 finished in 23682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F((!p1 U (p2||G(!p1)))))))'
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-24 00:22:26] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:22:26] [INFO ] Invariant cache hit.
[2024-05-24 00:22:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-24 00:22:26] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:22:26] [INFO ] Invariant cache hit.
[2024-05-24 00:22:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:22:26] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-24 00:22:26] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-05-24 00:22:26] [INFO ] Invariant cache hit.
[2024-05-24 00:22:26] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:27] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-24 00:22:27] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-24 00:22:27] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-24 00:22:27] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:22:27] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-24 00:22:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-24 00:22:28] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 00:22:29] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 00:22:29] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:22:29] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:22:29] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-24 00:22:29] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:22:30] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-24 00:22:30] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:33] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-24 00:22:33] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:40] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-24 00:22:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:22:42] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-24 00:22:42] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 00:22:43] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10955 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 23292ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23295ms
Finished structural reductions in LTL mode , in 1 iterations and 23625 ms. Remains : 111/111 places, 198/198 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-11 finished in 24019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 108 transition count 165
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 78 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 73 transition count 160
Applied a total of 76 rules in 14 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
[2024-05-24 00:22:50] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
// Phase 1: matrix 97 rows 73 cols
[2024-05-24 00:22:50] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 00:22:50] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 00:22:50] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:22:50] [INFO ] Invariant cache hit.
[2024-05-24 00:22:50] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 00:22:50] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-24 00:22:50] [INFO ] Redundant transitions in 0 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-24 00:22:50] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2024-05-24 00:22:50] [INFO ] Invariant cache hit.
[2024-05-24 00:22:50] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 00:22:51] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-24 00:22:52] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:22:53] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 00:22:53] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:22:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 97/170 variables, 73/104 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:22:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 00:22:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 00:22:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-24 00:22:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:22:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:22:57] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/170 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/170 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 154 constraints, problems are : Problem set: 0 solved, 157 unsolved in 10181 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/110 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 44/154 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 157/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:23:04] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/170 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-24 00:23:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 00:23:05] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 314 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8909 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 30/30 constraints]
After SMT, in 19125ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 19127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/111 places, 160/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19452 ms. Remains : 73/111 places, 160/198 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 354 steps with 0 reset with depth 355 and stack size 169 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-15 finished in 19616 ms.
All properties solved by simple procedures.
Total runtime 294142 ms.
BK_STOP 1716510190070
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="EisenbergMcGuire-PT-03"
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-5568"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-03, 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 r158-smll-171636266300148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;