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.r298-tall-167873952000674.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 marciexred
Input is PolyORBNT-COL-S10J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952000674
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 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 PolyORBNT-COL-S10J20-CTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679630188748

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 03:56:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 03:56:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 03:56:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 03:56:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 03:56:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 490 ms
[2023-03-24 03:56:30] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2023-03-24 03:56:31] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 03:56:31] [INFO ] Skeletonized 15 HLPN properties in 1 ms. Removed 1 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10006 steps, including 572 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :16
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 03:56:31] [INFO ] Computed 13 place invariants in 15 ms
[2023-03-24 03:56:31] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-24 03:56:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 03:56:31] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:1
[2023-03-24 03:56:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 03:56:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 03:56:31] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-24 03:56:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:56:31] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :6 sat :1
[2023-03-24 03:56:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
[2023-03-24 03:56:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-24 03:56:31] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-24 03:56:31] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 21 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-24 03:56:31] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-24 03:56:31] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 739 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 304 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 17 ms. (steps per millisecond=81 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
[2023-03-24 03:56:32] [INFO ] Flatten gal took : 23 ms
[2023-03-24 03:56:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-COL-S10J20-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 03:56:32] [INFO ] Flatten gal took : 9 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 03:56:32] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 209 ms.
[2023-03-24 03:56:32] [INFO ] Unfolded 15 HLPN properties in 7 ms.
[2023-03-24 03:56:32] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 03:56:32] [INFO ] Reduced 9285 identical enabling conditions.
Deduced a syphon composed of 20 places in 22 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 241 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 48 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
[2023-03-24 03:56:32] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-24 03:56:32] [INFO ] Computed 72 place invariants in 67 ms
[2023-03-24 03:56:33] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 03:56:33] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2023-03-24 03:56:33] [INFO ] Computed 72 place invariants in 56 ms
[2023-03-24 03:56:33] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-24 03:56:33] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 03:56:33] [INFO ] Invariant cache hit.
[2023-03-24 03:56:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:56:35] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 12 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2628 ms. Remains : 474/474 places, 1035/1650 transitions.
Support contains 241 out of 474 places after structural reductions.
[2023-03-24 03:56:35] [INFO ] Flatten gal took : 237 ms
[2023-03-24 03:56:36] [INFO ] Flatten gal took : 198 ms
[2023-03-24 03:56:37] [INFO ] Input system was already deterministic with 1035 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 1340 ms. (steps per millisecond=7 ) properties (out of 55) seen :9
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 46) seen :23
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 23) seen :4
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=9 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-24 03:56:39] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 03:56:39] [INFO ] Invariant cache hit.
[2023-03-24 03:56:41] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-24 03:56:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-24 03:56:41] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:4
[2023-03-24 03:56:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-24 03:56:41] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-24 03:56:41] [INFO ] After 574ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2023-03-24 03:56:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:56:42] [INFO ] After 305ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :9 sat :2
[2023-03-24 03:56:42] [INFO ] Deduced a trap composed of 215 places in 307 ms of which 1 ms to minimize.
[2023-03-24 03:56:43] [INFO ] Deduced a trap composed of 221 places in 252 ms of which 1 ms to minimize.
[2023-03-24 03:56:43] [INFO ] Deduced a trap composed of 205 places in 227 ms of which 1 ms to minimize.
[2023-03-24 03:56:43] [INFO ] Deduced a trap composed of 215 places in 256 ms of which 1 ms to minimize.
[2023-03-24 03:56:43] [INFO ] Deduced a trap composed of 209 places in 246 ms of which 1 ms to minimize.
[2023-03-24 03:56:44] [INFO ] Deduced a trap composed of 217 places in 247 ms of which 1 ms to minimize.
[2023-03-24 03:56:44] [INFO ] Deduced a trap composed of 215 places in 235 ms of which 0 ms to minimize.
[2023-03-24 03:56:44] [INFO ] Deduced a trap composed of 217 places in 243 ms of which 0 ms to minimize.
[2023-03-24 03:56:45] [INFO ] Deduced a trap composed of 223 places in 224 ms of which 1 ms to minimize.
[2023-03-24 03:56:45] [INFO ] Deduced a trap composed of 215 places in 240 ms of which 0 ms to minimize.
[2023-03-24 03:56:45] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 0 ms to minimize.
[2023-03-24 03:56:45] [INFO ] Deduced a trap composed of 213 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:56:46] [INFO ] Deduced a trap composed of 219 places in 225 ms of which 2 ms to minimize.
[2023-03-24 03:56:46] [INFO ] Deduced a trap composed of 215 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:56:46] [INFO ] Deduced a trap composed of 217 places in 236 ms of which 1 ms to minimize.
[2023-03-24 03:56:47] [INFO ] Deduced a trap composed of 219 places in 215 ms of which 0 ms to minimize.
[2023-03-24 03:56:47] [INFO ] Deduced a trap composed of 215 places in 243 ms of which 0 ms to minimize.
[2023-03-24 03:56:47] [INFO ] Deduced a trap composed of 219 places in 243 ms of which 0 ms to minimize.
[2023-03-24 03:56:48] [INFO ] Deduced a trap composed of 221 places in 244 ms of which 1 ms to minimize.
[2023-03-24 03:56:48] [INFO ] Deduced a trap composed of 221 places in 216 ms of which 0 ms to minimize.
[2023-03-24 03:56:48] [INFO ] Deduced a trap composed of 215 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:56:48] [INFO ] Deduced a trap composed of 217 places in 234 ms of which 0 ms to minimize.
[2023-03-24 03:56:49] [INFO ] Deduced a trap composed of 217 places in 239 ms of which 1 ms to minimize.
[2023-03-24 03:56:49] [INFO ] Deduced a trap composed of 217 places in 243 ms of which 0 ms to minimize.
[2023-03-24 03:56:49] [INFO ] Deduced a trap composed of 213 places in 237 ms of which 1 ms to minimize.
[2023-03-24 03:56:50] [INFO ] Deduced a trap composed of 213 places in 238 ms of which 0 ms to minimize.
[2023-03-24 03:56:50] [INFO ] Deduced a trap composed of 219 places in 242 ms of which 0 ms to minimize.
[2023-03-24 03:56:50] [INFO ] Deduced a trap composed of 220 places in 221 ms of which 0 ms to minimize.
[2023-03-24 03:56:50] [INFO ] Deduced a trap composed of 222 places in 214 ms of which 0 ms to minimize.
[2023-03-24 03:56:51] [INFO ] Deduced a trap composed of 215 places in 222 ms of which 2 ms to minimize.
[2023-03-24 03:56:51] [INFO ] Deduced a trap composed of 217 places in 241 ms of which 0 ms to minimize.
[2023-03-24 03:56:51] [INFO ] Deduced a trap composed of 209 places in 223 ms of which 1 ms to minimize.
[2023-03-24 03:56:52] [INFO ] Deduced a trap composed of 217 places in 246 ms of which 4 ms to minimize.
[2023-03-24 03:56:52] [INFO ] Deduced a trap composed of 215 places in 218 ms of which 1 ms to minimize.
[2023-03-24 03:56:53] [INFO ] Deduced a trap composed of 215 places in 243 ms of which 0 ms to minimize.
[2023-03-24 03:56:53] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 1 ms to minimize.
[2023-03-24 03:56:53] [INFO ] Deduced a trap composed of 218 places in 244 ms of which 1 ms to minimize.
[2023-03-24 03:56:53] [INFO ] Deduced a trap composed of 211 places in 250 ms of which 1 ms to minimize.
[2023-03-24 03:56:54] [INFO ] Deduced a trap composed of 213 places in 245 ms of which 1 ms to minimize.
[2023-03-24 03:56:54] [INFO ] Deduced a trap composed of 227 places in 247 ms of which 1 ms to minimize.
[2023-03-24 03:56:54] [INFO ] Deduced a trap composed of 219 places in 243 ms of which 1 ms to minimize.
[2023-03-24 03:56:55] [INFO ] Deduced a trap composed of 215 places in 242 ms of which 0 ms to minimize.
[2023-03-24 03:56:55] [INFO ] Deduced a trap composed of 213 places in 242 ms of which 1 ms to minimize.
[2023-03-24 03:56:56] [INFO ] Deduced a trap composed of 219 places in 245 ms of which 1 ms to minimize.
[2023-03-24 03:56:56] [INFO ] Deduced a trap composed of 217 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:56:56] [INFO ] Deduced a trap composed of 215 places in 244 ms of which 1 ms to minimize.
[2023-03-24 03:56:57] [INFO ] Deduced a trap composed of 219 places in 247 ms of which 0 ms to minimize.
[2023-03-24 03:56:58] [INFO ] Deduced a trap composed of 215 places in 241 ms of which 1 ms to minimize.
[2023-03-24 03:56:58] [INFO ] Deduced a trap composed of 219 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:56:58] [INFO ] Deduced a trap composed of 219 places in 244 ms of which 0 ms to minimize.
[2023-03-24 03:56:59] [INFO ] Deduced a trap composed of 221 places in 246 ms of which 1 ms to minimize.
[2023-03-24 03:56:59] [INFO ] Deduced a trap composed of 217 places in 242 ms of which 1 ms to minimize.
[2023-03-24 03:57:00] [INFO ] Deduced a trap composed of 219 places in 240 ms of which 1 ms to minimize.
[2023-03-24 03:57:00] [INFO ] Deduced a trap composed of 217 places in 217 ms of which 1 ms to minimize.
[2023-03-24 03:57:01] [INFO ] Deduced a trap composed of 211 places in 241 ms of which 1 ms to minimize.
[2023-03-24 03:57:01] [INFO ] Deduced a trap composed of 215 places in 238 ms of which 1 ms to minimize.
[2023-03-24 03:57:01] [INFO ] Deduced a trap composed of 219 places in 240 ms of which 0 ms to minimize.
[2023-03-24 03:57:02] [INFO ] Deduced a trap composed of 219 places in 241 ms of which 0 ms to minimize.
[2023-03-24 03:57:02] [INFO ] Deduced a trap composed of 209 places in 240 ms of which 0 ms to minimize.
[2023-03-24 03:57:02] [INFO ] Deduced a trap composed of 219 places in 221 ms of which 1 ms to minimize.
[2023-03-24 03:57:03] [INFO ] Deduced a trap composed of 217 places in 242 ms of which 0 ms to minimize.
[2023-03-24 03:57:03] [INFO ] Deduced a trap composed of 227 places in 242 ms of which 1 ms to minimize.
[2023-03-24 03:57:04] [INFO ] Deduced a trap composed of 221 places in 241 ms of which 1 ms to minimize.
[2023-03-24 03:57:06] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 23828 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 03:57:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:57:06] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0 real:4
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 24 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1009
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1009
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 984
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 984
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 983
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 983
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 981
Applied a total of 118 rules in 109 ms. Remains 410 /474 variables (removed 64) and now considering 981/1035 (removed 54) transitions.
[2023-03-24 03:57:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 03:57:06] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-24 03:57:06] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 410/474 places, 981/1035 transitions.
Incomplete random walk after 10000 steps, including 731 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 03:57:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 03:57:06] [INFO ] Invariant cache hit.
[2023-03-24 03:57:07] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 03:57:07] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-24 03:57:07] [INFO ] After 231ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 03:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:57:07] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:57:07] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:57:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-24 03:57:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-24 03:57:07] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:57:07] [INFO ] After 129ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 03:57:08] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 1 ms to minimize.
[2023-03-24 03:57:08] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 2 ms to minimize.
[2023-03-24 03:57:08] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 5 ms to minimize.
[2023-03-24 03:57:08] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:57:09] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:57:09] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 1 ms to minimize.
[2023-03-24 03:57:09] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-24 03:57:09] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2023-03-24 03:57:10] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:10] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 0 ms to minimize.
[2023-03-24 03:57:10] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-24 03:57:11] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 1 ms to minimize.
[2023-03-24 03:57:11] [INFO ] Deduced a trap composed of 154 places in 218 ms of which 1 ms to minimize.
[2023-03-24 03:57:11] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 1 ms to minimize.
[2023-03-24 03:57:11] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-24 03:57:12] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:12] [INFO ] Deduced a trap composed of 175 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:12] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-24 03:57:13] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 0 ms to minimize.
[2023-03-24 03:57:13] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:57:13] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 0 ms to minimize.
[2023-03-24 03:57:13] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2023-03-24 03:57:14] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:57:14] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 0 ms to minimize.
[2023-03-24 03:57:14] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:57:14] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:57:15] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:57:15] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 1 ms to minimize.
[2023-03-24 03:57:15] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-24 03:57:15] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:57:16] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:57:16] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:57:16] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2023-03-24 03:57:17] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2023-03-24 03:57:17] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:57:17] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:57:17] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:57:18] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:57:18] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2023-03-24 03:57:18] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2023-03-24 03:57:18] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:57:19] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:19] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 0 ms to minimize.
[2023-03-24 03:57:19] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 1 ms to minimize.
[2023-03-24 03:57:19] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2023-03-24 03:57:20] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:57:20] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:57:20] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2023-03-24 03:57:21] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2023-03-24 03:57:21] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 0 ms to minimize.
[2023-03-24 03:57:21] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2023-03-24 03:57:22] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 0 ms to minimize.
[2023-03-24 03:57:22] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-24 03:57:22] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:57:22] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2023-03-24 03:57:23] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 0 ms to minimize.
[2023-03-24 03:57:23] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:23] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:57:23] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2023-03-24 03:57:24] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:57:24] [INFO ] Deduced a trap composed of 175 places in 235 ms of which 0 ms to minimize.
[2023-03-24 03:57:24] [INFO ] Deduced a trap composed of 177 places in 221 ms of which 1 ms to minimize.
[2023-03-24 03:57:25] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:25] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-24 03:57:25] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2023-03-24 03:57:26] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 0 ms to minimize.
[2023-03-24 03:57:26] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:27] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:57:27] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:27] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:28] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-24 03:57:29] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-24 03:57:29] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:29] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2023-03-24 03:57:29] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2023-03-24 03:57:30] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-24 03:57:30] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2023-03-24 03:57:30] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-24 03:57:31] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 1 ms to minimize.
[2023-03-24 03:57:31] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 1 ms to minimize.
[2023-03-24 03:57:31] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:57:31] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-24 03:57:32] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 1 ms to minimize.
[2023-03-24 03:57:32] [INFO ] Trap strengthening (SAT) tested/added 83/83 trap constraints in 24567 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 03:57:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:57:32] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 714 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 516033 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 516033 steps, saw 83932 distinct states, run finished after 3002 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 03:57:35] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 03:57:35] [INFO ] Invariant cache hit.
[2023-03-24 03:57:35] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-24 03:57:35] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-24 03:57:35] [INFO ] After 233ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 03:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:57:35] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:57:35] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:57:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 03:57:36] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-24 03:57:36] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:57:36] [INFO ] After 121ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 03:57:36] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:36] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 1 ms to minimize.
[2023-03-24 03:57:37] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-24 03:57:37] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:57:37] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:57:37] [INFO ] Deduced a trap composed of 152 places in 227 ms of which 0 ms to minimize.
[2023-03-24 03:57:38] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2023-03-24 03:57:38] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:57:38] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:57:38] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:57:39] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:39] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:39] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:57:40] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2023-03-24 03:57:40] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2023-03-24 03:57:40] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 1 ms to minimize.
[2023-03-24 03:57:41] [INFO ] Deduced a trap composed of 175 places in 232 ms of which 0 ms to minimize.
[2023-03-24 03:57:41] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 1 ms to minimize.
[2023-03-24 03:57:41] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:57:41] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-24 03:57:42] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:57:42] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:57:42] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:57:42] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:57:43] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:57:43] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:57:43] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:57:43] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:57:44] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:57:44] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:57:44] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:57:44] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:57:45] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-24 03:57:45] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2023-03-24 03:57:45] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:57:46] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:57:46] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-24 03:57:46] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 1 ms to minimize.
[2023-03-24 03:57:46] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 0 ms to minimize.
[2023-03-24 03:57:47] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-24 03:57:47] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-24 03:57:47] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-24 03:57:48] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:57:48] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-24 03:57:48] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:48] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:49] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:57:49] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:57:49] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 0 ms to minimize.
[2023-03-24 03:57:50] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:57:50] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:50] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-24 03:57:51] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2023-03-24 03:57:51] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-24 03:57:51] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:57:51] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 1 ms to minimize.
[2023-03-24 03:57:52] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:57:52] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:57:52] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-24 03:57:52] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2023-03-24 03:57:53] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 0 ms to minimize.
[2023-03-24 03:57:53] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 1 ms to minimize.
[2023-03-24 03:57:54] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2023-03-24 03:57:54] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 0 ms to minimize.
[2023-03-24 03:57:54] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 0 ms to minimize.
[2023-03-24 03:57:55] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:57:55] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-24 03:57:55] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-24 03:57:56] [INFO ] Deduced a trap composed of 173 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:56] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 0 ms to minimize.
[2023-03-24 03:57:56] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-24 03:57:57] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2023-03-24 03:57:58] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2023-03-24 03:57:58] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-24 03:57:58] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:58] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2023-03-24 03:57:59] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 0 ms to minimize.
[2023-03-24 03:57:59] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2023-03-24 03:57:59] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 0 ms to minimize.
[2023-03-24 03:57:59] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:58:00] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-24 03:58:00] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:58:00] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 03:58:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:58:01] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 36 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-24 03:58:01] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 03:58:01] [INFO ] Invariant cache hit.
[2023-03-24 03:58:01] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-24 03:58:01] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 03:58:01] [INFO ] Invariant cache hit.
[2023-03-24 03:58:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:58:03] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2023-03-24 03:58:03] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-24 03:58:03] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 03:58:03] [INFO ] Invariant cache hit.
[2023-03-24 03:58:03] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2528 ms. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 107 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-24 03:58:03] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 03:58:03] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 03:58:03] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-24 03:58:03] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:58:03] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-24 03:58:03] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-24 03:58:04] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:58:04] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2023-03-24 03:58:04] [INFO ] Deduced a trap composed of 150 places in 176 ms of which 0 ms to minimize.
[2023-03-24 03:58:04] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:58:04] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:58:05] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:58:05] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:58:05] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:05] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:58:06] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:58:06] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:58:06] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:58:06] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:58:07] [INFO ] Deduced a trap composed of 154 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:07] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:58:07] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:58:07] [INFO ] Deduced a trap composed of 152 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:58:08] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:58:08] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:58:08] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 0 ms to minimize.
[2023-03-24 03:58:08] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:58:09] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2023-03-24 03:58:09] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:58:09] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:58:09] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:58:09] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 2 ms to minimize.
[2023-03-24 03:58:10] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:58:10] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:58:10] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:58:10] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2023-03-24 03:58:10] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:58:11] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 1 ms to minimize.
[2023-03-24 03:58:11] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:58:11] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:58:11] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:12] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:58:12] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:58:12] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2023-03-24 03:58:12] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-24 03:58:12] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 0 ms to minimize.
[2023-03-24 03:58:13] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:58:13] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:58:13] [INFO ] Deduced a trap composed of 163 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:58:13] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:58:14] [INFO ] Deduced a trap composed of 168 places in 175 ms of which 0 ms to minimize.
[2023-03-24 03:58:14] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:58:14] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:58:14] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:58:14] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:58:15] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:58:15] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:58:15] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:58:15] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:58:16] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:58:16] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:58:16] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:58:16] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:58:17] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:58:17] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2023-03-24 03:58:18] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:58:19] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:58:19] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2023-03-24 03:58:19] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:19] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:58:20] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:58:20] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:58:20] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-24 03:58:22] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:22] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:58:23] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 1 ms to minimize.
[2023-03-24 03:58:23] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2023-03-24 03:58:23] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:58:23] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-24 03:58:24] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 1 ms to minimize.
[2023-03-24 03:58:24] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-24 03:58:24] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:58:24] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 0 ms to minimize.
[2023-03-24 03:58:24] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-24 03:58:25] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2023-03-24 03:58:25] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2023-03-24 03:58:25] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2023-03-24 03:58:25] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-24 03:58:25] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2023-03-24 03:58:26] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2023-03-24 03:58:26] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2023-03-24 03:58:26] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-24 03:58:26] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:58:27] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-24 03:58:27] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2023-03-24 03:58:27] [INFO ] Deduced a trap composed of 165 places in 171 ms of which 1 ms to minimize.
[2023-03-24 03:58:27] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 0 ms to minimize.
[2023-03-24 03:58:28] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-24 03:58:28] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 1 ms to minimize.
[2023-03-24 03:58:28] [INFO ] Deduced a trap composed of 163 places in 170 ms of which 0 ms to minimize.
[2023-03-24 03:58:28] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 1 ms to minimize.
[2023-03-24 03:58:28] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2023-03-24 03:58:29] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:58:29] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2023-03-24 03:58:29] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:58:29] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:30] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:58:30] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:30] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 4 ms to minimize.
[2023-03-24 03:58:30] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-24 03:58:31] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:58:31] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:58:31] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 0 ms to minimize.
[2023-03-24 03:58:31] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:58:31] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:58:32] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:58:32] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:58:32] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:58:32] [INFO ] Deduced a trap composed of 156 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:58:33] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2023-03-24 03:58:33] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:58:33] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:58:33] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:58:33] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:58:34] [INFO ] Deduced a trap composed of 170 places in 178 ms of which 1 ms to minimize.
[2023-03-24 03:58:34] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-24 03:58:34] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2023-03-24 03:58:34] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:58:35] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-24 03:58:35] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:58:35] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:58:36] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:58:36] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:58:36] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:58:37] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:58:37] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:58:37] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:58:37] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:58:37] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:58:38] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:58:38] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:58:38] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-24 03:58:38] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:58:39] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-24 03:58:39] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:58:39] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2023-03-24 03:58:39] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:58:40] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:58:40] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:58:40] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:58:40] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:58:40] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 1 ms to minimize.
[2023-03-24 03:58:41] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 0 ms to minimize.
[2023-03-24 03:58:41] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-24 03:58:41] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2023-03-24 03:58:43] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2023-03-24 03:58:43] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-24 03:58:43] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-24 03:58:52] [INFO ] Trap strengthening (SAT) tested/added 151/151 trap constraints in 48684 ms
[2023-03-24 03:58:53] [INFO ] After 49322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 03:58:53] [INFO ] After 49393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 9 atomic propositions for a total of 15 simplifications.
[2023-03-24 03:58:53] [INFO ] Flatten gal took : 126 ms
[2023-03-24 03:58:54] [INFO ] Flatten gal took : 142 ms
[2023-03-24 03:58:55] [INFO ] Input system was already deterministic with 1035 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 25 rules applied. Total rules applied 29 place count 460 transition count 1010
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 439 transition count 1009
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 438 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 437 transition count 1008
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 437 transition count 1008
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 435 transition count 1006
Applied a total of 58 rules in 94 ms. Remains 435 /474 variables (removed 39) and now considering 1006/1035 (removed 29) transitions.
[2023-03-24 03:58:55] [INFO ] Flow matrix only has 997 transitions (discarded 9 similar events)
// Phase 1: matrix 997 rows 435 cols
[2023-03-24 03:58:55] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-24 03:58:55] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 560 ms. Remains : 435/474 places, 1006/1035 transitions.
[2023-03-24 03:58:55] [INFO ] Flatten gal took : 59 ms
[2023-03-24 03:58:55] [INFO ] Flatten gal took : 69 ms
[2023-03-24 03:58:56] [INFO ] Input system was already deterministic with 1006 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 20 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:58:56] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 03:58:56] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-24 03:58:56] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:58:56] [INFO ] Flatten gal took : 48 ms
[2023-03-24 03:58:56] [INFO ] Flatten gal took : 51 ms
[2023-03-24 03:58:56] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 8 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 03:58:56] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2023-03-24 03:58:56] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-24 03:58:57] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 464/474 places, 1035/1035 transitions.
[2023-03-24 03:58:57] [INFO ] Flatten gal took : 44 ms
[2023-03-24 03:58:57] [INFO ] Flatten gal took : 49 ms
[2023-03-24 03:58:57] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 14 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:58:57] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 03:58:57] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 03:58:58] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:58:58] [INFO ] Flatten gal took : 48 ms
[2023-03-24 03:58:58] [INFO ] Flatten gal took : 56 ms
[2023-03-24 03:58:58] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 17 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:58:58] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 03:58:58] [INFO ] Invariant cache hit.
[2023-03-24 03:58:58] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:58:58] [INFO ] Flatten gal took : 44 ms
[2023-03-24 03:58:58] [INFO ] Flatten gal took : 45 ms
[2023-03-24 03:58:58] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 14 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:58:58] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 03:58:58] [INFO ] Invariant cache hit.
[2023-03-24 03:58:59] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:58:59] [INFO ] Flatten gal took : 44 ms
[2023-03-24 03:58:59] [INFO ] Flatten gal took : 45 ms
[2023-03-24 03:58:59] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Applied a total of 0 rules in 6 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 03:58:59] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2023-03-24 03:58:59] [INFO ] Computed 72 place invariants in 20 ms
[2023-03-24 03:59:00] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 474/474 places, 1035/1035 transitions.
[2023-03-24 03:59:00] [INFO ] Flatten gal took : 67 ms
[2023-03-24 03:59:00] [INFO ] Flatten gal took : 84 ms
[2023-03-24 03:59:00] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 13 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:59:00] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 03:59:00] [INFO ] Computed 62 place invariants in 20 ms
[2023-03-24 03:59:01] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:59:01] [INFO ] Flatten gal took : 48 ms
[2023-03-24 03:59:01] [INFO ] Flatten gal took : 57 ms
[2023-03-24 03:59:01] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 7 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 03:59:01] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2023-03-24 03:59:01] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-24 03:59:01] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 464/474 places, 1035/1035 transitions.
[2023-03-24 03:59:01] [INFO ] Flatten gal took : 42 ms
[2023-03-24 03:59:01] [INFO ] Flatten gal took : 46 ms
[2023-03-24 03:59:02] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 7 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 03:59:02] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 03:59:02] [INFO ] Invariant cache hit.
[2023-03-24 03:59:02] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 464/474 places, 1035/1035 transitions.
[2023-03-24 03:59:02] [INFO ] Flatten gal took : 47 ms
[2023-03-24 03:59:02] [INFO ] Flatten gal took : 47 ms
[2023-03-24 03:59:02] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 14 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:59:02] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 03:59:02] [INFO ] Computed 62 place invariants in 18 ms
[2023-03-24 03:59:03] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:59:03] [INFO ] Flatten gal took : 42 ms
[2023-03-24 03:59:03] [INFO ] Flatten gal took : 45 ms
[2023-03-24 03:59:03] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Applied a total of 0 rules in 5 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 03:59:03] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2023-03-24 03:59:03] [INFO ] Computed 72 place invariants in 18 ms
[2023-03-24 03:59:03] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 474/474 places, 1035/1035 transitions.
[2023-03-24 03:59:04] [INFO ] Flatten gal took : 54 ms
[2023-03-24 03:59:04] [INFO ] Flatten gal took : 64 ms
[2023-03-24 03:59:04] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 14 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:59:04] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 03:59:04] [INFO ] Computed 62 place invariants in 17 ms
[2023-03-24 03:59:04] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:59:04] [INFO ] Flatten gal took : 41 ms
[2023-03-24 03:59:04] [INFO ] Flatten gal took : 44 ms
[2023-03-24 03:59:04] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 474 transition count 1014
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 453 transition count 1014
Applied a total of 42 rules in 29 ms. Remains 453 /474 variables (removed 21) and now considering 1014/1035 (removed 21) transitions.
[2023-03-24 03:59:05] [INFO ] Flow matrix only has 1005 transitions (discarded 9 similar events)
// Phase 1: matrix 1005 rows 453 cols
[2023-03-24 03:59:05] [INFO ] Computed 72 place invariants in 13 ms
[2023-03-24 03:59:05] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 508 ms. Remains : 453/474 places, 1014/1035 transitions.
[2023-03-24 03:59:05] [INFO ] Flatten gal took : 50 ms
[2023-03-24 03:59:05] [INFO ] Flatten gal took : 59 ms
[2023-03-24 03:59:05] [INFO ] Input system was already deterministic with 1014 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 18 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 03:59:05] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 03:59:05] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-24 03:59:06] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 03:59:06] [INFO ] Flatten gal took : 41 ms
[2023-03-24 03:59:06] [INFO ] Flatten gal took : 44 ms
[2023-03-24 03:59:06] [INFO ] Input system was already deterministic with 1034 transitions.
[2023-03-24 03:59:06] [INFO ] Flatten gal took : 153 ms
[2023-03-24 03:59:07] [INFO ] Flatten gal took : 133 ms
[2023-03-24 03:59:08] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 46 ms.
[2023-03-24 03:59:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 1035 transitions and 6944 arcs took 7 ms.
Total runtime 158130 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 474 NrTr: 1035 NrArc: 6944)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.095sec

net check time: 0m 0.001sec

init dd package: 0m 2.771sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6427752 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16085820 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.004sec

885405 2596555

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="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PolyORBNT-COL-S10J20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952000674"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;