MCC'2022- Execution of r168-tall-165277016500347

About the Execution of ITS-Tools for Philosophers-PT-002000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
9851.207	824633.00	1356427.00	3845.60	FTFT?TT?FTFTFTTF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016500347.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-002000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500347
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 1.6M Apr 29 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.9M Apr 29 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 29 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.8M Apr 29 12:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.3M May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.6M May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 607K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 183K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 513K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.5M May 10 09:34 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-002000-LTLCardinality-00
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-01
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-02
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-03
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-04
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-05
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-06
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-07
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-08
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-09
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-10
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-11
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-12
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-13
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-14
FORMULA_NAME Philosophers-PT-002000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652829608812

Running Version 202205111006
[2022-05-17 23:20:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 23:20:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 23:20:10] [INFO ] Load time of PNML (sax parser for PT used): 415 ms
[2022-05-17 23:20:10] [INFO ] Transformed 10000 places.
[2022-05-17 23:20:10] [INFO ] Transformed 10000 transitions.
[2022-05-17 23:20:10] [INFO ] Parsed PT model containing 10000 places and 10000 transitions in 576 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 3240 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-002000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-002000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 98 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:20:14] [INFO ] Computed 4000 place invariants in 88 ms
[2022-05-17 23:20:15] [INFO ] Implicit Places using invariants in 1272 ms returned []
Implicit Place search using SMT only with invariants took 1318 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:20:15] [INFO ] Computed 4000 place invariants in 30 ms
[2022-05-17 23:20:16] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Support contains 10000 out of 10000 places after structural reductions.
[2022-05-17 23:20:17] [INFO ] Flatten gal took : 549 ms
[2022-05-17 23:20:18] [INFO ] Flatten gal took : 446 ms
[2022-05-17 23:20:19] [INFO ] Input system was already deterministic with 10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9669 ms. (steps per millisecond=1 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3131 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4674 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1890 ms. (steps per millisecond=5 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:20:41] [INFO ] Computed 4000 place invariants in 27 ms
[2022-05-17 23:20:44] [INFO ] After 1947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 23:20:47] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1319 ms returned sat
[2022-05-17 23:21:05] [INFO ] After 12078ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-05-17 23:21:06] [INFO ] After 12979ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 360 ms.
[2022-05-17 23:21:07] [INFO ] After 22319ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 1 properties in 850 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 855 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA Philosophers-PT-002000-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 661 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:09] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 23:21:09] [INFO ] Implicit Places using invariants in 871 ms returned []
Implicit Place search using SMT only with invariants took 873 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:09] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 23:21:10] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT (ADD s7677 s7678 s7679 s7680 s7681 s7682 s7683 s7684 s7685 s7686 s7687 s7688 s7689 s7690 s7691 s7692 s7693 s7694 s7695 s7696 s7697 s7698 s7699...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-00 finished in 2749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 575 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:11] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 23:21:12] [INFO ] Implicit Places using invariants in 928 ms returned []
Implicit Place search using SMT only with invariants took 931 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:12] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 23:21:13] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-02 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:(GT (ADD s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s3848 s3849 s3850 s3851 s3852 s3853 s3854 s3855 s3856 s3857 s3858 s3859 s386...], 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 6 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-02 finished in 2500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(p0)) U p1))))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 352 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:13] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 23:21:14] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:14] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 23:21:15] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], 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][false, false, false, false, false]]
Product exploration timeout after 57910 steps with 0 reset in 10001 ms.
Product exploration timeout after 58560 steps with 0 reset in 10001 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 p1 (NOT p0)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5362 ms. (steps per millisecond=1 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1833 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:21:44] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 23:21:46] [INFO ] [Real]Absence check using 4000 positive place invariants in 1271 ms returned sat
[2022-05-17 23:21:49] [INFO ] After 5078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:21:51] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1332 ms returned sat
[2022-05-17 23:22:07] [INFO ] After 13145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:22:08] [INFO ] After 13866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 357 ms.
[2022-05-17 23:22:08] [INFO ] After 19278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 1 properties in 818 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 825 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 322 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:22:10] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 23:22:11] [INFO ] Implicit Places using invariants in 866 ms returned []
Implicit Place search using SMT only with invariants took 867 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:22:11] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 23:22:12] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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 p1 (NOT p0)), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5194 ms. (steps per millisecond=1 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1837 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:22:20] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:22:22] [INFO ] [Real]Absence check using 4000 positive place invariants in 1301 ms returned sat
[2022-05-17 23:22:25] [INFO ] After 5070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 23:22:27] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1321 ms returned sat
[2022-05-17 23:22:42] [INFO ] After 11643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:22:42] [INFO ] After 12355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 384 ms.
[2022-05-17 23:22:43] [INFO ] After 17823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2000 steps, including 0 resets, run visited all 1 properties in 774 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 776 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1)]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Product exploration timeout after 61760 steps with 0 reset in 10001 ms.
Product exploration timeout after 57830 steps with 0 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 564 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:23:05] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 23:23:06] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration timeout after 63330 steps with 0 reset in 10001 ms.
Product exploration timeout after 54240 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin9074823906367481781
[2022-05-17 23:23:26] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9074823906367481781
Running compilation step : cd /tmp/ltsmin9074823906367481781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9074823906367481781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9074823906367481781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 323 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:23:29] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 23:23:30] [INFO ] Implicit Places using invariants in 849 ms returned []
Implicit Place search using SMT only with invariants took 857 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:23:30] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 23:23:31] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin12690063614317263767
[2022-05-17 23:23:31] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12690063614317263767
Running compilation step : cd /tmp/ltsmin12690063614317263767;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12690063614317263767;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12690063614317263767;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 23:23:35] [INFO ] Flatten gal took : 432 ms
[2022-05-17 23:23:36] [INFO ] Flatten gal took : 347 ms
[2022-05-17 23:23:36] [INFO ] Time to serialize gal into /tmp/LTL2265482909040805472.gal : 145 ms
[2022-05-17 23:23:36] [INFO ] Time to serialize properties into /tmp/LTL17177945122987929288.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2265482909040805472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17177945122987929288.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2265482...267
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X("(((((((((((((Think_1+Think_2)+(Think_3+Think_4))+((Think_5+Think_6)+(Think_7+Think_8)))+(((Think_9+Think_10)+(Think_11+Th...93625
Formula 0 simplified : !GX(XX"(((((((((((((Think_1+Think_2)+(Think_3+Think_4))+((Think_5+Think_6)+(Think_7+Think_8)))+(((Think_9+Think_10)+(Think_11+Think_...93615
Detected timeout of ITS tools.
[2022-05-17 23:23:51] [INFO ] Flatten gal took : 291 ms
[2022-05-17 23:23:51] [INFO ] Applying decomposition
[2022-05-17 23:23:52] [INFO ] Flatten gal took : 296 ms
[2022-05-17 23:24:12] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16846895591719549373.txt' '-o' '/tmp/graph16846895591719549373.bin' '-w' '/tmp/graph16846895591719549373.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 23:24:12] [INFO ] Flatten gal took : 321 ms
[2022-05-17 23:24:12] [INFO ] Time to serialize gal into /tmp/LTL14087080628810947923.gal : 46 ms
[2022-05-17 23:24:12] [INFO ] Time to serialize properties into /tmp/LTL8066392965721836484.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14087080628810947923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8066392965721836484.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1408708...267
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X("(((((((((((((Think_1+Think_2)+(Think_3+Think_4))+((Think_5+Think_6)+(Think_7+Think_8)))+(((Think_9+Think_10)+(Think_11+Th...93625
Formula 0 simplified : !GX(XX"(((((((((((((Think_1+Think_2)+(Think_3+Think_4))+((Think_5+Think_6)+(Think_7+Think_8)))+(((Think_9+Think_10)+(Think_11+Think_...93615
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17050240091958740357
[2022-05-17 23:24:27] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17050240091958740357
Running compilation step : cd /tmp/ltsmin17050240091958740357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17050240091958740357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17050240091958740357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-PT-002000-LTLCardinality-04 finished in 197265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(G(p0) U X(p1)))||X(p2)))'
Support contains 8000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 93 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:24:30] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 23:24:31] [INFO ] Implicit Places using invariants in 891 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:24:31] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 23:24:32] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, p1, p0, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (AND p0 p1)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ 2 (ADD s7677 s7678 s7679 s7680 s7681 s7682 s7683 s7684 s7685 s7686 s7687 s7688 s7689 s7690 s7691 s7692 s7693 s7694 s7695 s7696 s7697 s7698 s7699 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 18450 steps with 9225 reset in 10003 ms.
Product exploration timeout after 18410 steps with 9205 reset in 10001 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 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-002000-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-002000-LTLCardinality-05 finished in 23630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||p1)) U p2)))'
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 498 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:24:54] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:24:55] [INFO ] Implicit Places using invariants in 809 ms returned []
Implicit Place search using SMT only with invariants took 809 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:24:55] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:24:56] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 2 (ADD s5661 s5662 s5663 s5664 s5665 s5666 s5667 s5668 s5672 s5673 s5674 s5675 s5676 s5757 s5758 s5759 s5760 s5761 s5762 s5763 s5764 s5765 s5766 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 30460 steps with 5 reset in 10003 ms.
Product exploration timeout after 30550 steps with 4 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 (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7342 ms. (steps per millisecond=1 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2584 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3412 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:25:32] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 23:25:35] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 23:25:37] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1357 ms returned sat
[2022-05-17 23:26:00] [INFO ] After 16857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:26:00] [INFO ] After 16862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 23:26:00] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 328 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7021 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2485 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3394 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 135192 steps, run timeout after 36047 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 135192 steps, saw 135151 distinct states, run finished after 36049 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:26:49] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 23:26:52] [INFO ] After 1234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 23:26:54] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1312 ms returned sat
[2022-05-17 23:27:17] [INFO ] After 17284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:27:17] [INFO ] After 17291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 23:27:17] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 360 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 318 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:27:18] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 23:27:19] [INFO ] Implicit Places using invariants in 899 ms returned []
Implicit Place search using SMT only with invariants took 900 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:27:19] [INFO ] Computed 4000 place invariants in 18 ms
[2022-05-17 23:27:19] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:27:21] [INFO ] Computed 4000 place invariants in 22 ms
Could not prove EG (NOT p2)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 373 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:27:36] [INFO ] Computed 4000 place invariants in 22 ms
[2022-05-17 23:27:37] [INFO ] Implicit Places using invariants in 985 ms returned []
Implicit Place search using SMT only with invariants took 987 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:27:37] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 23:27:38] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 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 p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7077 ms. (steps per millisecond=1 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2749 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3280 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:27:54] [INFO ] Computed 4000 place invariants in 23 ms
[2022-05-17 23:27:56] [INFO ] After 1162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 23:27:59] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1383 ms returned sat
[2022-05-17 23:28:21] [INFO ] After 16816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:28:21] [INFO ] After 16819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 23:28:21] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 320 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6763 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2668 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3251 ms. (steps per millisecond=3 ) properties (out of 2) seen :0
Probabilistic random walk after 136191 steps, saw 136150 distinct states, run finished after 36114 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:29:11] [INFO ] Computed 4000 place invariants in 62 ms
[2022-05-17 23:29:13] [INFO ] After 1179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 23:29:16] [INFO ] [Nat]Absence check using 4000 positive place invariants in 1307 ms returned sat
[2022-05-17 23:29:38] [INFO ] After 17189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 23:29:38] [INFO ] After 17199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 23:29:38] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 355 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 304 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:29:39] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 23:29:40] [INFO ] Implicit Places using invariants in 857 ms returned []
Implicit Place search using SMT only with invariants took 858 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:29:40] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 23:29:41] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:29:42] [INFO ] Computed 4000 place invariants in 24 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2)]
Product exploration timeout after 20920 steps with 7 reset in 10001 ms.
Product exploration timeout after 20660 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin17041034761134225197
[2022-05-17 23:30:17] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:30:17] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17041034761134225197
Running compilation step : cd /tmp/ltsmin17041034761134225197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17041034761134225197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17041034761134225197;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6000 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 314 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:30:21] [INFO ] Computed 4000 place invariants in 16 ms
[2022-05-17 23:30:21] [INFO ] Implicit Places using invariants in 903 ms returned []
Implicit Place search using SMT only with invariants took 904 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:30:22] [INFO ] Computed 4000 place invariants in 21 ms
[2022-05-17 23:30:22] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Built C files in :
/tmp/ltsmin6625091529711890176
[2022-05-17 23:30:22] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:30:22] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6625091529711890176
Running compilation step : cd /tmp/ltsmin6625091529711890176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6625091529711890176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6625091529711890176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 23:30:26] [INFO ] Flatten gal took : 367 ms
[2022-05-17 23:30:26] [INFO ] Flatten gal took : 304 ms
[2022-05-17 23:30:26] [INFO ] Time to serialize gal into /tmp/LTL13297003305244616434.gal : 30 ms
[2022-05-17 23:30:26] [INFO ] Time to serialize properties into /tmp/LTL15710830209831050396.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13297003305244616434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15710830209831050396.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1329700...268
Read 1 LTL properties
Checking formula 0 : !((G((F((G("((((((((((((Think_1+Think_2)+(Think_3+Think_4))+((Think_5+Think_6)+(Think_7+Think_8)))+(((Think_9+Think_10)+(Think_11+Thin...103626
Formula 0 simplified : !G(F("((((((((((((Catch1_63+Catch1_62)+(Catch1_65+Catch1_64))+((Catch1_67+Catch1_66)+(Catch1_69+Catch1_68)))+(((Catch1_71+Catch1_70)...103617
Detected timeout of ITS tools.
[2022-05-17 23:30:42] [INFO ] Flatten gal took : 277 ms
[2022-05-17 23:30:42] [INFO ] Applying decomposition
[2022-05-17 23:30:42] [INFO ] Flatten gal took : 292 ms
[2022-05-17 23:31:02] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6359456362020051997.txt' '-o' '/tmp/graph6359456362020051997.bin' '-w' '/tmp/graph6359456362020051997.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:654)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:418)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 23:31:03] [INFO ] Flatten gal took : 296 ms
[2022-05-17 23:31:03] [INFO ] Time to serialize gal into /tmp/LTL14826640527256261961.gal : 29 ms
[2022-05-17 23:31:03] [INFO ] Time to serialize properties into /tmp/LTL16139193569258890331.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14826640527256261961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16139193569258890331.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1482664...268
Read 1 LTL properties
Checking formula 0 : !((G((F((G("((((((((((((Think_1+Think_2)+(Think_3+Think_4))+((Think_5+Think_6)+(Think_7+Think_8)))+(((Think_9+Think_10)+(Think_11+Thin...103626
Formula 0 simplified : !G(F("((((((((((((Catch1_63+Catch1_62)+(Catch1_65+Catch1_64))+((Catch1_67+Catch1_66)+(Catch1_69+Catch1_68)))+(((Catch1_71+Catch1_70)...103617
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6135070102125823787
[2022-05-17 23:31:18] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6135070102125823787
Running compilation step : cd /tmp/ltsmin6135070102125823787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6135070102125823787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6135070102125823787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-PT-002000-LTLCardinality-07 finished in 386982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1133 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:31:22] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:31:23] [INFO ] Implicit Places using invariants in 785 ms returned []
Implicit Place search using SMT only with invariants took 786 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:31:23] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 23:31:24] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-08 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: 2}]], initial=3, aps=[p0:(LEQ s9639 s7250)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28260 steps with 0 reset in 3737 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-08 finished in 6567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)||p0))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 1009 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:31:28] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 23:31:29] [INFO ] Implicit Places using invariants in 818 ms returned []
Implicit Place search using SMT only with invariants took 818 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:31:29] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 23:31:30] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7998 s2651)], 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 26740 steps with 13370 reset in 10003 ms.
Product exploration timeout after 25830 steps with 12915 reset in 10001 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-002000-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-002000-LTLCardinality-09 finished in 23238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||X(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 956 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:31:52] [INFO ] Computed 4000 place invariants in 25 ms
[2022-05-17 23:31:53] [INFO ] Implicit Places using invariants in 981 ms returned []
Implicit Place search using SMT only with invariants took 983 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:31:53] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:31:54] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LEQ s2569 s257), p0:(GT 1 s8519)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33057 steps with 0 reset in 3990 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-10 finished in 7212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(false U false)))'
Support contains 0 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 2000 Post agglomeration using F-continuation condition.Transition count delta: 2000
Deduced a syphon composed of 2000 places in 2 ms
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 0 with 4000 rules applied. Total rules applied 4000 place count 8000 transition count 8000
Applied a total of 4000 rules in 2486 ms. Remains 8000 /10000 variables (removed 2000) and now considering 8000/10000 (removed 2000) transitions.
// Phase 1: matrix 8000 rows 8000 cols
[2022-05-17 23:32:00] [INFO ] Computed 4000 place invariants in 12 ms
[2022-05-17 23:32:07] [INFO ] Implicit Places using invariants in 6130 ms returned []
// Phase 1: matrix 8000 rows 8000 cols
[2022-05-17 23:32:07] [INFO ] Computed 4000 place invariants in 10 ms
[2022-05-17 23:32:13] [INFO ] Implicit Places using invariants and state equation in 6209 ms returned []
Implicit Place search using SMT with State Equation took 12357 ms to find 0 implicit places.
[2022-05-17 23:32:14] [INFO ] Redundant transitions in 1118 ms returned []
// Phase 1: matrix 8000 rows 8000 cols
[2022-05-17 23:32:14] [INFO ] Computed 4000 place invariants in 15 ms
[2022-05-17 23:32:15] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8000/10000 places, 8000/10000 transitions.
Finished structural reductions, in 1 iterations. Remains : 8000/10000 places, 8000/10000 transitions.
Stuttering acceptance computed with spot in 38 ms :[false]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-14 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-14 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-14 finished in 16783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 973 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:32:16] [INFO ] Computed 4000 place invariants in 20 ms
[2022-05-17 23:32:17] [INFO ] Implicit Places using invariants in 1129 ms returned []
Implicit Place search using SMT only with invariants took 1140 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:32:17] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:32:18] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-002000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LEQ s5361 s7788) (LEQ 1 s2207))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 23690 steps with 1852 reset in 10003 ms.
Product exploration timeout after 32040 steps with 1403 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1895 steps, including 0 resets, run visited all 1 properties in 869 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Applied a total of 0 rules in 945 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:32:40] [INFO ] Computed 4000 place invariants in 24 ms
[2022-05-17 23:32:41] [INFO ] Implicit Places using invariants in 880 ms returned []
Implicit Place search using SMT only with invariants took 881 ms to find 0 implicit places.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:32:41] [INFO ] Computed 4000 place invariants in 17 ms
[2022-05-17 23:32:42] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 367 steps, including 0 resets, run visited all 1 properties in 234 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 98830 steps with 1092 reset in 10001 ms.
Product exploration timeout after 31030 steps with 2583 reset in 10009 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 10000/10000 transitions.
Performed 1997 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1997 places in 2 ms
Iterating global reduction 0 with 1997 rules applied. Total rules applied 1997 place count 10000 transition count 10000
Deduced a syphon composed of 1997 places in 2 ms
Applied a total of 1997 rules in 2823 ms. Remains 10000 /10000 variables (removed 0) and now considering 10000/10000 (removed 0) transitions.
// Phase 1: matrix 10000 rows 10000 cols
[2022-05-17 23:33:06] [INFO ] Computed 4000 place invariants in 19 ms
[2022-05-17 23:33:07] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10000/10000 places, 10000/10000 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 10000/10000 transitions.
Product exploration timeout after 29310 steps with 1064 reset in 10015 ms.
Stack based approach found an accepted trace after 9190 steps with 1992 reset with depth 1749 and stack size 1747 in 6896 ms.
FORMULA Philosophers-PT-002000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-002000-LTLCardinality-15 finished in 69452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(p0)) U p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||p1)) U p2)))'
[2022-05-17 23:33:25] [INFO ] Flatten gal took : 333 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin321843882333794746
[2022-05-17 23:33:25] [INFO ] Too many transitions (10000) to apply POR reductions. Disabling POR matrices.
[2022-05-17 23:33:25] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin321843882333794746
Running compilation step : cd /tmp/ltsmin321843882333794746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 23:33:25] [INFO ] Applying decomposition
[2022-05-17 23:33:26] [INFO ] Flatten gal took : 338 ms
[2022-05-17 23:33:52] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17603742844767828039.txt' '-o' '/tmp/graph17603742844767828039.bin' '-w' '/tmp/graph17603742844767828039.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:98)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 23:33:52] [INFO ] Flatten gal took : 285 ms
java.io.IOException: Stream Closed
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354)
at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81)
at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142)
at fr.lip6.move.serialization.SerializationUtil.systemToFile(SerializationUtil.java:98)
at fr.lip6.move.gal.application.runner.its.ITSRunner.outputGalFile(ITSRunner.java:406)
at fr.lip6.move.gal.application.runner.its.ITSRunner.configure(ITSRunner.java:96)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.startRunner(MultiOrderRunner.java:153)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:104)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 23:33:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality2831222845900110483.gal : 30 ms
Application raised an uncaught exception No space left on device
java.io.IOException: No space left on device
at java.base/java.io.FileOutputStream.writeBytes(Native Method)
at java.base/java.io.FileOutputStream.write(FileOutputStream.java:341)
at fr.lip6.move.serialization.SerializationUtil.serializePropertiesForITSLTLTools(SerializationUtil.java:227)
at fr.lip6.move.gal.application.runner.its.ITSRunner.outputPropertyFile(ITSRunner.java:345)
at fr.lip6.move.gal.application.runner.its.ITSRunner.configure(ITSRunner.java:97)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.startRunner(MultiOrderRunner.java:153)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:104)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Total runtime 823026 ms.

BK_STOP 1652830433445

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-002000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-002000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016500347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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