Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422500333.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-PT-000500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422500333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 444K Apr 13 10:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 13 10:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 325K Apr 13 09:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 13 09:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 225K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 865K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 186K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 885K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 746K Apr 13 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 778K Apr 13 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.9M Apr 13 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 132K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000500-LTLFireability-00
FORMULA_NAME Philosophers-PT-000500-LTLFireability-01
FORMULA_NAME Philosophers-PT-000500-LTLFireability-02
FORMULA_NAME Philosophers-PT-000500-LTLFireability-03
FORMULA_NAME Philosophers-PT-000500-LTLFireability-04
FORMULA_NAME Philosophers-PT-000500-LTLFireability-05
FORMULA_NAME Philosophers-PT-000500-LTLFireability-06
FORMULA_NAME Philosophers-PT-000500-LTLFireability-07
FORMULA_NAME Philosophers-PT-000500-LTLFireability-08
FORMULA_NAME Philosophers-PT-000500-LTLFireability-09
FORMULA_NAME Philosophers-PT-000500-LTLFireability-10
FORMULA_NAME Philosophers-PT-000500-LTLFireability-11
FORMULA_NAME Philosophers-PT-000500-LTLFireability-12
FORMULA_NAME Philosophers-PT-000500-LTLFireability-13
FORMULA_NAME Philosophers-PT-000500-LTLFireability-14
FORMULA_NAME Philosophers-PT-000500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717003883860

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000500
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 17:31:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:31:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:31:27] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2024-05-29 17:31:27] [INFO ] Transformed 2500 places.
[2024-05-29 17:31:27] [INFO ] Transformed 2500 transitions.
[2024-05-29 17:31:27] [INFO ] Found NUPN structural information;
[2024-05-29 17:31:27] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 74 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-PT-000500-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 46 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:31:28] [INFO ] Computed 1000 invariants in 64 ms
[2024-05-29 17:31:29] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2024-05-29 17:31:29] [INFO ] Invariant cache hit.
[2024-05-29 17:31:29] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-05-29 17:31:30] [INFO ] Invariant cache hit.
[2024-05-29 17:31:30] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2800 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2024-05-29 17:31:31] [INFO ] Flatten gal took : 456 ms
[2024-05-29 17:31:32] [INFO ] Flatten gal took : 240 ms
[2024-05-29 17:31:33] [INFO ] Input system was already deterministic with 2500 transitions.
Support contains 2001 out of 2500 places (down from 2500) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1368 ms. (steps per millisecond=7 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1110 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1362 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 17:31:40] [INFO ] Invariant cache hit.
[2024-05-29 17:31:44] [INFO ] After 1292ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-29 17:31:45] [INFO ] [Nat]Absence check using 1000 positive place invariants in 343 ms returned sat
[2024-05-29 17:31:52] [INFO ] After 4865ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-29 17:31:55] [INFO ] After 7760ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2338 ms.
[2024-05-29 17:31:57] [INFO ] After 12934ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 316 steps, including 0 resets, run visited all 2 properties in 34 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 144 ms.
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 346 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1304 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 109580 steps, run timeout after 3004 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109580 steps, saw 109448 distinct states, run finished after 3010 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:32:02] [INFO ] Invariant cache hit.
[2024-05-29 17:32:04] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:32:05] [INFO ] [Nat]Absence check using 1000 positive place invariants in 329 ms returned sat
[2024-05-29 17:32:08] [INFO ] After 2372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:32:08] [INFO ] After 3204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 638 ms.
[2024-05-29 17:32:09] [INFO ] After 5250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 302 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 23 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0) U X(!p1))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 80 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:32:10] [INFO ] Invariant cache hit.
[2024-05-29 17:32:12] [INFO ] Implicit Places using invariants in 1836 ms returned []
[2024-05-29 17:32:12] [INFO ] Invariant cache hit.
[2024-05-29 17:32:12] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 2726 ms to find 0 implicit places.
[2024-05-29 17:32:12] [INFO ] Invariant cache hit.
[2024-05-29 17:32:13] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3618 ms. Remains : 2500/2500 places, 2500/2500 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 523 ms :[p1, p1, (AND p0 p1), p0]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s399 1) (EQ s842 1)) (AND (EQ s242 1) (EQ s706 1)) (AND (EQ s137 1) (EQ s600 1)) (AND (EQ s298 1) (EQ s792 1)) (AND (EQ s421 1) (EQ s923 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10097 reset in 6339 ms.
Stack based approach found an accepted trace after 29837 steps with 3818 reset with depth 3570 and stack size 3570 in 2514 ms.
FORMULA Philosophers-PT-000500-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-00 finished in 13147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&F(p1))||(F(p2)&&G(p1)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 124 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:32:23] [INFO ] Invariant cache hit.
[2024-05-29 17:32:24] [INFO ] Implicit Places using invariants in 844 ms returned []
[2024-05-29 17:32:24] [INFO ] Invariant cache hit.
[2024-05-29 17:32:26] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2791 ms to find 0 implicit places.
[2024-05-29 17:32:26] [INFO ] Redundant transitions in 290 ms returned []
[2024-05-29 17:32:26] [INFO ] Invariant cache hit.
[2024-05-29 17:32:27] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4109 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s79 1) (EQ s616 1)) (AND (EQ s375 1) (EQ s847 1)) (AND (EQ s287 1) (EQ s784 1)) (AND (EQ s168 1) (EQ s693 1)) (AND (EQ s456 1) (EQ s1007 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration timeout after 68850 steps with 1235 reset in 10001 ms.
Product exploration timeout after 53590 steps with 1319 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 14 factoid took 457 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 5 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p2), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1182 ms. (steps per millisecond=8 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1630 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1856 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1786 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1569 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 17:33:16] [INFO ] Invariant cache hit.
[2024-05-29 17:33:19] [INFO ] After 1198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 17:33:21] [INFO ] [Nat]Absence check using 1000 positive place invariants in 376 ms returned sat
[2024-05-29 17:33:35] [INFO ] After 9734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 17:33:42] [INFO ] After 16684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2538 ms.
[2024-05-29 17:33:44] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 315 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=13 )
Parikh walk visited 4 properties in 122 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 14 factoid took 982 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000500-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000500-LTLFireability-01 finished in 82721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 137 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:33:46] [INFO ] Invariant cache hit.
[2024-05-29 17:33:47] [INFO ] Implicit Places using invariants in 1934 ms returned []
[2024-05-29 17:33:47] [INFO ] Invariant cache hit.
[2024-05-29 17:33:48] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2024-05-29 17:33:48] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-29 17:33:48] [INFO ] Invariant cache hit.
[2024-05-29 17:33:49] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3841 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s79 0) (EQ s616 0)) (OR (EQ s375 0) (EQ s847 0)) (OR (EQ s287 0) (EQ s784 0)) (OR (EQ s168 0) (EQ s693 0)) (OR (EQ s456 0) (EQ s1007 0)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 2993 ms.
Stack based approach found an accepted trace after 9278 steps with 0 reset with depth 9279 and stack size 9279 in 360 ms.
FORMULA Philosophers-PT-000500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-02 finished in 7396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1)&&(G(p0)||X(F(p2))))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 19 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:33:53] [INFO ] Invariant cache hit.
[2024-05-29 17:33:54] [INFO ] Implicit Places using invariants in 1234 ms returned []
[2024-05-29 17:33:54] [INFO ] Invariant cache hit.
[2024-05-29 17:33:55] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
[2024-05-29 17:33:55] [INFO ] Invariant cache hit.
[2024-05-29 17:33:59] [INFO ] Dead Transitions using invariants and state equation in 3396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5784 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s79 1) (EQ s616 1)) (AND (EQ s375 1) (EQ s847 1)) (AND (EQ s287 1) (EQ s784 1)) (AND (EQ s168 1) (EQ s693 1)) (AND (EQ s456 1) (EQ s1007 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 3416 ms.
Product exploration explored 100000 steps with 17 reset in 3799 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 642 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1551 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:34:40] [INFO ] Invariant cache hit.
[2024-05-29 17:34:42] [INFO ] After 837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:34:42] [INFO ] [Nat]Absence check using 1000 positive place invariants in 303 ms returned sat
[2024-05-29 17:34:47] [INFO ] After 3005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:34:48] [INFO ] After 4951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1287 ms.
[2024-05-29 17:34:50] [INFO ] After 8232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 295 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 1175 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-29 17:34:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 31 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:35:09] [INFO ] Invariant cache hit.
[2024-05-29 17:35:09] [INFO ] Implicit Places using invariants in 951 ms returned []
[2024-05-29 17:35:09] [INFO ] Invariant cache hit.
[2024-05-29 17:35:10] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
[2024-05-29 17:35:10] [INFO ] Invariant cache hit.
[2024-05-29 17:35:13] [INFO ] Dead Transitions using invariants and state equation in 3016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4746 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 691 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1618 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:35:55] [INFO ] Invariant cache hit.
[2024-05-29 17:35:57] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:35:57] [INFO ] [Nat]Absence check using 1000 positive place invariants in 306 ms returned sat
[2024-05-29 17:36:01] [INFO ] After 2956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:36:03] [INFO ] After 4683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1274 ms.
[2024-05-29 17:36:04] [INFO ] After 7548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 295 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 27 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 1012 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-29 17:36:07] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 10 reset in 4273 ms.
Product exploration explored 100000 steps with 10 reset in 3851 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 175 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:36:32] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-29 17:36:32] [INFO ] Invariant cache hit.
[2024-05-29 17:36:32] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin7975585714503178209
[2024-05-29 17:36:32] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7975585714503178209
Running compilation step : cd /tmp/ltsmin7975585714503178209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7975585714503178209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7975585714503178209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 26 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:36:35] [INFO ] Invariant cache hit.
[2024-05-29 17:36:36] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-29 17:36:36] [INFO ] Invariant cache hit.
[2024-05-29 17:36:37] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2024-05-29 17:36:37] [INFO ] Invariant cache hit.
[2024-05-29 17:36:38] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2671 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin7009745654594240181
[2024-05-29 17:36:38] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7009745654594240181
Running compilation step : cd /tmp/ltsmin7009745654594240181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7009745654594240181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7009745654594240181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 17:36:42] [INFO ] Flatten gal took : 143 ms
[2024-05-29 17:36:42] [INFO ] Flatten gal took : 137 ms
[2024-05-29 17:36:42] [INFO ] Time to serialize gal into /tmp/LTL13017000143933906945.gal : 34 ms
[2024-05-29 17:36:42] [INFO ] Time to serialize properties into /tmp/LTL11301020587422523910.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13017000143933906945.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11804951853057380876.hoa' '-atoms' '/tmp/LTL11301020587422523910.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11301020587422523910.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11804951853057380876.hoa
Detected timeout of ITS tools.
[2024-05-29 17:36:57] [INFO ] Flatten gal took : 115 ms
[2024-05-29 17:36:57] [INFO ] Flatten gal took : 124 ms
[2024-05-29 17:36:57] [INFO ] Time to serialize gal into /tmp/LTL5714506862821633798.gal : 25 ms
[2024-05-29 17:36:57] [INFO ] Time to serialize properties into /tmp/LTL8276298633308850118.ltl : 27 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5714506862821633798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8276298633308850118.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((((((((((Fork_234==1)&&(Catch1_234==1))||((Fork_380==1)&&(Catch1_380==1)))||(((Fork_412==1)&&(Catch1_412==1))||((Fork_144=...60295
Formula 0 simplified : G(!"(((((((((((Think_85==1)&&(Fork_85==1))||((Think_364==1)&&(Fork_364==1)))||(((Think_305==1)&&(Fork_305==1))||((Think_158==1)&&(Fo...60281
Detected timeout of ITS tools.
[2024-05-29 17:37:13] [INFO ] Flatten gal took : 97 ms
[2024-05-29 17:37:13] [INFO ] Applying decomposition
[2024-05-29 17:37:13] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3041345590375499870.txt' '-o' '/tmp/graph3041345590375499870.bin' '-w' '/tmp/graph3041345590375499870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3041345590375499870.bin' '-l' '-1' '-v' '-w' '/tmp/graph3041345590375499870.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:37:13] [INFO ] Decomposing Gal with order
[2024-05-29 17:37:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:37:14] [INFO ] Removed a total of 495 redundant transitions.
[2024-05-29 17:37:14] [INFO ] Flatten gal took : 354 ms
[2024-05-29 17:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1706 labels/synchronizations in 83 ms.
[2024-05-29 17:37:16] [INFO ] Time to serialize gal into /tmp/LTL16581648389465263799.gal : 33 ms
[2024-05-29 17:37:16] [INFO ] Time to serialize properties into /tmp/LTL4774454104736417403.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16581648389465263799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4774454104736417403.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((((((((((i4.i0.i0.u22.Fork_234==1)&&(i4.i0.i0.u23.Catch1_234==1))||((i23.i1.i0.u199.Fork_380==1)&&(i25.i1.i0.u197.Catch1_3...110731
Formula 0 simplified : G(!"(((((((((((i2.i1.i1.u271.Think_85==1)&&(i2.i1.i0.u121.Fork_85==1))||((i6.i1.i0.u205.Think_364==1)&&(i6.i1.i2.u469.Fork_364==1)))...110717
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1346115954835596742
[2024-05-29 17:37:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1346115954835596742
Running compilation step : cd /tmp/ltsmin1346115954835596742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1346115954835596742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1346115954835596742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-000500-LTLFireability-03 finished in 221830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X((!p1&&F(!p0)))) U X(p2)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 12 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:37:35] [INFO ] Invariant cache hit.
[2024-05-29 17:37:35] [INFO ] Implicit Places using invariants in 833 ms returned []
[2024-05-29 17:37:35] [INFO ] Invariant cache hit.
[2024-05-29 17:37:36] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2024-05-29 17:37:36] [INFO ] Invariant cache hit.
[2024-05-29 17:37:39] [INFO ] Dead Transitions using invariants and state equation in 3238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4871 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (AND (NOT p0) (NOT p2) p1), true, p0, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (EQ s79 1) (EQ s616 1)) (AND (EQ s375 1) (EQ s847 1)) (AND (EQ s287 1) (EQ s784 1)) (AND (EQ s168 1) (EQ s693 1)) (AND (EQ s456 1) (EQ s1007 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6687 steps with 0 reset in 341 ms.
FORMULA Philosophers-PT-000500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-04 finished in 5479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:37:40] [INFO ] Invariant cache hit.
[2024-05-29 17:37:42] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2024-05-29 17:37:42] [INFO ] Invariant cache hit.
[2024-05-29 17:37:43] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-05-29 17:37:43] [INFO ] Invariant cache hit.
[2024-05-29 17:37:45] [INFO ] Dead Transitions using invariants and state equation in 2657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5227 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s712 1) (EQ s1165 1)) (AND (EQ s832 1) (EQ s1335 1)) (AND (EQ s937 1) (EQ s1490 1)) (AND (EQ s680 1) (EQ s1074 1)) (AND (EQ s639 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21750 steps with 0 reset in 1027 ms.
FORMULA Philosophers-PT-000500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-06 finished in 6467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 63 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:37:47] [INFO ] Invariant cache hit.
[2024-05-29 17:37:47] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-29 17:37:47] [INFO ] Invariant cache hit.
[2024-05-29 17:37:49] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned []
Implicit Place search using SMT with State Equation took 2547 ms to find 0 implicit places.
[2024-05-29 17:37:49] [INFO ] Invariant cache hit.
[2024-05-29 17:37:52] [INFO ] Dead Transitions using invariants and state equation in 3083 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5708 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s399 0) (EQ s842 0)) (OR (EQ s242 0) (EQ s706 0)) (OR (EQ s137 0) (EQ s600 0)) (OR (EQ s298 0) (EQ s792 0)) (OR (EQ s421 0) (EQ s923 0)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-07 finished in 5878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 208 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:37:53] [INFO ] Invariant cache hit.
[2024-05-29 17:37:55] [INFO ] Implicit Places using invariants in 2692 ms returned []
[2024-05-29 17:37:55] [INFO ] Invariant cache hit.
[2024-05-29 17:37:58] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 5098 ms to find 0 implicit places.
[2024-05-29 17:37:58] [INFO ] Invariant cache hit.
[2024-05-29 17:38:01] [INFO ] Dead Transitions using invariants and state equation in 2929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8237 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s333 1) (EQ s780 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-08 finished in 8342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 122 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:38:01] [INFO ] Invariant cache hit.
[2024-05-29 17:38:04] [INFO ] Implicit Places using invariants in 3152 ms returned []
[2024-05-29 17:38:04] [INFO ] Invariant cache hit.
[2024-05-29 17:38:07] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned []
Implicit Place search using SMT with State Equation took 5885 ms to find 0 implicit places.
[2024-05-29 17:38:07] [INFO ] Invariant cache hit.
[2024-05-29 17:38:10] [INFO ] Dead Transitions using invariants and state equation in 2874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8883 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s186 1) (EQ s642 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 362 steps with 0 reset in 43 ms.
FORMULA Philosophers-PT-000500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-11 finished in 9037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 498
Deduced a syphon composed of 498 places in 1 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 0 with 996 rules applied. Total rules applied 996 place count 2002 transition count 2002
Applied a total of 996 rules in 537 ms. Remains 2002 /2500 variables (removed 498) and now considering 2002/2500 (removed 498) transitions.
// Phase 1: matrix 2002 rows 2002 cols
[2024-05-29 17:38:10] [INFO ] Computed 1000 invariants in 8 ms
[2024-05-29 17:38:13] [INFO ] Implicit Places using invariants in 2968 ms returned []
[2024-05-29 17:38:13] [INFO ] Invariant cache hit.
[2024-05-29 17:38:16] [INFO ] Implicit Places using invariants and state equation in 2431 ms returned []
Implicit Place search using SMT with State Equation took 5401 ms to find 0 implicit places.
[2024-05-29 17:38:16] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-29 17:38:16] [INFO ] Invariant cache hit.
[2024-05-29 17:38:18] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2002/2500 places, 2002/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7776 ms. Remains : 2002/2500 places, 2002/2500 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s581 1) (EQ s1040 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 85875 steps with 4 reset in 1899 ms.
FORMULA Philosophers-PT-000500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-12 finished in 9729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 89 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:38:20] [INFO ] Computed 1000 invariants in 10 ms
[2024-05-29 17:38:23] [INFO ] Implicit Places using invariants in 3056 ms returned []
[2024-05-29 17:38:23] [INFO ] Invariant cache hit.
[2024-05-29 17:38:23] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 3719 ms to find 0 implicit places.
[2024-05-29 17:38:23] [INFO ] Invariant cache hit.
[2024-05-29 17:38:26] [INFO ] Dead Transitions using invariants and state equation in 2373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6182 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s820 0) (EQ s1200 0) (AND (EQ s446 1) (EQ s998 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 93510 steps with 46755 reset in 10001 ms.
Product exploration timeout after 90660 steps with 45330 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000500-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000500-LTLFireability-14 finished in 44702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1&&F((!p1 U (p2||G(!p1)))))||p0))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 0 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 0 with 990 rules applied. Total rules applied 990 place count 2005 transition count 2005
Applied a total of 990 rules in 377 ms. Remains 2005 /2500 variables (removed 495) and now considering 2005/2500 (removed 495) transitions.
// Phase 1: matrix 2005 rows 2005 cols
[2024-05-29 17:39:05] [INFO ] Computed 1000 invariants in 10 ms
[2024-05-29 17:39:07] [INFO ] Implicit Places using invariants in 2321 ms returned []
[2024-05-29 17:39:07] [INFO ] Invariant cache hit.
[2024-05-29 17:39:10] [INFO ] Implicit Places using invariants and state equation in 2945 ms returned []
Implicit Place search using SMT with State Equation took 5273 ms to find 0 implicit places.
[2024-05-29 17:39:10] [INFO ] Redundant transitions in 83 ms returned []
[2024-05-29 17:39:10] [INFO ] Invariant cache hit.
[2024-05-29 17:39:10] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2005/2500 places, 2005/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6241 ms. Remains : 2005/2500 places, 2005/2500 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s647 1) (EQ s1238 1)), p0:(OR (EQ s890 0) (EQ s1858 0)), p2:(AND (NEQ s2002 1) (NOT (AND (EQ s647 1) (EQ s1238 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2242 ms.
Product exploration explored 100000 steps with 0 reset in 2185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 3) seen :1
Finished Best-First random walk after 2000 steps, including 0 resets, run visited all 2 properties in 38 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 5 out of 2005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2005/2005 places, 2005/2005 transitions.
Applied a total of 0 rules in 115 ms. Remains 2005 /2005 variables (removed 0) and now considering 2005/2005 (removed 0) transitions.
[2024-05-29 17:39:36] [INFO ] Invariant cache hit.
[2024-05-29 17:39:37] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-29 17:39:37] [INFO ] Invariant cache hit.
[2024-05-29 17:39:39] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
[2024-05-29 17:39:39] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-29 17:39:39] [INFO ] Invariant cache hit.
[2024-05-29 17:39:42] [INFO ] Dead Transitions using invariants and state equation in 2388 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5557 ms. Remains : 2005/2005 places, 2005/2005 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 980 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:40:03] [INFO ] Invariant cache hit.
[2024-05-29 17:40:03] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:40:04] [INFO ] [Nat]Absence check using 1000 positive place invariants in 278 ms returned sat
[2024-05-29 17:40:06] [INFO ] After 1774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:40:06] [INFO ] After 1986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-29 17:40:06] [INFO ] After 2864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2002 ms.
Product exploration explored 100000 steps with 1 reset in 2503 ms.
Built C files in :
/tmp/ltsmin12108442408843718573
[2024-05-29 17:40:11] [INFO ] Too many transitions (2005) to apply POR reductions. Disabling POR matrices.
[2024-05-29 17:40:11] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12108442408843718573
Running compilation step : cd /tmp/ltsmin12108442408843718573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12108442408843718573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12108442408843718573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2005/2005 places, 2005/2005 transitions.
Applied a total of 0 rules in 70 ms. Remains 2005 /2005 variables (removed 0) and now considering 2005/2005 (removed 0) transitions.
[2024-05-29 17:40:14] [INFO ] Invariant cache hit.
[2024-05-29 17:40:17] [INFO ] Implicit Places using invariants in 2397 ms returned []
[2024-05-29 17:40:17] [INFO ] Invariant cache hit.
[2024-05-29 17:40:19] [INFO ] Implicit Places using invariants and state equation in 2346 ms returned []
Implicit Place search using SMT with State Equation took 4753 ms to find 0 implicit places.
[2024-05-29 17:40:19] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-29 17:40:19] [INFO ] Invariant cache hit.
[2024-05-29 17:40:22] [INFO ] Dead Transitions using invariants and state equation in 2474 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7422 ms. Remains : 2005/2005 places, 2005/2005 transitions.
Built C files in :
/tmp/ltsmin9664585508325150014
[2024-05-29 17:40:22] [INFO ] Too many transitions (2005) to apply POR reductions. Disabling POR matrices.
[2024-05-29 17:40:22] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9664585508325150014
Running compilation step : cd /tmp/ltsmin9664585508325150014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9664585508325150014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9664585508325150014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 17:40:25] [INFO ] Flatten gal took : 70 ms
[2024-05-29 17:40:25] [INFO ] Flatten gal took : 64 ms
[2024-05-29 17:40:25] [INFO ] Time to serialize gal into /tmp/LTL4018833743950497935.gal : 9 ms
[2024-05-29 17:40:25] [INFO ] Time to serialize properties into /tmp/LTL8793366222010142141.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4018833743950497935.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2309678907588664364.hoa' '-atoms' '/tmp/LTL8793366222010142141.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8793366222010142141.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2309678907588664364.hoa
Detected timeout of ITS tools.
[2024-05-29 17:40:40] [INFO ] Flatten gal took : 52 ms
[2024-05-29 17:40:40] [INFO ] Flatten gal took : 65 ms
[2024-05-29 17:40:40] [INFO ] Time to serialize gal into /tmp/LTL1313084035932380883.gal : 16 ms
[2024-05-29 17:40:40] [INFO ] Time to serialize properties into /tmp/LTL8025587897834716934.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1313084035932380883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8025587897834716934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((Fork_345==0)||(Catch2_346==0))")||((F((!("((Fork_175==1)&&(Catch1_175==1))"))U(("((Eat_466==0)&&(!((Fork_175==1)&&(Catch1_1...256
Formula 0 simplified : FG(!"((Fork_345==0)||(Catch2_346==0))" & (!"((Fork_175==0)||(Catch1_175==0))" | G("((Fork_175==1)&&(Catch1_175==1))" M !"((Eat_466==...199
Detected timeout of ITS tools.
[2024-05-29 17:40:56] [INFO ] Flatten gal took : 50 ms
[2024-05-29 17:40:56] [INFO ] Applying decomposition
[2024-05-29 17:40:56] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7530069579016018436.txt' '-o' '/tmp/graph7530069579016018436.bin' '-w' '/tmp/graph7530069579016018436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7530069579016018436.bin' '-l' '-1' '-v' '-w' '/tmp/graph7530069579016018436.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:40:56] [INFO ] Decomposing Gal with order
[2024-05-29 17:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:40:56] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-29 17:40:56] [INFO ] Flatten gal took : 174 ms
[2024-05-29 17:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 64 ms.
[2024-05-29 17:40:56] [INFO ] Time to serialize gal into /tmp/LTL9633364216657062355.gal : 35 ms
[2024-05-29 17:40:56] [INFO ] Time to serialize properties into /tmp/LTL4217925015596773196.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9633364216657062355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4217925015596773196.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i10.i1.i0.u281.Fork_345==0)||(i10.i1.i0.u278.Catch2_346==0))")||((F((!("((i27.u508.Fork_175==1)&&(i27.u508.Catch1_175==1))"...373
Formula 0 simplified : FG(!"((i10.i1.i0.u281.Fork_345==0)||(i10.i1.i0.u278.Catch2_346==0))" & (!"((i27.u508.Fork_175==0)||(i27.u508.Catch1_175==0))" | G("(...298
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
177 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.20998,44240,1,0,56311,485,11557,63740,371,1276,121225
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000500-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Philosophers-PT-000500-LTLFireability-15 finished in 114426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1)&&(G(p0)||X(F(p2))))))'
Found a Shortening insensitive property : Philosophers-PT-000500-LTLFireability-03
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:40:59] [INFO ] Computed 1000 invariants in 14 ms
[2024-05-29 17:41:01] [INFO ] Implicit Places using invariants in 1456 ms returned []
[2024-05-29 17:41:01] [INFO ] Invariant cache hit.
[2024-05-29 17:41:01] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-29 17:41:01] [INFO ] Invariant cache hit.
[2024-05-29 17:41:04] [INFO ] Dead Transitions using invariants and state equation in 2801 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5174 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s79 1) (EQ s616 1)) (AND (EQ s375 1) (EQ s847 1)) (AND (EQ s287 1) (EQ s784 1)) (AND (EQ s168 1) (EQ s693 1)) (AND (EQ s456 1) (EQ s1007 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16 reset in 3623 ms.
Product exploration explored 100000 steps with 11 reset in 3787 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 678 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1405 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:41:44] [INFO ] Invariant cache hit.
[2024-05-29 17:41:46] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:41:46] [INFO ] [Nat]Absence check using 1000 positive place invariants in 319 ms returned sat
[2024-05-29 17:41:51] [INFO ] After 3412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:41:53] [INFO ] After 5183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1302 ms.
[2024-05-29 17:41:54] [INFO ] After 8336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 295 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 42 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 1183 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-29 17:41:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 13 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:42:12] [INFO ] Invariant cache hit.
[2024-05-29 17:42:14] [INFO ] Implicit Places using invariants in 1177 ms returned []
[2024-05-29 17:42:14] [INFO ] Invariant cache hit.
[2024-05-29 17:42:15] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
[2024-05-29 17:42:15] [INFO ] Invariant cache hit.
[2024-05-29 17:42:17] [INFO ] Dead Transitions using invariants and state equation in 2340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4684 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 696 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 754 ms. (steps per millisecond=13 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1611 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:42:58] [INFO ] Invariant cache hit.
[2024-05-29 17:43:00] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:43:01] [INFO ] [Nat]Absence check using 1000 positive place invariants in 319 ms returned sat
[2024-05-29 17:43:05] [INFO ] After 2899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:43:06] [INFO ] After 4672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1282 ms.
[2024-05-29 17:43:08] [INFO ] After 7959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 295 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 23 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 1106 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-29 17:43:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 9 reset in 3962 ms.
Product exploration explored 100000 steps with 9 reset in 3790 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 41 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:43:35] [INFO ] Redundant transitions in 188 ms returned []
[2024-05-29 17:43:35] [INFO ] Invariant cache hit.
[2024-05-29 17:43:38] [INFO ] Dead Transitions using invariants and state equation in 2951 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3199 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin6278385667853238266
[2024-05-29 17:43:38] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6278385667853238266
Running compilation step : cd /tmp/ltsmin6278385667853238266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6278385667853238266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6278385667853238266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 12 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:43:41] [INFO ] Invariant cache hit.
[2024-05-29 17:43:42] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2024-05-29 17:43:42] [INFO ] Invariant cache hit.
[2024-05-29 17:43:42] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2024-05-29 17:43:42] [INFO ] Invariant cache hit.
[2024-05-29 17:43:46] [INFO ] Dead Transitions using invariants and state equation in 3187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4933 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin5148532768928172041
[2024-05-29 17:43:46] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5148532768928172041
Running compilation step : cd /tmp/ltsmin5148532768928172041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5148532768928172041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5148532768928172041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 17:43:49] [INFO ] Flatten gal took : 68 ms
[2024-05-29 17:43:49] [INFO ] Flatten gal took : 70 ms
[2024-05-29 17:43:49] [INFO ] Time to serialize gal into /tmp/LTL6326674533914739374.gal : 22 ms
[2024-05-29 17:43:49] [INFO ] Time to serialize properties into /tmp/LTL9234801543216449384.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6326674533914739374.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17501358302755537913.hoa' '-atoms' '/tmp/LTL9234801543216449384.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9234801543216449384.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17501358302755537913.hoa
Detected timeout of ITS tools.
[2024-05-29 17:44:04] [INFO ] Flatten gal took : 77 ms
[2024-05-29 17:44:04] [INFO ] Flatten gal took : 80 ms
[2024-05-29 17:44:04] [INFO ] Time to serialize gal into /tmp/LTL1531782880675252005.gal : 12 ms
[2024-05-29 17:44:04] [INFO ] Time to serialize properties into /tmp/LTL11527707743703629073.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1531782880675252005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11527707743703629073.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((((((((((Fork_234==1)&&(Catch1_234==1))||((Fork_380==1)&&(Catch1_380==1)))||(((Fork_412==1)&&(Catch1_412==1))||((Fork_144=...60295
Formula 0 simplified : G(!"(((((((((((Think_85==1)&&(Fork_85==1))||((Think_364==1)&&(Fork_364==1)))||(((Think_305==1)&&(Fork_305==1))||((Think_158==1)&&(Fo...60281
Detected timeout of ITS tools.
[2024-05-29 17:44:19] [INFO ] Flatten gal took : 79 ms
[2024-05-29 17:44:19] [INFO ] Applying decomposition
[2024-05-29 17:44:19] [INFO ] Flatten gal took : 130 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5612294400973195083.txt' '-o' '/tmp/graph5612294400973195083.bin' '-w' '/tmp/graph5612294400973195083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5612294400973195083.bin' '-l' '-1' '-v' '-w' '/tmp/graph5612294400973195083.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:44:20] [INFO ] Decomposing Gal with order
[2024-05-29 17:44:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:44:20] [INFO ] Removed a total of 495 redundant transitions.
[2024-05-29 17:44:20] [INFO ] Flatten gal took : 266 ms
[2024-05-29 17:44:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1700 labels/synchronizations in 41 ms.
[2024-05-29 17:44:23] [INFO ] Time to serialize gal into /tmp/LTL17207966242375990405.gal : 29 ms
[2024-05-29 17:44:23] [INFO ] Time to serialize properties into /tmp/LTL17429281535537733395.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17207966242375990405.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17429281535537733395.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((((((((((i4.i0.i0.u323.Fork_234==1)&&(i4.i0.i0.u323.Catch1_234==1))||((i26.i0.i0.u474.Fork_380==1)&&(i26.i0.i0.u198.Catch1...110986
Formula 0 simplified : G(!"(((((((((((i37.i0.i0.u120.Think_85==1)&&(i37.i2.i0.u377.Fork_85==1))||((i32.i0.i0.u205.Think_364==1)&&(i32.i0.i1.u206.Fork_364==...110972
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7030137499315215354
[2024-05-29 17:44:38] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7030137499315215354
Running compilation step : cd /tmp/ltsmin7030137499315215354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7030137499315215354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7030137499315215354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Philosophers-PT-000500-LTLFireability-03 finished in 222411 ms.
[2024-05-29 17:44:41] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7516713050565316722
[2024-05-29 17:44:41] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-29 17:44:41] [INFO ] Applying decomposition
[2024-05-29 17:44:41] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7516713050565316722
Running compilation step : cd /tmp/ltsmin7516713050565316722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 17:44:41] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13636808981114869376.txt' '-o' '/tmp/graph13636808981114869376.bin' '-w' '/tmp/graph13636808981114869376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13636808981114869376.bin' '-l' '-1' '-v' '-w' '/tmp/graph13636808981114869376.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:44:42] [INFO ] Decomposing Gal with order
[2024-05-29 17:44:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:44:42] [INFO ] Removed a total of 498 redundant transitions.
[2024-05-29 17:44:42] [INFO ] Flatten gal took : 142 ms
[2024-05-29 17:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1710 labels/synchronizations in 31 ms.
[2024-05-29 17:44:44] [INFO ] Time to serialize gal into /tmp/LTLFireability653285092275374152.gal : 21 ms
[2024-05-29 17:44:44] [INFO ] Time to serialize properties into /tmp/LTLFireability10287110065770991742.ltl : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability653285092275374152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10287110065770991742.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(((((((((((i0.i2.i1.u118.Think_85==1)&&(i0.i2.i1.u118.Fork_85==1))||((i5.i0.i0.u313.Think_364==1)&&(i5.i0.i0.u313.Fork_364==1)...111315
Formula 0 simplified : G(!"(((((((((((i0.i2.i1.u118.Think_85==1)&&(i0.i2.i1.u118.Fork_85==1))||((i5.i0.i0.u313.Think_364==1)&&(i5.i0.i0.u313.Fork_364==1)))...111301
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 10696 ms.
Running link step : cd /tmp/ltsmin7516713050565316722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin7516713050565316722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))&&([]((LTLAPp0==true))||X(<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 18:09:09] [INFO ] Applying decomposition
[2024-05-29 18:09:09] [INFO ] Flatten gal took : 214 ms
[2024-05-29 18:09:09] [INFO ] Decomposing Gal with order
[2024-05-29 18:09:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:09:10] [INFO ] Removed a total of 1047 redundant transitions.
[2024-05-29 18:09:10] [INFO ] Flatten gal took : 391 ms
[2024-05-29 18:09:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 44 ms.
[2024-05-29 18:09:10] [INFO ] Time to serialize gal into /tmp/LTLFireability16828850731255918356.gal : 58 ms
[2024-05-29 18:09:10] [INFO ] Time to serialize properties into /tmp/LTLFireability7739495761342107788.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16828850731255918356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7739495761342107788.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((("(((((((((((u617.Think_85==1)&&(u164.Fork_85==1))||((u866.Think_364==1)&&(u34.Fork_364==1)))||(((u793.Think_305==1)&&(u54.Fork_...77150
Formula 0 simplified : G(!"(((((((((((u617.Think_85==1)&&(u164.Fork_85==1))||((u866.Think_364==1)&&(u34.Fork_364==1)))||(((u793.Think_305==1)&&(u54.Fork_30...77136
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 167324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15427268 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-PT-000500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422500333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000500.tgz
mv Philosophers-PT-000500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;