About the Execution of LoLa+red for CircadianClock-PT-010000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1527.172 | 98439.00 | 157546.00 | 843.90 | FFT?FFFFT?TTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397600131.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CircadianClock-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397600131
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.8K Feb 26 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 10:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K Mar 5 18:22 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 CircadianClock-PT-010000-LTLCardinality-00
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-01
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-02
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-03
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-04
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-05
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-06
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-07
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-08
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-09
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-10
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-11
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-12
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-13
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-14
FORMULA_NAME CircadianClock-PT-010000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678245080981
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-010000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:11:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 03:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:11:23] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 03:11:23] [INFO ] Transformed 14 places.
[2023-03-08 03:11:23] [INFO ] Transformed 16 transitions.
[2023-03-08 03:11:23] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircadianClock-PT-010000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 46 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:11:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 03:11:24] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 03:11:24] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-08 03:11:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:24] [INFO ] Invariant cache hit.
[2023-03-08 03:11:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:24] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 03:11:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:24] [INFO ] Invariant cache hit.
[2023-03-08 03:11:24] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 03:11:24] [INFO ] Flatten gal took : 31 ms
[2023-03-08 03:11:25] [INFO ] Flatten gal took : 10 ms
[2023-03-08 03:11:25] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 27) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-08 03:11:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:25] [INFO ] Invariant cache hit.
[2023-03-08 03:11:25] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-08 03:11:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-08 03:11:25] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-03-08 03:11:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:25] [INFO ] After 73ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2023-03-08 03:11:26] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-08 03:11:26] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 2 properties in 13821 ms.
Support contains 9 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 12 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 171237 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{0=1, 2=1, 4=1, 7=1, 12=1}
Probabilistic random walk after 171237 steps, saw 123092 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :5
Running SMT prover for 8 properties.
[2023-03-08 03:11:43] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:43] [INFO ] Invariant cache hit.
[2023-03-08 03:11:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 03:11:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 03:11:43] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 03:11:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:43] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 03:11:43] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 03:11:43] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2221 ms.
Support contains 7 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 293167 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{1=1, 2=1, 4=1, 6=1, 7=1}
Probabilistic random walk after 293167 steps, saw 212877 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :5
Running SMT prover for 3 properties.
[2023-03-08 03:11:49] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:49] [INFO ] Invariant cache hit.
[2023-03-08 03:11:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 03:11:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 03:11:49] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 03:11:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:49] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 03:11:49] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 03:11:49] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 755 ms.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 361721 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 361721 steps, saw 266562 distinct states, run finished after 3002 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 03:11:53] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:53] [INFO ] Invariant cache hit.
[2023-03-08 03:11:53] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 03:11:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 03:11:53] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 03:11:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:53] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 03:11:53] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 03:11:53] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 877 ms.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:11:54] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:54] [INFO ] Invariant cache hit.
[2023-03-08 03:11:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 03:11:54] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:54] [INFO ] Invariant cache hit.
[2023-03-08 03:11:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 03:11:54] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 03:11:54] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:54] [INFO ] Invariant cache hit.
[2023-03-08 03:11:54] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 14/14 places, 16/16 transitions.
Graph (trivial) has 8 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 18 edges and 11 vertex of which 5 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 4 transition count 4
Applied a total of 7 rules in 5 ms. Remains 4 /14 variables (removed 10) and now considering 4/16 (removed 12) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-08 03:11:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:11:54] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 03:11:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 03:11:54] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 03:11:54] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 03:11:54] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA CircadianClock-PT-010000-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:11:55] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 03:11:55] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-08 03:11:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 03:11:55] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:55] [INFO ] Invariant cache hit.
[2023-03-08 03:11:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-08 03:11:55] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:55] [INFO ] Invariant cache hit.
[2023-03-08 03:11:55] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-01 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:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-01 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((G(p0) U p1))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:11:55] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:55] [INFO ] Invariant cache hit.
[2023-03-08 03:11:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 03:11:55] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:55] [INFO ] Invariant cache hit.
[2023-03-08 03:11:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:55] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 03:11:55] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:55] [INFO ] Invariant cache hit.
[2023-03-08 03:11:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(LEQ s1 s9), p1:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 453 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-010000-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-010000-LTLCardinality-02 finished in 1192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:11:56] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:56] [INFO ] Invariant cache hit.
[2023-03-08 03:11:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 03:11:56] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:56] [INFO ] Invariant cache hit.
[2023-03-08 03:11:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:11:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 03:11:56] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 03:11:56] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:11:56] [INFO ] Invariant cache hit.
[2023-03-08 03:11:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s9), p0:(LEQ s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 321 ms.
Product exploration explored 100000 steps with 0 reset in 433 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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Finished probabilistic random walk after 210007 steps, run visited all 3 properties in 1899 ms. (steps per millisecond=110 )
Probabilistic random walk after 210007 steps, saw 146354 distinct states, run finished after 1900 ms. (steps per millisecond=110 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 462 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:00] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:00] [INFO ] Invariant cache hit.
[2023-03-08 03:12:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 03:12:01] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:01] [INFO ] Invariant cache hit.
[2023-03-08 03:12:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:01] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 03:12:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 03:12:01] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:01] [INFO ] Invariant cache hit.
[2023-03-08 03:12:01] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 14/14 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 358 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Finished probabilistic random walk after 210007 steps, run visited all 3 properties in 1823 ms. (steps per millisecond=115 )
Probabilistic random walk after 210007 steps, saw 146354 distinct states, run finished after 1823 ms. (steps per millisecond=115 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 412 ms.
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:04] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:04] [INFO ] Invariant cache hit.
[2023-03-08 03:12:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 03:12:04] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:04] [INFO ] Invariant cache hit.
[2023-03-08 03:12:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 03:12:05] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 14/14 places, 16/16 transitions.
Treatment of property CircadianClock-PT-010000-LTLCardinality-03 finished in 8204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 03:12:05] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2673 reset in 228 ms.
Stack based approach found an accepted trace after 19 steps with 1 reset with depth 3 and stack size 3 in 1 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-04 finished in 571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&(p1||X((G(p2) U (p1&&G(p2))))))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 03:12:05] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:05] [INFO ] Invariant cache hit.
[2023-03-08 03:12:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 s9), p1:(GT 2 s6), p2:(LEQ s3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-05 finished in 583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:06] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:06] [INFO ] Invariant cache hit.
[2023-03-08 03:12:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 03:12:06] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:06] [INFO ] Invariant cache hit.
[2023-03-08 03:12:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 03:12:06] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 03:12:06] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:06] [INFO ] Invariant cache hit.
[2023-03-08 03:12:06] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 50 ms :[p0]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6871 reset in 107 ms.
Stack based approach found an accepted trace after 15 steps with 3 reset with depth 2 and stack size 2 in 0 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-06 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&F(p2)))&&p0)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:06] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:06] [INFO ] Invariant cache hit.
[2023-03-08 03:12:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 03:12:06] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:06] [INFO ] Invariant cache hit.
[2023-03-08 03:12:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 03:12:06] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:06] [INFO ] Invariant cache hit.
[2023-03-08 03:12:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ 1 s13), p1:(LEQ 3 s8), p0:(AND (LEQ 1 s13) (LEQ s3 s7))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-07 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p1)))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:07] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:07] [INFO ] Invariant cache hit.
[2023-03-08 03:12:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 03:12:07] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:07] [INFO ] Invariant cache hit.
[2023-03-08 03:12:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-08 03:12:07] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:07] [INFO ] Invariant cache hit.
[2023-03-08 03:12:07] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s10 s5), p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 164 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 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircadianClock-PT-010000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircadianClock-PT-010000-LTLCardinality-08 finished in 884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0&&F(p1)))||G(p2))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:07] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:07] [INFO ] Invariant cache hit.
[2023-03-08 03:12:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 03:12:07] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:07] [INFO ] Invariant cache hit.
[2023-03-08 03:12:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-08 03:12:08] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 03:12:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:08] [INFO ] Invariant cache hit.
[2023-03-08 03:12:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s0), p2:(LEQ 2 s9), p1:(LEQ s12 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 261 ms.
Product exploration explored 100000 steps with 0 reset in 674 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 668 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 03:12:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:10] [INFO ] Invariant cache hit.
[2023-03-08 03:12:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 03:12:10] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 03:12:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 03:12:10] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 03:12:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:10] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 03:12:10] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 03:12:10] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 880 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Finished probabilistic random walk after 210025 steps, run visited all 4 properties in 2170 ms. (steps per millisecond=96 )
Probabilistic random walk after 210025 steps, saw 146369 distinct states, run finished after 2171 ms. (steps per millisecond=96 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 15 factoid took 910 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:14] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:14] [INFO ] Invariant cache hit.
[2023-03-08 03:12:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 03:12:14] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:14] [INFO ] Invariant cache hit.
[2023-03-08 03:12:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:14] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-08 03:12:14] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 03:12:14] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:14] [INFO ] Invariant cache hit.
[2023-03-08 03:12:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 14/14 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 615 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 03:12:15] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:15] [INFO ] Invariant cache hit.
[2023-03-08 03:12:15] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 03:12:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 03:12:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 03:12:15] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 03:12:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:15] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 03:12:15] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 03:12:15] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1016 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Finished probabilistic random walk after 210025 steps, run visited all 4 properties in 2003 ms. (steps per millisecond=104 )
Probabilistic random walk after 210025 steps, saw 146369 distinct states, run finished after 2003 ms. (steps per millisecond=104 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 15 factoid took 846 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 0 reset in 373 ms.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:20] [INFO ] Invariant cache hit.
[2023-03-08 03:12:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 03:12:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:20] [INFO ] Invariant cache hit.
[2023-03-08 03:12:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 03:12:20] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 03:12:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:20] [INFO ] Invariant cache hit.
[2023-03-08 03:12:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 14/14 places, 16/16 transitions.
Treatment of property CircadianClock-PT-010000-LTLCardinality-09 finished in 13049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(G(p0) U p1))&&(!(p2 U p0)||F(!p2)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:20] [INFO ] Invariant cache hit.
[2023-03-08 03:12:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 03:12:20] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:20] [INFO ] Invariant cache hit.
[2023-03-08 03:12:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-08 03:12:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:21] [INFO ] Invariant cache hit.
[2023-03-08 03:12:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR p1 (AND p0 p2)), (OR p1 (AND p0 p2)), p1, p2, (AND p2 p0), true, (AND p0 p1), p0]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ 1 s12), p0:(LEQ s1 s10), p1:(LEQ 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 208 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-12 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1))))&&F(p1)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:21] [INFO ] Invariant cache hit.
[2023-03-08 03:12:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 03:12:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:21] [INFO ] Invariant cache hit.
[2023-03-08 03:12:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:21] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-08 03:12:21] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:21] [INFO ] Invariant cache hit.
[2023-03-08 03:12:21] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s11), p0:(GT 2 s10)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 399 ms.
Product exploration explored 100000 steps with 25000 reset in 422 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), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 399987 steps, run visited all 1 properties in 467 ms. (steps per millisecond=856 )
Probabilistic random walk after 399987 steps, saw 296321 distinct states, run finished after 467 ms. (steps per millisecond=856 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:24] [INFO ] Invariant cache hit.
[2023-03-08 03:12:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 03:12:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:24] [INFO ] Invariant cache hit.
[2023-03-08 03:12:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 03:12:24] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:24] [INFO ] Invariant cache hit.
[2023-03-08 03:12:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 14/14 places, 16/16 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 : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 399987 steps, run visited all 1 properties in 642 ms. (steps per millisecond=623 )
Probabilistic random walk after 399987 steps, saw 296321 distinct states, run finished after 642 ms. (steps per millisecond=623 ) properties seen :1
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 133 ms.
Product exploration explored 100000 steps with 25000 reset in 154 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:26] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 03:12:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:26] [INFO ] Invariant cache hit.
[2023-03-08 03:12:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:26] [INFO ] Invariant cache hit.
[2023-03-08 03:12:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 03:12:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:26] [INFO ] Invariant cache hit.
[2023-03-08 03:12:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:26] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 03:12:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:26] [INFO ] Invariant cache hit.
[2023-03-08 03:12:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 14/14 places, 16/16 transitions.
Treatment of property CircadianClock-PT-010000-LTLCardinality-13 finished in 5259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U G(p2))&&p0)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:26] [INFO ] Invariant cache hit.
[2023-03-08 03:12:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 03:12:26] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:26] [INFO ] Invariant cache hit.
[2023-03-08 03:12:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 03:12:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:27] [INFO ] Invariant cache hit.
[2023-03-08 03:12:27] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ s5 s1) (LEQ 3 s7)), p2:(LEQ s7 s4), p1:(LEQ 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-14 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&G(p1)))&&G(p2))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 03:12:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:27] [INFO ] Invariant cache hit.
[2023-03-08 03:12:27] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 03:12:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:27] [INFO ] Invariant cache hit.
[2023-03-08 03:12:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 03:12:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 03:12:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 03:12:27] [INFO ] Invariant cache hit.
[2023-03-08 03:12:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 14/14 places, 16/16 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CircadianClock-PT-010000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(GT s8 s10), p0:(OR (LEQ 3 s10) (LEQ s8 s10)), p1:(LEQ s2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircadianClock-PT-010000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircadianClock-PT-010000-LTLCardinality-15 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0&&F(p1)))||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1))))&&F(p1)))'
[2023-03-08 03:12:28] [INFO ] Flatten gal took : 6 ms
[2023-03-08 03:12:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 03:12:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 16 transitions and 58 arcs took 0 ms.
Total runtime 64468 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CircadianClock-PT-010000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality
FORMULA CircadianClock-PT-010000-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678245179420
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 9 (type EXCL) for 6 CircadianClock-PT-010000-LTLCardinality-13
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for CircadianClock-PT-010000-LTLCardinality-13
lola: result : true
lola: markings : 25
lola: fired transitions : 38
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CircadianClock-PT-010000-LTLCardinality-03
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircadianClock-PT-010000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-13: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 9/32 CircadianClock-PT-010000-LTLCardinality-03 1369870 m, 273974 m/sec, 5480973 t fired, .
Time elapsed: 5 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircadianClock-PT-010000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-13: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 18/32 CircadianClock-PT-010000-LTLCardinality-03 2655891 m, 257204 m/sec, 10881070 t fired, .
Time elapsed: 10 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircadianClock-PT-010000-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-13: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 26/32 CircadianClock-PT-010000-LTLCardinality-03 3886169 m, 246055 m/sec, 16031239 t fired, .
Time elapsed: 15 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for CircadianClock-PT-010000-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircadianClock-PT-010000-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
CircadianClock-PT-010000-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CircadianClock-PT-010000-LTLCardinality-13: CONJ 0 1 0 0 3 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 13 (type EXCL) for 6 CircadianClock-PT-010000-LTLCardinality-13
lola: time limit : 1790 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for CircadianClock-PT-010000-LTLCardinality-13
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 CircadianClock-PT-010000-LTLCardinality-09
lola: time limit : 3580 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircadianClock-PT-010000-LTLCardinality-13: CONJ true CONJ
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircadianClock-PT-010000-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
CircadianClock-PT-010000-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3580 21/32 CircadianClock-PT-010000-LTLCardinality-09 3105389 m, 621077 m/sec, 4656009 t fired, .
Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for CircadianClock-PT-010000-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircadianClock-PT-010000-LTLCardinality-13: CONJ true CONJ
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CircadianClock-PT-010000-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
CircadianClock-PT-010000-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CircadianClock-PT-010000-LTLCardinality-03: LTL unknown AGGR
CircadianClock-PT-010000-LTLCardinality-09: LTL unknown AGGR
CircadianClock-PT-010000-LTLCardinality-13: CONJ true CONJ
Time elapsed: 30 secs. Pages in use: 32
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="CircadianClock-PT-010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is CircadianClock-PT-010000, 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 r071-smll-167814397600131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-010000.tgz
mv CircadianClock-PT-010000 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 '
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 ;