About the Execution of ITS-Tools for FamilyReunion-PT-L00100M0010C005P005G002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ??F?FTTFTFTTF?F? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102100219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102100219
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 345K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 723K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 451K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 400K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 17M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748816148421
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00100M0010C005P005G002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 22:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 22:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:15:52] [INFO ] Load time of PNML (sax parser for PT used): 1439 ms
[2025-06-01 22:15:52] [INFO ] Transformed 40605 places.
[2025-06-01 22:15:52] [INFO ] Transformed 36871 transitions.
[2025-06-01 22:15:52] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 1816 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 138 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7720 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 327 places and 0 transitions.
Discarding 5555 places :
Implicit places reduction removed 5555 places
Iterating post reduction 0 with 5882 rules applied. Total rules applied 5882 place count 34692 transition count 36871
Applied a total of 5882 rules in 1337 ms. Remains 34692 /40574 variables (removed 5882) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 34692 cols
[2025-06-01 22:15:59] [INFO ] Computed 3043 invariants in 4216 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:16:46] [INFO ] Performed 22775/34692 implicitness test of which 328 returned IMPLICIT in 30 seconds.
[2025-06-01 22:17:16] [INFO ] Performed 30885/34692 implicitness test of which 602 returned IMPLICIT in 60 seconds.
[2025-06-01 22:17:27] [INFO ] Implicit Places using invariants in 92128 ms returned [707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 1919, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 12025, 12026, 12027, 12028, 12029, 12030, 12031, 12032, 12033, 12034, 12035, 12036, 12037, 12038, 12039, 12040, 12042, 12043, 12044, 12045, 12046, 12047, 12048, 12049, 12050, 12051, 12052, 12053, 12054, 12055, 12056, 12057, 12058, 12059, 12060, 12061, 12062, 12063, 12064, 12065, 12066, 12067, 12068, 12069, 12070, 12071, 12072, 12073, 12074, 12075, 12076, 12077, 12078, 12079, 12080, 12081, 12082, 12083, 12084, 12085, 12086, 12087, 12088, 12089, 12090, 12091, 12092, 12093, 12094, 12095, 12096, 12097, 12098, 12099, 12100, 12101, 12102, 12103, 12104, 12105, 12106, 12107, 12108, 12109, 12110, 12111, 12112, 12113, 12114, 12115, 12116, 12117, 12118, 12119, 12120, 12121, 12122, 12123, 12124, 12125, 22748, 22749, 22750, 22751, 22752, 22753, 22754, 22755, 22756, 22757, 22758, 22759, 22760, 22761, 22762, 22763, 22764, 22765, 22766, 22767, 22768, 22769, 22770, 22771, 22772, 22773, 22774, 22775, 22776, 22777, 22778, 22779, 22780, 22781, 22782, 22783, 22784, 22785, 22786, 22787, 22788, 22789, 22790, 22791, 22792, 22793, 22794, 22795, 22796, 22797, 22798, 22799, 22800, 22801, 22802, 22803, 22804, 22805, 22806, 22807, 22808, 22809, 22810, 22811, 22812, 22813, 22814, 22815, 22816, 22817, 22818, 22819, 22820, 22821, 22822, 22823, 22824, 22825, 22826, 22827, 22828, 22829, 22830, 22831, 22832, 22833, 22834, 22835, 22836, 22837, 22838, 22839, 22840, 22841, 22842, 22843, 22844, 22845, 22846, 22847, 22848, 26689, 26690, 26691, 26692, 26693, 26694, 26695, 26696, 26697, 26698, 26699, 26700, 26701, 26702, 26703, 26704, 26705, 26706, 26707, 26708, 26709, 26710, 26711, 26712, 26713, 26714, 26715, 26716, 26717, 26718, 26719, 26720, 26721, 26722, 26723, 26724, 26725, 26726, 26727, 26728, 26729, 26731, 26732, 26733, 26734, 26735, 26736, 26737, 26738, 26739, 26740, 26741, 26742, 26743, 26744, 26745, 26746, 26747, 26748, 26749, 26750, 26751, 26752, 26753, 26754, 26755, 26756, 26757, 26758, 26759, 26760, 26761, 26762, 26763, 26764, 26765, 26766, 26767, 26768, 26769, 26770, 26771, 26772, 26773, 26774, 26775, 26776, 26777, 26778, 26779, 26780, 26781, 26782, 26783, 26784, 26785, 26786, 26787, 26788, 26789, 28204, 28205, 28206, 28207, 28208, 28209, 28210, 28211, 28212, 28213, 28214, 28215, 28216, 28217, 28218, 28219, 28220, 28221, 28222, 28223, 28224, 28225, 28226, 28227, 28228, 28229, 28230, 28231, 28232, 28233, 28234, 28235, 28236, 28237, 28238, 28239, 28240, 28241, 28242, 28243, 28244, 28245, 28246, 28247, 28248, 28249, 28250, 28251, 28252, 28253, 28254, 28255, 28256, 28257, 28258, 28259, 28260, 28261, 28262, 28263, 28264, 28265, 28266, 28267, 28268, 28269, 28270, 28271, 28272, 28273, 28274, 28275, 28276, 28277, 28278, 28279, 28280, 28281, 28282, 28283, 28284, 28285, 28286, 28287, 28288, 28289, 28290, 28291, 28292, 28293, 28294, 28295, 28296, 28297, 28298, 28299, 28300, 28301, 28302, 28303, 28304, 33373, 33374, 33375, 33376, 33377, 33378, 33379, 33380, 33381, 33382, 33383, 33384, 33385, 33386, 33387, 33388, 33389, 33390, 33391, 33392, 33393, 33394, 33395, 33396, 33397, 33398, 33399, 33400, 33401, 33402, 33403, 33404, 33405, 33406, 33407, 33408, 33409, 33410, 33411, 33412, 33413, 33414, 33415, 33416, 33417, 33418, 33419, 33420, 33421, 33422, 33423, 33424, 33425, 33426, 33427, 33428, 33429, 33430, 33431, 33432, 33433, 33434, 33435, 33436, 33437, 33438, 33439, 33440, 33441, 33442, 33443, 33444, 33445, 33446, 33447, 33448, 33449, 33450, 33451, 33452, 33453, 33454, 33455, 33456, 33457, 33458, 33459, 33460, 33461, 33462, 33463, 33464, 33465, 33466, 33467, 33468, 33469, 33470, 33471, 33472, 33473]
Discarding 703 places :
Implicit Place search using SMT only with invariants took 92273 ms to find 703 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33989/40574 places, 36871/36871 transitions.
Applied a total of 0 rules in 248 ms. Remains 33989 /33989 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93889 ms. Remains : 33989/40574 places, 36871/36871 transitions.
Support contains 7720 out of 33989 places after structural reductions.
[2025-06-01 22:17:30] [INFO ] Flatten gal took : 1696 ms
[2025-06-01 22:17:31] [INFO ] Flatten gal took : 1144 ms
[2025-06-01 22:17:34] [INFO ] Input system was already deterministic with 36871 transitions.
RANDOM walk for 40000 steps (8 resets) in 7871 ms. (5 steps per ms) remains 20/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 163 ms. (24 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 183 ms. (21 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
// Phase 1: matrix 36871 rows 33989 cols
[2025-06-01 22:17:40] [INFO ] Computed 2340 invariants in 3283 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3854 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3854 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SMT process timed out in 8935ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3854 out of 33989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Graph (complete) has 48705 edges and 33989 vertex of which 33671 are kept as prefixes of interest. Removing 318 places using SCC suffix rule.77 ms
Discarding 318 places :
Also discarding 306 output transitions
Drop transitions (Output transitions of discarded places.) removed 306 transitions
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17249 transitions
Trivial Post-agglo rules discarded 17249 transitions
Performed 17249 trivial Post agglomeration. Transition count delta: 17249
Iterating post reduction 0 with 18360 rules applied. Total rules applied 18361 place count 32560 transition count 19316
Reduce places removed 17249 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 17849 rules applied. Total rules applied 36210 place count 15311 transition count 18716
Reduce places removed 100 places and 0 transitions.
Performed 1321 Post agglomeration using F-continuation condition.Transition count delta: 1321
Iterating post reduction 2 with 1421 rules applied. Total rules applied 37631 place count 15211 transition count 17395
Reduce places removed 1321 places and 0 transitions.
Iterating post reduction 3 with 1321 rules applied. Total rules applied 38952 place count 13890 transition count 17395
Performed 3117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3117 Pre rules applied. Total rules applied 38952 place count 13890 transition count 14278
Deduced a syphon composed of 3117 places in 13 ms
Ensure Unique test removed 906 places
Reduce places removed 4023 places and 0 transitions.
Iterating global reduction 4 with 7140 rules applied. Total rules applied 46092 place count 9867 transition count 14278
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 46094 place count 9865 transition count 14278
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 100 Pre rules applied. Total rules applied 46094 place count 9865 transition count 14178
Deduced a syphon composed of 100 places in 24 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 5 with 200 rules applied. Total rules applied 46294 place count 9765 transition count 14178
Discarding 2738 places :
Symmetric choice reduction at 5 with 2738 rule applications. Total rules 49032 place count 7027 transition count 10940
Iterating global reduction 5 with 2738 rules applied. Total rules applied 51770 place count 7027 transition count 10940
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 7 rules applied. Total rules applied 51777 place count 7026 transition count 10934
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 4 rules applied. Total rules applied 51781 place count 7025 transition count 10931
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 51784 place count 7022 transition count 10931
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 51793 place count 7013 transition count 10022
Iterating global reduction 8 with 9 rules applied. Total rules applied 51802 place count 7013 transition count 10022
Performed 299 Post agglomeration using F-continuation condition.Transition count delta: 299
Deduced a syphon composed of 299 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 8 with 600 rules applied. Total rules applied 52402 place count 6712 transition count 9723
Free-agglomeration rule applied 1111 times.
Iterating global reduction 8 with 1111 rules applied. Total rules applied 53513 place count 6712 transition count 8612
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 8 with 1111 rules applied. Total rules applied 54624 place count 5601 transition count 8612
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 54628 place count 5601 transition count 8608
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 54632 place count 5597 transition count 8608
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 10 with 101 rules applied. Total rules applied 54733 place count 5597 transition count 8608
Applied a total of 54733 rules in 9222 ms. Remains 5597 /33989 variables (removed 28392) and now considering 8608/36871 (removed 28263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9223 ms. Remains : 5597/33989 places, 8608/36871 transitions.
RANDOM walk for 40000 steps (28 resets) in 3168 ms. (12 steps per ms) remains 10/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
// Phase 1: matrix 8608 rows 5597 cols
[2025-06-01 22:17:57] [INFO ] Computed 311 invariants in 299 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/63 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5236/5299 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5299 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 297/5596 variables, 297/311 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5596 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 7 (OVERLAPS) 8608/14204 variables, 5596/5907 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14204 variables, 0/5907 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/14205 variables, 1/5908 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/14205 variables, 0/5908 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/14205 variables, 0/5908 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14205/14205 variables, and 5908 constraints, problems are : Problem set: 8 solved, 2 unsolved in 13235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 309/309 constraints, State Equation: 5597/5597 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5240/5295 variables, 9/11 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5295 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 301/5596 variables, 300/311 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5596 variables, 0/311 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8608/14204 variables, 5596/5907 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14204 variables, 2/5909 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/14204 variables, 0/5909 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/14205 variables, 1/5910 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/14205 variables, 0/5910 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/14205 variables, 0/5910 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14205/14205 variables, and 5910 constraints, problems are : Problem set: 8 solved, 2 unsolved in 21922 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 309/309 constraints, State Equation: 5597/5597 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35574ms problems are : Problem set: 8 solved, 2 unsolved
Finished Parikh walk after 589 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 962 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33989 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33989 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 1717 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1125 rules applied. Total rules applied 1125 place count 32864 transition count 36871
Applied a total of 1125 rules in 539 ms. Remains 32864 /33989 variables (removed 1125) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 32864 cols
[2025-06-01 22:18:37] [INFO ] Computed 1221 invariants in 2393 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:19:05] [INFO ] Implicit Places using invariants in 30523 ms returned [1818, 1819, 10714, 17892, 17893, 17894, 17895, 17896, 17897, 17898, 17899, 17900, 17901, 17902, 17903, 17904, 17905, 17906, 17907, 17908, 17909, 17910, 17911, 17912, 17913, 17914, 17915, 17916, 17917, 17918, 17919, 17920, 17921, 17922, 17923, 17924, 17925, 17926, 17927, 17928, 17929, 17930, 17931, 17932, 17933, 17934, 17935, 17936, 17937, 17938, 17939, 17940, 17941, 17942, 17943, 17944, 17945, 17946, 17947, 17948, 17949, 17950, 17951, 17952, 17953, 17954, 17955, 17956, 17957, 17958, 17959, 17960, 17961, 17962, 17963, 17964, 17965, 17966, 17967, 17968, 17969, 17970, 17971, 17972, 17973, 17974, 17975, 17976, 17977, 17978, 17979, 17980, 17981, 17982, 17983, 17984, 17985, 17986, 17987, 17988, 17989, 17990, 17991, 17992, 21034, 21035, 21036, 21037, 21038, 21039, 21040, 21041, 21042, 21043, 21044, 21045, 21046, 21047, 21048, 21049, 21050, 21051, 21052, 21053, 21054, 21055, 21056, 21057, 21058, 21059, 21060, 21061, 21062, 21063, 21064, 21065, 21066, 21067, 21068, 21069, 21070, 21071, 21072, 21073, 21074, 21075, 21076, 21077, 21078, 21079, 21080, 21081, 21082, 21083, 21084, 21085, 21086, 21087, 21088, 21089, 21090, 21091, 21092, 21093, 21094, 21095, 21096, 21097, 21098, 21099, 21100, 21101, 21102, 21103, 21104, 21105, 21106, 21107, 21108, 21109, 21110, 21111, 21112, 21113, 21114, 21115, 21116, 21117, 21118, 21119, 21120, 21121, 21122, 21123, 21124, 21125, 21126, 21127, 21128, 21129, 21130, 21131, 21132, 21133, 21134, 25175]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 30566 ms to find 206 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32658/33989 places, 36871/36871 transitions.
Applied a total of 0 rules in 252 ms. Remains 32658 /32658 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31361 ms. Remains : 32658/33989 places, 36871/36871 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00
Product exploration explored 100000 steps with 25 reset in 6639 ms.
Product exploration explored 100000 steps with 25 reset in 6273 ms.
Computed a total of 32658 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32658 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 6193 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1565 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1553 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 57532 steps, run timeout after 6001 ms. (steps per millisecond=9 ) properties seen :0 out of 3
Probabilistic random walk after 57532 steps, saw 56970 distinct states, run finished after 6015 ms. (steps per millisecond=9 ) properties seen :0
// Phase 1: matrix 36871 rows 32658 cols
[2025-06-01 22:20:09] [INFO ] Computed 1015 invariants in 2629 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1717 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7960ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1717 out of 32658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32658/32658 places, 36871/36871 transitions.
Graph (complete) has 45349 edges and 32658 vertex of which 32349 are kept as prefixes of interest. Removing 309 places using SCC suffix rule.16 ms
Discarding 309 places :
Also discarding 309 output transitions
Drop transitions (Output transitions of discarded places.) removed 309 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22220 transitions
Trivial Post-agglo rules discarded 22220 transitions
Performed 22220 trivial Post agglomeration. Transition count delta: 22220
Iterating post reduction 0 with 22220 rules applied. Total rules applied 22221 place count 32349 transition count 14342
Reduce places removed 22220 places and 0 transitions.
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 1 with 22927 rules applied. Total rules applied 45148 place count 10129 transition count 13635
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 45350 place count 9927 transition count 13635
Performed 3030 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3030 Pre rules applied. Total rules applied 45350 place count 9927 transition count 10605
Deduced a syphon composed of 3030 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 3939 places and 0 transitions.
Iterating global reduction 3 with 6969 rules applied. Total rules applied 52319 place count 5988 transition count 10605
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 52319 place count 5988 transition count 10504
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 52521 place count 5887 transition count 10504
Discarding 1732 places :
Symmetric choice reduction at 3 with 1732 rule applications. Total rules 54253 place count 4155 transition count 7272
Iterating global reduction 3 with 1732 rules applied. Total rules applied 55985 place count 4155 transition count 7272
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 3 with 1010 rules applied. Total rules applied 56995 place count 4155 transition count 6262
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 56995 place count 4155 transition count 6060
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 57399 place count 3953 transition count 6060
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 4 with 606 rules applied. Total rules applied 58005 place count 3650 transition count 5757
Free-agglomeration rule (complex) applied 1212 times.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 59217 place count 3650 transition count 4545
Ensure Unique test removed 101 places
Reduce places removed 1313 places and 0 transitions.
Iterating post reduction 4 with 1313 rules applied. Total rules applied 60530 place count 2337 transition count 4545
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 5 with 101 rules applied. Total rules applied 60631 place count 2236 transition count 4444
Applied a total of 60631 rules in 3930 ms. Remains 2236 /32658 variables (removed 30422) and now considering 4444/36871 (removed 32427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3930 ms. Remains : 2236/32658 places, 4444/36871 transitions.
RANDOM walk for 1372 steps (0 resets) in 400 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-01 22:20:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 1717 out of 32658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32658/32658 places, 36871/36871 transitions.
Applied a total of 0 rules in 237 ms. Remains 32658 /32658 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
[2025-06-01 22:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:20:51] [INFO ] Implicit Places using invariants in 20103 ms returned []
Implicit Place search using SMT only with invariants took 20110 ms to find 0 implicit places.
Running 36770 sub problems to find dead transitions.
[2025-06-01 22:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 175068ms, After SMT, problems are : Problem set: 0 solved, 36770 unsolved
Search for dead transitions found 0 dead transitions in 175365ms
Finished structural reductions in LTL mode , in 1 iterations and 195850 ms. Remains : 32658/32658 places, 36871/36871 transitions.
Computed a total of 32658 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32658 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 6262 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2248 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1334 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 60918 steps, run timeout after 6005 ms. (steps per millisecond=10 ) properties seen :0 out of 3
Probabilistic random walk after 60918 steps, saw 60323 distinct states, run finished after 6006 ms. (steps per millisecond=10 ) properties seen :0
[2025-06-01 22:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1717 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5178ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1717 out of 32658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32658/32658 places, 36871/36871 transitions.
Graph (complete) has 45349 edges and 32658 vertex of which 32349 are kept as prefixes of interest. Removing 309 places using SCC suffix rule.24 ms
Discarding 309 places :
Also discarding 309 output transitions
Drop transitions (Output transitions of discarded places.) removed 309 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22220 transitions
Trivial Post-agglo rules discarded 22220 transitions
Performed 22220 trivial Post agglomeration. Transition count delta: 22220
Iterating post reduction 0 with 22220 rules applied. Total rules applied 22221 place count 32349 transition count 14342
Reduce places removed 22220 places and 0 transitions.
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 1 with 22927 rules applied. Total rules applied 45148 place count 10129 transition count 13635
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 45350 place count 9927 transition count 13635
Performed 3030 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3030 Pre rules applied. Total rules applied 45350 place count 9927 transition count 10605
Deduced a syphon composed of 3030 places in 4 ms
Ensure Unique test removed 909 places
Reduce places removed 3939 places and 0 transitions.
Iterating global reduction 3 with 6969 rules applied. Total rules applied 52319 place count 5988 transition count 10605
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 52319 place count 5988 transition count 10504
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 52521 place count 5887 transition count 10504
Discarding 1732 places :
Symmetric choice reduction at 3 with 1732 rule applications. Total rules 54253 place count 4155 transition count 7272
Iterating global reduction 3 with 1732 rules applied. Total rules applied 55985 place count 4155 transition count 7272
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 3 with 1010 rules applied. Total rules applied 56995 place count 4155 transition count 6262
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 202 Pre rules applied. Total rules applied 56995 place count 4155 transition count 6060
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 404 rules applied. Total rules applied 57399 place count 3953 transition count 6060
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 4 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 4 with 606 rules applied. Total rules applied 58005 place count 3650 transition count 5757
Free-agglomeration rule (complex) applied 1212 times.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 59217 place count 3650 transition count 4545
Ensure Unique test removed 101 places
Reduce places removed 1313 places and 0 transitions.
Iterating post reduction 4 with 1313 rules applied. Total rules applied 60530 place count 2337 transition count 4545
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 5 with 101 rules applied. Total rules applied 60631 place count 2236 transition count 4444
Applied a total of 60631 rules in 3562 ms. Remains 2236 /32658 variables (removed 30422) and now considering 4444/36871 (removed 32427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3562 ms. Remains : 2236/32658 places, 4444/36871 transitions.
RANDOM walk for 1820 steps (1 resets) in 144 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-01 22:24:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24 reset in 6421 ms.
Product exploration explored 100000 steps with 24 reset in 6814 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1717 out of 32658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32658/32658 places, 36871/36871 transitions.
Graph (complete) has 45349 edges and 32658 vertex of which 32349 are kept as prefixes of interest. Removing 309 places using SCC suffix rule.66 ms
Discarding 309 places :
Also discarding 309 output transitions
Drop transitions (Output transitions of discarded places.) removed 309 transitions
Performed 13736 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13736 rules applied. Total rules applied 13737 place count 32349 transition count 36562
Performed 7575 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7575 Pre rules applied. Total rules applied 13737 place count 32349 transition count 37269
Deduced a syphon composed of 21311 places in 40 ms
Iterating global reduction 1 with 7575 rules applied. Total rules applied 21312 place count 32349 transition count 37269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21317 place count 32344 transition count 36764
Deduced a syphon composed of 21311 places in 37 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21322 place count 32344 transition count 36764
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 21322 place count 32344 transition count 36764
Deduced a syphon composed of 21412 places in 35 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 21423 place count 32344 transition count 36764
Performed 5353 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 26765 places in 18 ms
Iterating global reduction 1 with 5353 rules applied. Total rules applied 26776 place count 32344 transition count 37774
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Iterating post reduction 1 with 505 rules applied. Total rules applied 27281 place count 32344 transition count 37269
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 27291 place count 32334 transition count 36259
Deduced a syphon composed of 26765 places in 19 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 27301 place count 32334 transition count 36259
Ensure Unique test removed 2020 transitions
Reduce isomorphic transitions removed 2020 transitions.
Iterating post reduction 2 with 2020 rules applied. Total rules applied 29321 place count 32334 transition count 34239
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26866 places in 114 ms
Iterating global reduction 3 with 101 rules applied. Total rules applied 29422 place count 32334 transition count 34239
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 26967 places in 12 ms
Iterating global reduction 3 with 101 rules applied. Total rules applied 29523 place count 32334 transition count 36764
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 29624 place count 32233 transition count 36158
Deduced a syphon composed of 26866 places in 12 ms
Iterating global reduction 3 with 101 rules applied. Total rules applied 29725 place count 32233 transition count 36158
Deduced a syphon composed of 26866 places in 11 ms
Applied a total of 29725 rules in 27603 ms. Remains 32233 /32658 variables (removed 425) and now considering 36158/36871 (removed 713) transitions.
Running 36057 sub problems to find dead transitions.
// Phase 1: matrix 36158 rows 32233 cols
[2025-06-01 22:25:38] [INFO ] Computed 1015 invariants in 7324 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 179076ms, After SMT, problems are : Problem set: 0 solved, 36057 unsolved
Search for dead transitions found 0 dead transitions in 179184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32233/32658 places, 36158/36871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206870 ms. Remains : 32233/32658 places, 36158/36871 transitions.
Built C files in :
/tmp/ltsmin4754345699020666552
[2025-06-01 22:28:31] [INFO ] Built C files in 495ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4754345699020666552
Running compilation step : cd /tmp/ltsmin4754345699020666552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4754345699020666552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4754345699020666552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1717 out of 32658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32658/32658 places, 36871/36871 transitions.
Applied a total of 0 rules in 196 ms. Remains 32658 /32658 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 32658 cols
[2025-06-01 22:28:37] [INFO ] Computed 1015 invariants in 2943 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:28:55] [INFO ] Implicit Places using invariants in 21572 ms returned []
Implicit Place search using SMT only with invariants took 21584 ms to find 0 implicit places.
Running 36770 sub problems to find dead transitions.
[2025-06-01 22:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 175061ms, After SMT, problems are : Problem set: 0 solved, 36770 unsolved
Search for dead transitions found 0 dead transitions in 175142ms
Finished structural reductions in LTL mode , in 1 iterations and 196970 ms. Remains : 32658/32658 places, 36871/36871 transitions.
Built C files in :
/tmp/ltsmin17905875856746619233
[2025-06-01 22:31:51] [INFO ] Built C files in 541ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17905875856746619233
Running compilation step : cd /tmp/ltsmin17905875856746619233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17905875856746619233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17905875856746619233;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 22:31:56] [INFO ] Flatten gal took : 817 ms
[2025-06-01 22:31:57] [INFO ] Flatten gal took : 832 ms
[2025-06-01 22:31:58] [INFO ] Time to serialize gal into /tmp/LTL11826298007997165246.gal : 260 ms
[2025-06-01 22:31:58] [INFO ] Time to serialize properties into /tmp/LTL14033394930482712471.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11826298007997165246.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12000727422790874407.hoa' '-atoms' '/tmp/LTL14033394930482712471.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14033394930482712471.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12000727422790874407.hoa
Detected timeout of ITS tools.
[2025-06-01 22:32:14] [INFO ] Flatten gal took : 819 ms
[2025-06-01 22:32:15] [INFO ] Flatten gal took : 825 ms
[2025-06-01 22:32:15] [INFO ] Time to serialize gal into /tmp/LTL3738024647320460441.gal : 153 ms
[2025-06-01 22:32:15] [INFO ] Time to serialize properties into /tmp/LTL16393787563651209542.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3738024647320460441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16393787563651209542.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("(((((((((gl1_0_Y+gl1_1_Y)+(gl1_2_Y+gl1_3_Y))+((gl1_4_Y+gl1_5_Y)+(gl1_6_Y+gl1_7_Y)))+(((gl1_8_Y+gl1_9_Y)+(gl1_10_Y+gl1_1...17882
Formula 0 simplified : XXG(!"(((((((((((g3_0_0+g3_1_0)+(g3_2_0+g3_3_0))+((g3_4_0+g3_5_0)+(g3_6_0+g3_7_0)))+(((g3_8_0+g3_9_0)+(g3_10_0+g3_11_0))+((g3_12_0+g...17870
Detected timeout of ITS tools.
[2025-06-01 22:32:31] [INFO ] Flatten gal took : 807 ms
[2025-06-01 22:32:31] [INFO ] Applying decomposition
[2025-06-01 22:32:32] [INFO ] Flatten gal took : 837 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2757769941987597613.txt' '-o' '/tmp/graph2757769941987597613.bin' '-w' '/tmp/graph2757769941987597613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2757769941987597613.bin' '-l' '-1' '-v' '-w' '/tmp/graph2757769941987597613.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:32:37] [INFO ] Decomposing Gal with order
[2025-06-01 22:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:41:46] [INFO ] Removed a total of 11071 redundant transitions.
[2025-06-01 22:41:47] [INFO ] Flatten gal took : 4741 ms
[2025-06-01 22:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1359 labels/synchronizations in 679 ms.
[2025-06-01 22:42:09] [INFO ] Time to serialize gal into /tmp/LTL7810274524286828016.gal : 360 ms
[2025-06-01 22:42:09] [INFO ] Time to serialize properties into /tmp/LTL12311847871637397762.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7810274524286828016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12311847871637397762.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-00 finished in 1430502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 33989 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Graph (complete) has 48705 edges and 33989 vertex of which 27597 are kept as prefixes of interest. Removing 6392 places using SCC suffix rule.40 ms
Discarding 6392 places :
Also discarding 7581 output transitions
Drop transitions (Output transitions of discarded places.) removed 7581 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20093 transitions
Trivial Post-agglo rules discarded 20093 transitions
Performed 20093 trivial Post agglomeration. Transition count delta: 20093
Iterating post reduction 0 with 21204 rules applied. Total rules applied 21205 place count 26385 transition count 9096
Reduce places removed 20093 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 20793 rules applied. Total rules applied 41998 place count 6292 transition count 8396
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 42198 place count 6092 transition count 8396
Performed 1515 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1515 Pre rules applied. Total rules applied 42198 place count 6092 transition count 6881
Deduced a syphon composed of 1515 places in 3 ms
Ensure Unique test removed 606 places
Reduce places removed 2121 places and 0 transitions.
Iterating global reduction 3 with 3636 rules applied. Total rules applied 45834 place count 3971 transition count 6881
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 46440 place count 3971 transition count 6275
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 47046 place count 3365 transition count 6275
Discarding 2630 places :
Symmetric choice reduction at 5 with 2630 rule applications. Total rules 49676 place count 735 transition count 3145
Iterating global reduction 5 with 2630 rules applied. Total rules applied 52306 place count 735 transition count 3145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 9 rules applied. Total rules applied 52315 place count 734 transition count 3137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 52318 place count 731 transition count 3137
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 52318 place count 731 transition count 3036
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 52520 place count 630 transition count 3036
Discarding 110 places :
Symmetric choice reduction at 7 with 110 rule applications. Total rules 52630 place count 520 transition count 1926
Iterating global reduction 7 with 110 rules applied. Total rules applied 52740 place count 520 transition count 1926
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 7 with 1010 rules applied. Total rules applied 53750 place count 520 transition count 916
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 53750 place count 520 transition count 915
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 53752 place count 519 transition count 915
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 8 with 202 rules applied. Total rules applied 53954 place count 418 transition count 814
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 8 with 101 rules applied. Total rules applied 54055 place count 317 transition count 713
Applied a total of 54055 rules in 1671 ms. Remains 317 /33989 variables (removed 33672) and now considering 713/36871 (removed 36158) transitions.
// Phase 1: matrix 713 rows 317 cols
[2025-06-01 22:42:26] [INFO ] Computed 104 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:27] [INFO ] Implicit Places using invariants in 1187 ms returned [0, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 310]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 1192 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 214/33989 places, 713/36871 transitions.
Reduce places removed 101 places and 101 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 13 transition count 12
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 13 transition count 12
Applied a total of 200 rules in 5 ms. Remains 13 /214 variables (removed 201) and now considering 12/713 (removed 701) transitions.
// Phase 1: matrix 12 rows 13 cols
[2025-06-01 22:42:27] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 22:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/33989 places, 12/36871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2918 ms. Remains : 13/33989 places, 12/36871 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01
Product exploration explored 100000 steps with 4628 reset in 251 ms.
Product exploration explored 100000 steps with 4599 reset in 263 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 191 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 412 steps (0 resets) in 4 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 177 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 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2025-06-01 22:42:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:42:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:42:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 22:42:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:42:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:42:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 22:42:29] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 22:42:29] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-01 22:42:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-01 22:42:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:42:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 22:42:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 13/13 places, 12/12 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 174 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 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 412 steps (0 resets) in 4 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 221 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2025-06-01 22:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:42:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:42:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 22:42:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 22:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:42:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 22:42:30] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 22:42:30] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4937 reset in 196 ms.
Product exploration explored 100000 steps with 4909 reset in 604 ms.
Built C files in :
/tmp/ltsmin14128314035684378975
[2025-06-01 22:42:31] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-06-01 22:42:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:42:31] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-06-01 22:42:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:42:31] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-06-01 22:42:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:42:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14128314035684378975
Running compilation step : cd /tmp/ltsmin14128314035684378975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin14128314035684378975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 295 ms.
Running LTSmin : cd /tmp/ltsmin14128314035684378975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12403241934935910060.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-01 22:42:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-01 22:42:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:42:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:42:46] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 22:42:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/25 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 203ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 13/13 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin8611364113147384925
[2025-06-01 22:42:46] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-06-01 22:42:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:42:46] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-06-01 22:42:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:42:46] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-06-01 22:42:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:42:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8611364113147384925
Running compilation step : cd /tmp/ltsmin8611364113147384925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin8611364113147384925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8611364113147384925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased871727027811225570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 22:43:02] [INFO ] Flatten gal took : 2 ms
[2025-06-01 22:43:02] [INFO ] Flatten gal took : 1 ms
[2025-06-01 22:43:02] [INFO ] Time to serialize gal into /tmp/LTL11834918985039236835.gal : 0 ms
[2025-06-01 22:43:02] [INFO ] Time to serialize properties into /tmp/LTL12760534945468713007.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11834918985039236835.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11523392755013486582.hoa' '-atoms' '/tmp/LTL12760534945468713007.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12760534945468713007.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11523392755013486582.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.01341e+08 deadlock states
Detected timeout of ITS tools.
[2025-06-01 22:43:17] [INFO ] Flatten gal took : 1 ms
[2025-06-01 22:43:17] [INFO ] Flatten gal took : 0 ms
[2025-06-01 22:43:17] [INFO ] Time to serialize gal into /tmp/LTL4328441589377964798.gal : 0 ms
[2025-06-01 22:43:17] [INFO ] Time to serialize properties into /tmp/LTL5215671922215233334.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4328441589377964798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5215671922215233334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((p11_0+p11_1)+(p11_2+p11_3))+(p11_4+p11_5))>=1)"))))
Formula 0 simplified : FG!"((((p11_0+p11_1)+(p11_2+p11_3))+(p11_4+p11_5))>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.01341e+08 deadlock states
Detected timeout of ITS tools.
[2025-06-01 22:43:32] [INFO ] Flatten gal took : 0 ms
[2025-06-01 22:43:32] [INFO ] Applying decomposition
[2025-06-01 22:43:32] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8663384746815909683.txt' '-o' '/tmp/graph8663384746815909683.bin' '-w' '/tmp/graph8663384746815909683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8663384746815909683.bin' '-l' '-1' '-v' '-w' '/tmp/graph8663384746815909683.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:43:32] [INFO ] Decomposing Gal with order
[2025-06-01 22:43:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:43:32] [INFO ] Flatten gal took : 2 ms
[2025-06-01 22:43:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 22:43:32] [INFO ] Time to serialize gal into /tmp/LTL1083722427952972515.gal : 0 ms
[2025-06-01 22:43:32] [INFO ] Time to serialize properties into /tmp/LTL10049797041349261387.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1083722427952972515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10049797041349261387.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu1.p11_0+gu1.p11_1)+(gu1.p11_2+gu1.p11_3))+(gu1.p11_4+gu1.p11_5))>=1)"))))
Formula 0 simplified : FG!"((((gu1.p11_0+gu1.p11_1)+(gu1.p11_2+gu1.p11_3))+(gu1.p11_4+gu1.p11_5))>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.01341e+08 deadlock states
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-01 finished in 83247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 1829 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1125 rules applied. Total rules applied 1125 place count 32864 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1327 place count 32662 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1529 place count 32662 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1531 place count 32660 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1533 place count 32660 transition count 36265
Applied a total of 1533 rules in 1014 ms. Remains 32660 /33989 variables (removed 1329) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 32660 cols
[2025-06-01 22:43:51] [INFO ] Computed 1221 invariants in 2308 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:44:17] [INFO ] Implicit Places using invariants in 28871 ms returned [1818, 1819, 10714, 16677, 20830, 20831, 20832, 20833, 20834, 20835, 20836, 20837, 20838, 20839, 20840, 20841, 20842, 20843, 20844, 20845, 20846, 20847, 20848, 20849, 20850, 20851, 20852, 20853, 20854, 20855, 20856, 20857, 20858, 20859, 20860, 20861, 20862, 20863, 20864, 20865, 20866, 20867, 20868, 20869, 20870, 20871, 20872, 20873, 20874, 20875, 20876, 20877, 20878, 20879, 20880, 20881, 20882, 20883, 20884, 20885, 20886, 20887, 20888, 20889, 20890, 20891, 20892, 20893, 20894, 20895, 20896, 20897, 20898, 20899, 20900, 20901, 20902, 20903, 20904, 20905, 20906, 20907, 20908, 20909, 20910, 20911, 20912, 20913, 20914, 20915, 20916, 20917, 20918, 20919, 20920, 20921, 20922, 20923, 20924, 20925, 20926, 20927, 20928, 20929, 20930, 24971]
Discarding 106 places :
Implicit Place search using SMT only with invariants took 28901 ms to find 106 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32554/33989 places, 36265/36871 transitions.
Applied a total of 0 rules in 203 ms. Remains 32554 /32554 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30120 ms. Remains : 32554/33989 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02
Stuttering criterion allowed to conclude after 5784 steps with 0 reset in 296 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-02 finished in 30719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U (p1 U p2)))&&(G(p3)||(p3&&F((!p0 U (p4||G(!p0)))))))))'
Support contains 3434 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 33975 transition count 36871
Applied a total of 14 rules in 350 ms. Remains 33975 /33989 variables (removed 14) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 33975 cols
[2025-06-01 22:44:22] [INFO ] Computed 2332 invariants in 2980 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:44:59] [INFO ] Implicit Places using invariants in 40311 ms returned [1818, 1819, 11825, 19003, 19004, 19005, 19006, 19007, 19008, 19009, 19010, 19011, 19012, 19013, 19014, 19015, 19016, 19017, 19018, 19019, 19020, 19021, 19022, 19023, 19024, 19025, 19026, 19027, 19028, 19029, 19030, 19031, 19032, 19033, 19034, 19035, 19036, 19037, 19038, 19039, 19040, 19041, 19042, 19043, 19044, 19045, 19046, 19047, 19048, 19049, 19050, 19051, 19052, 19053, 19054, 19055, 19056, 19057, 19058, 19059, 19060, 19061, 19062, 19063, 19064, 19065, 19066, 19067, 19068, 19069, 19070, 19071, 19072, 19073, 19074, 19075, 19076, 19077, 19078, 19079, 19080, 19081, 19082, 19083, 19084, 19085, 19086, 19087, 19088, 19089, 19090, 19091, 19092, 19093, 19094, 19095, 19096, 19097, 19098, 19099, 19100, 19101, 19102, 19103, 22145, 22146, 22147, 22148, 22149, 22150, 22151, 22152, 22153, 22154, 22155, 22156, 22157, 22158, 22159, 22160, 22161, 22162, 22163, 22164, 22165, 22166, 22167, 22168, 22169, 22170, 22171, 22172, 22173, 22174, 22175, 22176, 22177, 22178, 22179, 22180, 22181, 22182, 22183, 22184, 22185, 22186, 22187, 22188, 22189, 22190, 22191, 22192, 22193, 22194, 22195, 22196, 22197, 22198, 22199, 22200, 22201, 22202, 22203, 22204, 22205, 22206, 22207, 22208, 22209, 22210, 22211, 22212, 22213, 22214, 22215, 22216, 22217, 22218, 22219, 22220, 22221, 22222, 22223, 22224, 22225, 22226, 22227, 22228, 22229, 22230, 22231, 22232, 22233, 22234, 22235, 22236, 22237, 22238, 22239, 22240, 22241, 22242, 22243, 22244, 22245, 26286]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 40353 ms to find 206 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33769/33989 places, 36871/36871 transitions.
Applied a total of 0 rules in 277 ms. Remains 33769 /33769 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40984 ms. Remains : 33769/33989 places, 36871/36871 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p2), (AND (NOT p3) (NOT p4) p0), (NOT p2), (AND (NOT p4) p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03
Product exploration explored 100000 steps with 81 reset in 4712 ms.
Product exploration explored 100000 steps with 55 reset in 4330 ms.
Computed a total of 33769 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33769 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p3 (NOT p4) p0 p2 p1), (X (NOT p4)), (X p3), (X (AND p3 (NOT p4))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (F (G p3)), (F (G (NOT p4))), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 233 ms. Reduced automaton from 7 states, 14 edges and 5 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 3050 ms. (13 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1350 ms. (29 steps per ms) remains 2/2 properties
// Phase 1: matrix 36871 rows 33769 cols
[2025-06-01 22:45:56] [INFO ] Computed 2126 invariants in 2595 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 28800/70640 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 3/2126 constraints, State Equation: 0/33769 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 12768ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1111 out of 33769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33769/33769 places, 36871/36871 transitions.
Graph (complete) has 47571 edges and 33769 vertex of which 33258 are kept as prefixes of interest. Removing 511 places using SCC suffix rule.21 ms
Discarding 511 places :
Also discarding 511 output transitions
Drop transitions (Output transitions of discarded places.) removed 511 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22018 transitions
Trivial Post-agglo rules discarded 22018 transitions
Performed 22018 trivial Post agglomeration. Transition count delta: 22018
Iterating post reduction 0 with 23432 rules applied. Total rules applied 23433 place count 32147 transition count 14039
Reduce places removed 22018 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 1 with 22220 rules applied. Total rules applied 45653 place count 10129 transition count 13837
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 45855 place count 9927 transition count 13837
Performed 2323 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2323 Pre rules applied. Total rules applied 45855 place count 9927 transition count 11514
Deduced a syphon composed of 2323 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 3232 places and 0 transitions.
Iterating global reduction 3 with 5555 rules applied. Total rules applied 51410 place count 6695 transition count 11514
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 52016 place count 6695 transition count 10908
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 52622 place count 6089 transition count 10908
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 52622 place count 6089 transition count 10807
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 52824 place count 5988 transition count 10807
Discarding 3247 places :
Symmetric choice reduction at 5 with 3247 rule applications. Total rules 56071 place count 2741 transition count 6060
Iterating global reduction 5 with 3247 rules applied. Total rules applied 59318 place count 2741 transition count 6060
Ensure Unique test removed 1515 transitions
Reduce isomorphic transitions removed 1515 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 5 with 1616 rules applied. Total rules applied 60934 place count 2741 transition count 4444
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 61035 place count 2640 transition count 4444
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 303 Pre rules applied. Total rules applied 61035 place count 2640 transition count 4141
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 7 with 606 rules applied. Total rules applied 61641 place count 2337 transition count 4141
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 61646 place count 2332 transition count 3636
Iterating global reduction 7 with 5 rules applied. Total rules applied 61651 place count 2332 transition count 3636
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 606 rules applied. Total rules applied 62257 place count 2332 transition count 3030
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 62358 place count 2231 transition count 3030
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 62560 place count 2130 transition count 2929
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 9 with 202 rules applied. Total rules applied 62762 place count 2130 transition count 2727
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 9 with 303 rules applied. Total rules applied 63065 place count 1827 transition count 2727
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 10 with 101 rules applied. Total rules applied 63166 place count 1726 transition count 2626
Applied a total of 63166 rules in 3174 ms. Remains 1726 /33769 variables (removed 32043) and now considering 2626/36871 (removed 34245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3174 ms. Remains : 1726/33769 places, 2626/36871 transitions.
RANDOM walk for 1250 steps (0 resets) in 56 ms. (21 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p3 (NOT p4) p0 p2 p1), (X (NOT p4)), (X p3), (X (AND p3 (NOT p4))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (F (G p3)), (F (G (NOT p4))), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p4)))), (F (NOT (OR p3 p4))), (F (NOT (AND p3 (NOT p4)))), (F (NOT p3)), (F (NOT (OR p0 p4))), (F p4)]
Knowledge based reduction with 19 factoid took 591 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Support contains 1111 out of 33769 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 33769/33769 places, 36871/36871 transitions.
Applied a total of 0 rules in 259 ms. Remains 33769 /33769 variables (removed 0) and now considering 36871/36871 (removed 0) transitions.
[2025-06-01 22:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:46:35] [INFO ] Implicit Places using invariants in 24289 ms returned []
Implicit Place search using SMT only with invariants took 24310 ms to find 0 implicit places.
Running 36770 sub problems to find dead transitions.
[2025-06-01 22:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 169515ms, After SMT, problems are : Problem set: 0 solved, 36770 unsolved
Search for dead transitions found 0 dead transitions in 169629ms
Finished structural reductions in LTL mode , in 1 iterations and 194253 ms. Remains : 33769/33769 places, 36871/36871 transitions.
Computed a total of 33769 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33769 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p3 (NOT p4) p0), (X (X p3)), (X (X (NOT p4))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (F (G p3)), (F (G (NOT p4))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 261 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 3028 ms. (13 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 978 ms. (40 steps per ms) remains 2/2 properties
[2025-06-01 22:50:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 28800/70640 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 3/2126 constraints, State Equation: 0/33769 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 10162ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1111 out of 33769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33769/33769 places, 36871/36871 transitions.
Graph (complete) has 47571 edges and 33769 vertex of which 33258 are kept as prefixes of interest. Removing 511 places using SCC suffix rule.25 ms
Discarding 511 places :
Also discarding 511 output transitions
Drop transitions (Output transitions of discarded places.) removed 511 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22018 transitions
Trivial Post-agglo rules discarded 22018 transitions
Performed 22018 trivial Post agglomeration. Transition count delta: 22018
Iterating post reduction 0 with 23432 rules applied. Total rules applied 23433 place count 32147 transition count 14039
Reduce places removed 22018 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 1 with 22220 rules applied. Total rules applied 45653 place count 10129 transition count 13837
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 45855 place count 9927 transition count 13837
Performed 2323 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2323 Pre rules applied. Total rules applied 45855 place count 9927 transition count 11514
Deduced a syphon composed of 2323 places in 6 ms
Ensure Unique test removed 909 places
Reduce places removed 3232 places and 0 transitions.
Iterating global reduction 3 with 5555 rules applied. Total rules applied 51410 place count 6695 transition count 11514
Drop transitions (Trivial Post-Agglo cleanup.) removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 52016 place count 6695 transition count 10908
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 52622 place count 6089 transition count 10908
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 52622 place count 6089 transition count 10807
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 52824 place count 5988 transition count 10807
Discarding 3247 places :
Symmetric choice reduction at 5 with 3247 rule applications. Total rules 56071 place count 2741 transition count 6060
Iterating global reduction 5 with 3247 rules applied. Total rules applied 59318 place count 2741 transition count 6060
Ensure Unique test removed 1515 transitions
Reduce isomorphic transitions removed 1515 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 5 with 1616 rules applied. Total rules applied 60934 place count 2741 transition count 4444
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 61035 place count 2640 transition count 4444
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 303 Pre rules applied. Total rules applied 61035 place count 2640 transition count 4141
Deduced a syphon composed of 303 places in 2 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 7 with 606 rules applied. Total rules applied 61641 place count 2337 transition count 4141
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 61646 place count 2332 transition count 3636
Iterating global reduction 7 with 5 rules applied. Total rules applied 61651 place count 2332 transition count 3636
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 606 rules applied. Total rules applied 62257 place count 2332 transition count 3030
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 62358 place count 2231 transition count 3030
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 62560 place count 2130 transition count 2929
Free-agglomeration rule (complex) applied 202 times.
Iterating global reduction 9 with 202 rules applied. Total rules applied 62762 place count 2130 transition count 2727
Ensure Unique test removed 101 places
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 9 with 303 rules applied. Total rules applied 63065 place count 1827 transition count 2727
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 10 with 101 rules applied. Total rules applied 63166 place count 1726 transition count 2626
Applied a total of 63166 rules in 2819 ms. Remains 1726 /33769 variables (removed 32043) and now considering 2626/36871 (removed 34245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2819 ms. Remains : 1726/33769 places, 2626/36871 transitions.
RANDOM walk for 1247 steps (0 resets) in 49 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p3 (NOT p4) p0), (X (X p3)), (X (X (NOT p4))), (X (X (AND p3 (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (F (G p3)), (F (G (NOT p4))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p4)))), (F (NOT (OR p3 p4))), (F (NOT (AND p3 (NOT p4)))), (F (NOT p3)), (F (NOT (OR p0 p4))), (F p4)]
Knowledge based reduction with 8 factoid took 998 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Product exploration explored 100000 steps with 33 reset in 4880 ms.
Product exploration explored 100000 steps with 34 reset in 4766 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p3) (NOT p4) p0), (AND (NOT p4) p0)]
Support contains 1111 out of 33769 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33769/33769 places, 36871/36871 transitions.
Graph (complete) has 47571 edges and 33769 vertex of which 33258 are kept as prefixes of interest. Removing 511 places using SCC suffix rule.419 ms
Discarding 511 places :
Also discarding 511 output transitions
Drop transitions (Output transitions of discarded places.) removed 511 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Performed 13736 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15150 rules applied. Total rules applied 15151 place count 32147 transition count 36057
Performed 7474 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7474 Pre rules applied. Total rules applied 15151 place count 32147 transition count 36764
Deduced a syphon composed of 21210 places in 287 ms
Iterating global reduction 1 with 7474 rules applied. Total rules applied 22625 place count 32147 transition count 36764
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22630 place count 32142 transition count 36259
Deduced a syphon composed of 21210 places in 26 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 22635 place count 32142 transition count 36259
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 22635 place count 32142 transition count 36259
Deduced a syphon composed of 21311 places in 27 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 22736 place count 32142 transition count 36259
Performed 4242 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 25553 places in 19 ms
Iterating global reduction 1 with 4242 rules applied. Total rules applied 26978 place count 32142 transition count 37269
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 26988 place count 32132 transition count 36259
Deduced a syphon composed of 25553 places in 17 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 26998 place count 32132 transition count 36259
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 25654 places in 25 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 27099 place count 32132 transition count 38784
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 27200 place count 32031 transition count 38178
Deduced a syphon composed of 25553 places in 23 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 27301 place count 32031 transition count 38178
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 25654 places in 16 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 27402 place count 32031 transition count 39188
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 27503 place count 31930 transition count 38582
Deduced a syphon composed of 25553 places in 15 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 27604 place count 31930 transition count 38582
Deduced a syphon composed of 25553 places in 15 ms
Applied a total of 27604 rules in 29434 ms. Remains 31930 /33769 variables (removed 1839) and now considering 38582/36871 (removed -1711) transitions.
Running 37471 sub problems to find dead transitions.
// Phase 1: matrix 38582 rows 31930 cols
[2025-06-01 22:51:21] [INFO ] Computed 1015 invariants in 11286 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 198831ms, After SMT, problems are : Problem set: 0 solved, 37471 unsolved
Search for dead transitions found 0 dead transitions in 199221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31930/33769 places, 38582/36871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228810 ms. Remains : 31930/33769 places, 38582/36871 transitions.
Built C files in :
/tmp/ltsmin2844813660182343227
[2025-06-01 22:54:30] [INFO ] Built C files in 577ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2844813660182343227
Running compilation step : cd /tmp/ltsmin2844813660182343227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2844813660182343227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2844813660182343227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1111 out of 33769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33769/33769 places, 36871/36871 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 32658 transition count 36871
Applied a total of 1111 rules in 2247 ms. Remains 32658 /33769 variables (removed 1111) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 32658 cols
[2025-06-01 22:54:38] [INFO ] Computed 1015 invariants in 2815 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:54:59] [INFO ] Implicit Places using invariants in 23872 ms returned []
Implicit Place search using SMT only with invariants took 23879 ms to find 0 implicit places.
Running 36770 sub problems to find dead transitions.
[2025-06-01 22:54:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 171078ms, After SMT, problems are : Problem set: 0 solved, 36770 unsolved
Search for dead transitions found 0 dead transitions in 171307ms
Starting structural reductions in LTL mode, iteration 1 : 32658/33769 places, 36871/36871 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197649 ms. Remains : 32658/33769 places, 36871/36871 transitions.
Built C files in :
/tmp/ltsmin4514901297256844858
[2025-06-01 22:57:51] [INFO ] Built C files in 466ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4514901297256844858
Running compilation step : cd /tmp/ltsmin4514901297256844858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4514901297256844858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4514901297256844858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 22:57:58] [INFO ] Flatten gal took : 1908 ms
[2025-06-01 22:57:59] [INFO ] Flatten gal took : 961 ms
[2025-06-01 22:57:59] [INFO ] Time to serialize gal into /tmp/LTL6362633458342121471.gal : 450 ms
[2025-06-01 22:57:59] [INFO ] Time to serialize properties into /tmp/LTL16744216163397991335.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6362633458342121471.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17815901955029963130.hoa' '-atoms' '/tmp/LTL16744216163397991335.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16744216163397991335.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17815901955029963130.hoa
Detected timeout of ITS tools.
[2025-06-01 22:58:16] [INFO ] Flatten gal took : 813 ms
[2025-06-01 22:58:17] [INFO ] Flatten gal took : 826 ms
[2025-06-01 22:58:18] [INFO ] Time to serialize gal into /tmp/LTL11083768199597552677.gal : 149 ms
[2025-06-01 22:58:18] [INFO ] Time to serialize properties into /tmp/LTL6057902028780322881.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11083768199597552677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6057902028780322881.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(("((((((((l15_0+l15_1)+(l15_2+l15_3))+((l15_4+l15_5)+(l15_6+l15_7)))+(((l15_8+l15_9)+(l15_10+l15_11))+((l15_12+l15_13)+(l15_14...61180
Formula 0 simplified : X(X(!"((((((((l15_0+l15_1)+(l15_2+l15_3))+((l15_4+l15_5)+(l15_6+l15_7)))+(((l15_8+l15_9)+(l15_10+l15_11))+((l15_12+l15_13)+(l15_14+l...53653
Detected timeout of ITS tools.
[2025-06-01 22:58:34] [INFO ] Flatten gal took : 1012 ms
[2025-06-01 22:58:34] [INFO ] Applying decomposition
[2025-06-01 22:58:35] [INFO ] Flatten gal took : 907 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15855608988141577691.txt' '-o' '/tmp/graph15855608988141577691.bin' '-w' '/tmp/graph15855608988141577691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15855608988141577691.bin' '-l' '-1' '-v' '-w' '/tmp/graph15855608988141577691.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:58:50] [INFO ] Decomposing Gal with order
[2025-06-01 22:59:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:06:07] [INFO ] Removed a total of 8001 redundant transitions.
[2025-06-01 23:06:08] [INFO ] Flatten gal took : 18636 ms
[2025-06-01 23:06:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 518 ms.
[2025-06-01 23:06:20] [INFO ] Time to serialize gal into /tmp/LTL18031856722073264511.gal : 214 ms
[2025-06-01 23:06:20] [INFO ] Time to serialize properties into /tmp/LTL4297492611792645418.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18031856722073264511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4297492611792645418.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-03 finished in 1336759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0))))&&G((X(G(p1))||F(p2)))))'
Support contains 219 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 8 places and 0 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1119 rules applied. Total rules applied 1119 place count 32870 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1321 place count 32668 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1523 place count 32668 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1525 place count 32666 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1527 place count 32666 transition count 36265
Applied a total of 1527 rules in 903 ms. Remains 32666 /33989 variables (removed 1323) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 32666 cols
[2025-06-01 23:06:39] [INFO ] Computed 1222 invariants in 3464 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:18] [INFO ] Implicit Places using invariants in 41852 ms returned [1818, 1819, 10714, 16677, 17890, 17891, 17892, 17893, 17894, 17895, 17896, 17897, 17898, 17899, 17900, 17901, 17902, 17903, 17904, 17905, 17906, 17907, 17908, 17909, 17910, 17911, 17912, 17913, 17914, 17915, 17916, 17917, 17918, 17919, 17920, 17921, 17922, 17923, 17924, 17925, 17926, 17927, 17928, 17929, 17930, 17931, 17932, 17933, 17934, 17935, 17936, 17937, 17938, 17939, 17940, 17941, 17942, 17943, 17944, 17945, 17946, 17947, 17948, 17949, 17950, 17951, 17952, 17953, 17954, 17955, 17956, 17957, 17958, 17959, 17960, 17961, 17962, 17963, 17964, 17965, 17966, 17967, 17968, 17969, 17970, 17971, 17972, 17973, 17974, 17975, 17976, 17977, 17978, 17979, 17980, 17981, 17982, 17983, 17984, 17985, 17986, 17987, 17988, 17989, 17990, 20830, 20831, 20832, 20833, 20834, 20835, 20836, 20837, 20838, 20839, 20840, 20841, 20842, 20843, 20844, 20845, 20846, 20847, 20848, 20849, 20850, 20851, 20852, 20853, 20854, 20855, 20856, 20857, 20858, 20859, 20860, 20861, 20862, 20863, 20864, 20865, 20866, 20867, 20868, 20869, 20870, 20871, 20872, 20873, 20874, 20875, 20876, 20877, 20878, 20879, 20880, 20881, 20882, 20883, 20884, 20885, 20886, 20887, 20888, 20889, 20890, 20891, 20892, 20893, 20894, 20895, 20896, 20897, 20898, 20899, 20900, 20901, 20902, 20903, 20904, 20905, 20906, 20907, 20908, 20909, 20910, 20911, 20912, 20913, 20914, 20915, 20916, 20917, 20918, 20919, 20920, 20921, 20922, 20923, 20924, 20925, 20926, 20927, 20928, 20929, 20930, 24971]
Discarding 207 places :
Implicit Place search using SMT only with invariants took 41879 ms to find 207 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32459/33989 places, 36265/36871 transitions.
Applied a total of 0 rules in 214 ms. Remains 32459 /32459 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43001 ms. Remains : 32459/33989 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true, (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 12 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-04 finished in 43594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(!p0)||(p0&&G(p2)))))'
Support contains 4 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1125 rules applied. Total rules applied 1125 place count 32864 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1327 place count 32662 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1529 place count 32662 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1531 place count 32660 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1533 place count 32660 transition count 36265
Applied a total of 1533 rules in 1108 ms. Remains 32660 /33989 variables (removed 1329) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 32660 cols
[2025-06-01 23:07:22] [INFO ] Computed 1221 invariants in 2316 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:07:49] [INFO ] Implicit Places using invariants in 29041 ms returned [1818, 1819, 10714, 16677, 17890, 17891, 17892, 17893, 17894, 17895, 17896, 17897, 17898, 17899, 17900, 17901, 17902, 17903, 17904, 17905, 17906, 17907, 17908, 17909, 17910, 17911, 17912, 17913, 17914, 17915, 17916, 17917, 17918, 17919, 17920, 17921, 17922, 17923, 17924, 17925, 17926, 17927, 17928, 17929, 17930, 17931, 17932, 17933, 17934, 17935, 17936, 17937, 17938, 17939, 17940, 17941, 17942, 17943, 17944, 17945, 17946, 17947, 17948, 17949, 17950, 17951, 17952, 17953, 17954, 17955, 17956, 17957, 17958, 17959, 17960, 17961, 17962, 17963, 17964, 17965, 17966, 17967, 17968, 17969, 17970, 17971, 17972, 17973, 17974, 17975, 17976, 17977, 17978, 17979, 17980, 17981, 17982, 17983, 17984, 17985, 17986, 17987, 17988, 17989, 17990, 20830, 20831, 20832, 20833, 20834, 20835, 20836, 20837, 20838, 20839, 20840, 20841, 20842, 20843, 20844, 20845, 20846, 20847, 20848, 20849, 20850, 20851, 20852, 20853, 20854, 20855, 20856, 20857, 20858, 20859, 20860, 20861, 20862, 20863, 20864, 20865, 20866, 20867, 20868, 20869, 20870, 20871, 20872, 20873, 20874, 20875, 20876, 20877, 20878, 20879, 20880, 20881, 20882, 20883, 20884, 20885, 20886, 20887, 20888, 20889, 20890, 20891, 20892, 20893, 20894, 20895, 20896, 20897, 20898, 20899, 20900, 20901, 20902, 20903, 20904, 20905, 20906, 20907, 20908, 20909, 20910, 20911, 20912, 20913, 20914, 20915, 20916, 20917, 20918, 20919, 20920, 20921, 20922, 20923, 20924, 20925, 20926, 20927, 20928, 20929, 20930]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 29067 ms to find 206 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32454/33989 places, 36265/36871 transitions.
Applied a total of 0 rules in 199 ms. Remains 32454 /32454 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30378 ms. Remains : 32454/33989 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p1), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10
Product exploration timeout after 90410 steps with 45205 reset in 10001 ms.
Product exploration timeout after 98860 steps with 49430 reset in 10001 ms.
Computed a total of 32454 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32454 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 47 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-10 finished in 92180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 13 places and 0 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1124 rules applied. Total rules applied 1124 place count 32865 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1326 place count 32663 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1528 place count 32663 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1530 place count 32661 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1532 place count 32661 transition count 36265
Applied a total of 1532 rules in 991 ms. Remains 32661 /33989 variables (removed 1328) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 32661 cols
[2025-06-01 23:08:54] [INFO ] Computed 1222 invariants in 2618 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:09:24] [INFO ] Implicit Places using invariants in 32664 ms returned [1819, 10714, 16677, 17890, 17891, 17892, 17893, 17894, 17895, 17896, 17897, 17898, 17899, 17900, 17901, 17902, 17903, 17904, 17905, 17906, 17907, 17908, 17909, 17910, 17911, 17912, 17913, 17914, 17915, 17916, 17917, 17918, 17919, 17920, 17921, 17922, 17923, 17924, 17925, 17926, 17927, 17928, 17929, 17930, 17931, 17932, 17933, 17934, 17935, 17936, 17937, 17938, 17939, 17940, 17941, 17942, 17943, 17944, 17945, 17946, 17947, 17948, 17949, 17950, 17951, 17952, 17953, 17954, 17955, 17956, 17957, 17958, 17959, 17960, 17961, 17962, 17963, 17964, 17965, 17966, 17967, 17968, 17969, 17970, 17971, 17972, 17973, 17974, 17975, 17976, 17977, 17978, 17979, 17980, 17981, 17982, 17983, 17984, 17985, 17986, 17987, 17988, 17989, 17990, 20830, 20831, 20832, 20833, 20834, 20835, 20836, 20837, 20838, 20839, 20840, 20841, 20842, 20843, 20844, 20845, 20846, 20847, 20848, 20849, 20850, 20851, 20852, 20853, 20854, 20855, 20856, 20857, 20858, 20859, 20860, 20861, 20862, 20863, 20864, 20865, 20866, 20867, 20868, 20869, 20870, 20871, 20872, 20873, 20874, 20875, 20876, 20877, 20878, 20879, 20880, 20881, 20882, 20883, 20884, 20885, 20886, 20887, 20888, 20889, 20890, 20891, 20892, 20893, 20894, 20895, 20896, 20897, 20898, 20899, 20900, 20901, 20902, 20903, 20904, 20905, 20906, 20907, 20908, 20909, 20910, 20911, 20912, 20913, 20914, 20915, 20916, 20917, 20918, 20919, 20920, 20921, 20922, 20923, 20924, 20925, 20926, 20927, 20928, 20929, 20930, 24972]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 32692 ms to find 206 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32455/33989 places, 36265/36871 transitions.
Applied a total of 0 rules in 202 ms. Remains 32455 /32455 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33886 ms. Remains : 32455/33989 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11
Product exploration timeout after 97130 steps with 48565 reset in 10001 ms.
Product exploration explored 100000 steps with 50000 reset in 9487 ms.
Computed a total of 32455 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32455 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 finished in 87528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p0)))||G(p1)))))'
Support contains 4 out of 33989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33989/33989 places, 36871/36871 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1125 rules applied. Total rules applied 1125 place count 32864 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1327 place count 32662 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1529 place count 32662 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1531 place count 32660 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1533 place count 32660 transition count 36265
Applied a total of 1533 rules in 2056 ms. Remains 32660 /33989 variables (removed 1329) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 32660 cols
[2025-06-01 23:10:23] [INFO ] Computed 1221 invariants in 2795 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:10:56] [INFO ] Implicit Places using invariants in 35956 ms returned [1818, 1819, 10714, 16677, 17890, 17891, 17892, 17893, 17894, 17895, 17896, 17897, 17898, 17899, 17900, 17901, 17902, 17903, 17904, 17905, 17906, 17907, 17908, 17909, 17910, 17911, 17912, 17913, 17914, 17915, 17916, 17917, 17918, 17919, 17920, 17921, 17922, 17923, 17924, 17925, 17926, 17927, 17928, 17929, 17930, 17931, 17932, 17933, 17934, 17935, 17936, 17937, 17938, 17939, 17940, 17941, 17942, 17943, 17944, 17945, 17946, 17947, 17948, 17949, 17950, 17951, 17952, 17953, 17954, 17955, 17956, 17957, 17958, 17959, 17960, 17961, 17962, 17963, 17964, 17965, 17966, 17967, 17968, 17969, 17970, 17971, 17972, 17973, 17974, 17975, 17976, 17977, 17978, 17979, 17980, 17981, 17982, 17983, 17984, 17985, 17986, 17987, 17988, 17989, 17990, 20830, 20831, 20832, 20833, 20834, 20835, 20836, 20837, 20838, 20839, 20840, 20841, 20842, 20843, 20844, 20845, 20846, 20847, 20848, 20849, 20850, 20851, 20853, 20854, 20855, 20856, 20857, 20858, 20859, 20860, 20861, 20862, 20863, 20864, 20865, 20866, 20867, 20868, 20869, 20870, 20871, 20872, 20873, 20874, 20875, 20876, 20877, 20878, 20879, 20880, 20881, 20882, 20883, 20884, 20885, 20886, 20887, 20888, 20889, 20890, 20891, 20892, 20893, 20894, 20895, 20896, 20897, 20898, 20899, 20900, 20901, 20902, 20903, 20904, 20905, 20906, 20907, 20908, 20909, 20910, 20911, 20912, 20913, 20914, 20915, 20916, 20917, 20918, 20919, 20920, 20921, 20922, 20923, 20924, 20925, 20926, 20927, 20928, 20929, 20930, 24971]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 36021 ms to find 206 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32454/33989 places, 36265/36871 transitions.
Applied a total of 0 rules in 453 ms. Remains 32454 /32454 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38533 ms. Remains : 32454/33989 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-13
Product exploration explored 100000 steps with 16649 reset in 5670 ms.
Product exploration explored 100000 steps with 16698 reset in 5216 ms.
Computed a total of 32454 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32454 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (8 resets) in 3654 ms. (10 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 1/1 properties
// Phase 1: matrix 36265 rows 32454 cols
[2025-06-01 23:11:48] [INFO ] Computed 1015 invariants in 2383 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 28503/68719 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 6/1015 constraints, State Equation: 0/32454 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 12539ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 32454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32454/32454 places, 36265/36265 transitions.
Graph (complete) has 44139 edges and 32454 vertex of which 16142 are kept as prefixes of interest. Removing 16312 places using SCC suffix rule.79 ms
Discarding 16312 places :
Also discarding 18110 output transitions
Drop transitions (Output transitions of discarded places.) removed 18110 transitions
Drop transitions (Empty/Sink Transition effects.) removed 995 transitions
Reduce isomorphic transitions removed 995 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14494 transitions
Trivial Post-agglo rules discarded 14494 transitions
Performed 14494 trivial Post agglomeration. Transition count delta: 14494
Iterating post reduction 0 with 15489 rules applied. Total rules applied 15490 place count 16142 transition count 2666
Reduce places removed 14494 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14497 rules applied. Total rules applied 29987 place count 1648 transition count 2663
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29990 place count 1645 transition count 2663
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 303 Pre rules applied. Total rules applied 29990 place count 1645 transition count 2360
Deduced a syphon composed of 303 places in 2 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 3 with 606 rules applied. Total rules applied 30596 place count 1342 transition count 2360
Discarding 1118 places :
Symmetric choice reduction at 3 with 1118 rule applications. Total rules 31714 place count 224 transition count 1242
Iterating global reduction 3 with 1118 rules applied. Total rules applied 32832 place count 224 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32832 place count 224 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32834 place count 223 transition count 1241
Discarding 107 places :
Symmetric choice reduction at 3 with 107 rule applications. Total rules 32941 place count 116 transition count 1125
Iterating global reduction 3 with 107 rules applied. Total rules applied 33048 place count 116 transition count 1125
Ensure Unique test removed 909 transitions
Reduce isomorphic transitions removed 909 transitions.
Iterating post reduction 3 with 909 rules applied. Total rules applied 33957 place count 116 transition count 216
Discarding 97 places :
Symmetric choice reduction at 4 with 97 rule applications. Total rules 34054 place count 19 transition count 22
Iterating global reduction 4 with 97 rules applied. Total rules applied 34151 place count 19 transition count 22
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 34154 place count 19 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 34157 place count 16 transition count 19
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 34160 place count 16 transition count 19
Applied a total of 34160 rules in 1538 ms. Remains 16 /32454 variables (removed 32438) and now considering 19/36265 (removed 36246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1538 ms. Remains : 16/32454 places, 19/36265 transitions.
RANDOM walk for 4219 steps (23 resets) in 9 ms. (421 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 4 out of 32454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32454/32454 places, 36265/36265 transitions.
Applied a total of 0 rules in 228 ms. Remains 32454 /32454 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
[2025-06-01 23:12:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 23:12:22] [INFO ] Implicit Places using invariants in 20896 ms returned []
Implicit Place search using SMT only with invariants took 20907 ms to find 0 implicit places.
Running 36164 sub problems to find dead transitions.
[2025-06-01 23:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 176057ms, After SMT, problems are : Problem set: 0 solved, 36164 unsolved
Search for dead transitions found 0 dead transitions in 176160ms
Finished structural reductions in LTL mode , in 1 iterations and 197347 ms. Remains : 32454/32454 places, 36265/36265 transitions.
Computed a total of 32454 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32454 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102100219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00100M0010C005P005G002.tgz
mv FamilyReunion-PT-L00100M0010C005P005G002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;