About the Execution of Smart+red for RERS2020-PT-pb103
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3295.168 | 1800000.00 | 2040076.00 | 5474.70 | [undef] | Time out reached |
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.r345-tall-167889216700148.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 smartxred
Input is RERS2020-PT-pb103, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r345-tall-167889216700148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1679135756088
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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 10:35:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 10:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:35:58] [INFO ] Load time of PNML (sax parser for PT used): 787 ms
[2023-03-18 10:35:58] [INFO ] Transformed 520 places.
[2023-03-18 10:35:58] [INFO ] Transformed 31658 transitions.
[2023-03-18 10:35:58] [INFO ] Found NUPN structural information;
[2023-03-18 10:35:58] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 992 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 907 ms. (steps per millisecond=11 ) properties (out of 520) seen :199
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 321) seen :2
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 319) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 319) seen :1
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 318) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 318) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 317) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 316) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 315) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 315) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 314) seen :0
Running SMT prover for 314 properties.
[2023-03-18 10:36:00] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 10:36:00] [INFO ] Computed 15 place invariants in 108 ms
[2023-03-18 10:36:07] [INFO ] After 3863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:314
[2023-03-18 10:36:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-18 10:36:09] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 10:36:32] [INFO ] After 20189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :314
[2023-03-18 10:36:32] [INFO ] State equation strengthened by 1379 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:36:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:36:32] [INFO ] After 25262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:314
Fused 314 Parikh solutions to 49 different solutions.
Parikh walk visited 0 properties in 199 ms.
Support contains 314 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 1077 place count 513 transition count 27359
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 1172 place count 505 transition count 27272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1173 place count 504 transition count 27271
Applied a total of 1173 rules in 580 ms. Remains 504 /520 variables (removed 16) and now considering 27271/28429 (removed 1158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 504/520 places, 27271/28429 transitions.
Interrupted random walk after 468726 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 282) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 263) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 256) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 248) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 242) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 242) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 237) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 235) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 233) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 232) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 228) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 226) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 225) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 224) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 223) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 222) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:37:09] [INFO ] Flow matrix only has 18595 transitions (discarded 8676 similar events)
// Phase 1: matrix 18595 rows 504 cols
[2023-03-18 10:37:09] [INFO ] Computed 8 place invariants in 92 ms
[2023-03-18 10:37:13] [INFO ] After 2250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:37:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 10:38:31] [INFO ] After 75397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:38:31] [INFO ] State equation strengthened by 1371 read => feed constraints.
[2023-03-18 10:40:58] [INFO ] After 146037ms SMT Verify possible using 1371 Read/Feed constraints in natural domain returned unsat :0 sat :219
[2023-03-18 10:40:58] [INFO ] After 146042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :219
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 10:40:58] [INFO ] After 225042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :219
Parikh walk visited 0 properties in 558 ms.
Support contains 221 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 27271/27271 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 27270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 503 transition count 27270
Applied a total of 2 rules in 318 ms. Remains 503 /504 variables (removed 1) and now considering 27270/27271 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 503/504 places, 27270/27271 transitions.
Interrupted random walk after 451957 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1109626 steps, run timeout after 99001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1109626 steps, saw 567853 distinct states, run finished after 99006 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:43:11] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:43:11] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-18 10:43:14] [INFO ] After 2193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:43:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 10:44:28] [INFO ] After 70836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:44:29] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:47:00] [INFO ] After 150961ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :221
[2023-03-18 10:47:00] [INFO ] After 150963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :221
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 10:47:00] [INFO ] After 225088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :221
Fused 221 Parikh solutions to 220 different solutions.
Parikh walk visited 0 properties in 656 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 116 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 116 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 10:47:00] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:47:00] [INFO ] Invariant cache hit.
[2023-03-18 10:47:01] [INFO ] Implicit Places using invariants in 648 ms returned []
Implicit Place search using SMT only with invariants took 649 ms to find 0 implicit places.
[2023-03-18 10:47:01] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:47:01] [INFO ] Invariant cache hit.
[2023-03-18 10:47:10] [INFO ] Dead Transitions using invariants and state equation in 8773 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9543 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 5886 ms. (steps per millisecond=16 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:47:16] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:47:16] [INFO ] Invariant cache hit.
[2023-03-18 10:47:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:47:25] [INFO ] After 8212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 10:47:26] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:47:45] [INFO ] After 19447ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 10:47:47] [INFO ] Deduced a trap composed of 79 places in 1152 ms of which 6 ms to minimize.
[2023-03-18 10:47:48] [INFO ] Deduced a trap composed of 101 places in 1095 ms of which 12 ms to minimize.
[2023-03-18 10:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3700 ms
[2023-03-18 10:47:53] [INFO ] Deduced a trap composed of 85 places in 1452 ms of which 1 ms to minimize.
[2023-03-18 10:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2186 ms
[2023-03-18 10:47:55] [INFO ] Deduced a trap composed of 128 places in 1648 ms of which 2 ms to minimize.
[2023-03-18 10:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2422 ms
[2023-03-18 10:48:01] [INFO ] Deduced a trap composed of 125 places in 1438 ms of which 2 ms to minimize.
[2023-03-18 10:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2230 ms
[2023-03-18 10:48:04] [INFO ] Deduced a trap composed of 155 places in 1675 ms of which 1 ms to minimize.
[2023-03-18 10:48:06] [INFO ] Deduced a trap composed of 92 places in 1838 ms of which 1 ms to minimize.
[2023-03-18 10:48:08] [INFO ] Deduced a trap composed of 136 places in 1695 ms of which 1 ms to minimize.
[2023-03-18 10:48:10] [INFO ] Deduced a trap composed of 149 places in 1383 ms of which 0 ms to minimize.
[2023-03-18 10:48:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8412 ms
[2023-03-18 10:48:12] [INFO ] Deduced a trap composed of 72 places in 1179 ms of which 0 ms to minimize.
[2023-03-18 10:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1998 ms
[2023-03-18 10:48:17] [INFO ] Deduced a trap composed of 49 places in 1309 ms of which 1 ms to minimize.
[2023-03-18 10:48:19] [INFO ] Deduced a trap composed of 95 places in 1190 ms of which 0 ms to minimize.
[2023-03-18 10:48:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3665 ms
[2023-03-18 10:48:24] [INFO ] Deduced a trap composed of 145 places in 1970 ms of which 0 ms to minimize.
[2023-03-18 10:48:26] [INFO ] Deduced a trap composed of 84 places in 1919 ms of which 1 ms to minimize.
[2023-03-18 10:48:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5014 ms
[2023-03-18 10:48:29] [INFO ] Deduced a trap composed of 60 places in 1814 ms of which 1 ms to minimize.
[2023-03-18 10:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2585 ms
[2023-03-18 10:48:34] [INFO ] Deduced a trap composed of 187 places in 1646 ms of which 1 ms to minimize.
[2023-03-18 10:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2397 ms
[2023-03-18 10:48:40] [INFO ] Deduced a trap composed of 11 places in 869 ms of which 0 ms to minimize.
[2023-03-18 10:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1663 ms
[2023-03-18 10:48:43] [INFO ] Deduced a trap composed of 13 places in 916 ms of which 0 ms to minimize.
[2023-03-18 10:48:44] [INFO ] Deduced a trap composed of 49 places in 839 ms of which 1 ms to minimize.
[2023-03-18 10:48:45] [INFO ] Deduced a trap composed of 53 places in 845 ms of which 10 ms to minimize.
[2023-03-18 10:48:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4122 ms
[2023-03-18 10:48:50] [INFO ] Deduced a trap composed of 136 places in 1711 ms of which 1 ms to minimize.
[2023-03-18 10:48:51] [INFO ] Deduced a trap composed of 163 places in 1379 ms of which 1 ms to minimize.
[2023-03-18 10:48:53] [INFO ] Deduced a trap composed of 94 places in 1590 ms of which 1 ms to minimize.
[2023-03-18 10:48:55] [INFO ] Deduced a trap composed of 48 places in 1415 ms of which 1 ms to minimize.
[2023-03-18 10:48:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7954 ms
[2023-03-18 10:48:57] [INFO ] After 91281ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :178 real:43
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 10:48:57] [INFO ] After 100077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :178 real:43
[2023-03-18 10:48:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 10:49:05] [INFO ] After 8139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:50:37] [INFO ] After 91673ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :220
[2023-03-18 10:50:37] [INFO ] After 91674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :220
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 10:50:37] [INFO ] After 100043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :220
Interrupted random walk after 530861 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1126104 steps, run timeout after 102001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1126104 steps, saw 574899 distinct states, run finished after 102002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:52:53] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:52:53] [INFO ] Invariant cache hit.
[2023-03-18 10:52:56] [INFO ] After 2113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:52:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 10:54:12] [INFO ] After 72561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:54:12] [INFO ] State equation strengthened by 1370 read => feed constraints.
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
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.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:56:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:56:41] [INFO ] After 225049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:221
Parikh walk visited 0 properties in 689 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 128 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 116 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 10:56:42] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:56:42] [INFO ] Invariant cache hit.
[2023-03-18 10:56:43] [INFO ] Implicit Places using invariants in 591 ms returned []
Implicit Place search using SMT only with invariants took 593 ms to find 0 implicit places.
[2023-03-18 10:56:43] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:56:43] [INFO ] Invariant cache hit.
[2023-03-18 10:56:51] [INFO ] Dead Transitions using invariants and state equation in 8469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9182 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 6783 ms. (steps per millisecond=14 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:56:58] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:56:58] [INFO ] Invariant cache hit.
[2023-03-18 10:56:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:57:07] [INFO ] After 7373ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 10:57:07] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:57:23] [INFO ] After 16705ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 10:57:25] [INFO ] Deduced a trap composed of 79 places in 1182 ms of which 1 ms to minimize.
[2023-03-18 10:57:26] [INFO ] Deduced a trap composed of 101 places in 1078 ms of which 0 ms to minimize.
[2023-03-18 10:57:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3411 ms
[2023-03-18 10:57:31] [INFO ] Deduced a trap composed of 85 places in 1483 ms of which 1 ms to minimize.
[2023-03-18 10:57:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2328 ms
[2023-03-18 10:57:34] [INFO ] Deduced a trap composed of 128 places in 1912 ms of which 1 ms to minimize.
[2023-03-18 10:57:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2700 ms
[2023-03-18 10:57:39] [INFO ] Deduced a trap composed of 125 places in 1542 ms of which 1 ms to minimize.
[2023-03-18 10:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2349 ms
[2023-03-18 10:57:43] [INFO ] Deduced a trap composed of 155 places in 2019 ms of which 2 ms to minimize.
[2023-03-18 10:57:45] [INFO ] Deduced a trap composed of 92 places in 1876 ms of which 0 ms to minimize.
[2023-03-18 10:57:47] [INFO ] Deduced a trap composed of 136 places in 1847 ms of which 1 ms to minimize.
[2023-03-18 10:57:49] [INFO ] Deduced a trap composed of 149 places in 1591 ms of which 0 ms to minimize.
[2023-03-18 10:57:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 9325 ms
[2023-03-18 10:57:52] [INFO ] Deduced a trap composed of 72 places in 1225 ms of which 1 ms to minimize.
[2023-03-18 10:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2092 ms
[2023-03-18 10:57:57] [INFO ] Deduced a trap composed of 49 places in 1402 ms of which 0 ms to minimize.
[2023-03-18 10:57:59] [INFO ] Deduced a trap composed of 95 places in 1430 ms of which 1 ms to minimize.
[2023-03-18 10:57:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4033 ms
[2023-03-18 10:58:04] [INFO ] Deduced a trap composed of 145 places in 2038 ms of which 1 ms to minimize.
[2023-03-18 10:58:06] [INFO ] Deduced a trap composed of 84 places in 1922 ms of which 1 ms to minimize.
[2023-03-18 10:58:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5184 ms
[2023-03-18 10:58:09] [INFO ] Deduced a trap composed of 60 places in 1687 ms of which 1 ms to minimize.
[2023-03-18 10:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2444 ms
[2023-03-18 10:58:15] [INFO ] Deduced a trap composed of 187 places in 1945 ms of which 2 ms to minimize.
[2023-03-18 10:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2737 ms
[2023-03-18 10:58:21] [INFO ] Deduced a trap composed of 11 places in 979 ms of which 0 ms to minimize.
[2023-03-18 10:58:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1839 ms
[2023-03-18 10:58:24] [INFO ] Deduced a trap composed of 13 places in 1044 ms of which 0 ms to minimize.
[2023-03-18 10:58:25] [INFO ] Deduced a trap composed of 49 places in 978 ms of which 0 ms to minimize.
[2023-03-18 10:58:26] [INFO ] Deduced a trap composed of 53 places in 1005 ms of which 0 ms to minimize.
[2023-03-18 10:58:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4679 ms
[2023-03-18 10:58:32] [INFO ] Deduced a trap composed of 136 places in 1921 ms of which 0 ms to minimize.
[2023-03-18 10:58:34] [INFO ] Deduced a trap composed of 163 places in 1605 ms of which 0 ms to minimize.
[2023-03-18 10:58:35] [INFO ] Deduced a trap composed of 94 places in 1615 ms of which 1 ms to minimize.
[2023-03-18 10:58:38] [INFO ] Deduced a trap composed of 48 places in 1676 ms of which 0 ms to minimize.
[2023-03-18 10:58:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8694 ms
[2023-03-18 10:58:41] [INFO ] Deduced a trap composed of 12 places in 2218 ms of which 1 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:58:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:58:41] [INFO ] After 102249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40876 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40876 steps, saw 28934 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:58:45] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:58:45] [INFO ] Invariant cache hit.
[2023-03-18 10:58:45] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:58:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:58:48] [INFO ] After 3526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:58:48] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:58:54] [INFO ] After 5493ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:58:57] [INFO ] Deduced a trap composed of 60 places in 2042 ms of which 2 ms to minimize.
[2023-03-18 10:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3002 ms
[2023-03-18 10:58:57] [INFO ] After 8920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 489 ms.
[2023-03-18 10:58:58] [INFO ] After 13143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 518 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42081 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42081 steps, saw 29695 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:59:02] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:59:02] [INFO ] Computed 8 place invariants in 63 ms
[2023-03-18 10:59:02] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:59:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:59:06] [INFO ] After 3954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:59:06] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:59:15] [INFO ] After 9275ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:59:18] [INFO ] Deduced a trap composed of 101 places in 1354 ms of which 1 ms to minimize.
[2023-03-18 10:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2605 ms
[2023-03-18 10:59:19] [INFO ] After 12799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 635 ms.
[2023-03-18 10:59:20] [INFO ] After 17603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 115 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 116 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:59:20] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:59:20] [INFO ] Invariant cache hit.
[2023-03-18 10:59:21] [INFO ] Implicit Places using invariants in 964 ms returned []
Implicit Place search using SMT only with invariants took 965 ms to find 0 implicit places.
[2023-03-18 10:59:21] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:59:21] [INFO ] Invariant cache hit.
[2023-03-18 10:59:29] [INFO ] Dead Transitions using invariants and state equation in 8451 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9536 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10356 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 6 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 4 with 114 rules applied. Total rules applied 1380 place count 143 transition count 939
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1382 place count 141 transition count 929
Iterating global reduction 5 with 2 rules applied. Total rules applied 1384 place count 141 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1385 place count 141 transition count 928
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1387 place count 140 transition count 927
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1510 place count 127 transition count 809
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1519 place count 122 transition count 805
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1523 place count 122 transition count 801
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1524 place count 122 transition count 800
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1527 place count 121 transition count 798
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1530 place count 121 transition count 795
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1533 place count 120 transition count 793
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1535 place count 120 transition count 791
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1540 place count 120 transition count 875
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1561 place count 115 transition count 859
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1562 place count 114 transition count 855
Iterating global reduction 12 with 1 rules applied. Total rules applied 1563 place count 114 transition count 855
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1572 place count 114 transition count 846
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1591 place count 114 transition count 827
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1593 place count 114 transition count 827
Applied a total of 1593 rules in 337 ms. Remains 114 /497 variables (removed 383) and now considering 827/27456 (removed 26629) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:59:30] [INFO ] Flow matrix only has 786 transitions (discarded 41 similar events)
// Phase 1: matrix 786 rows 114 cols
[2023-03-18 10:59:30] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-18 10:59:30] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:59:30] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:59:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:59:30] [INFO ] After 20ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:59:30] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 10:59:30] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41261 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41261 steps, saw 29163 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:59:33] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:59:33] [INFO ] Computed 8 place invariants in 77 ms
[2023-03-18 10:59:33] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:59:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 10:59:37] [INFO ] After 3861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:59:37] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:59:46] [INFO ] After 8346ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:59:48] [INFO ] Deduced a trap composed of 158 places in 1898 ms of which 0 ms to minimize.
[2023-03-18 10:59:50] [INFO ] Deduced a trap composed of 136 places in 1768 ms of which 1 ms to minimize.
[2023-03-18 10:59:52] [INFO ] Deduced a trap composed of 82 places in 1140 ms of which 4 ms to minimize.
[2023-03-18 10:59:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6561 ms
[2023-03-18 10:59:53] [INFO ] After 15203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 669 ms.
[2023-03-18 10:59:53] [INFO ] After 19959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 592 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 594 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40720 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40720 steps, saw 28808 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:59:57] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:59:57] [INFO ] Computed 8 place invariants in 61 ms
[2023-03-18 10:59:58] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:59:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:00:01] [INFO ] After 3572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:00:01] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 11:00:11] [INFO ] After 9861ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:00:14] [INFO ] Deduced a trap composed of 47 places in 2191 ms of which 1 ms to minimize.
[2023-03-18 11:00:16] [INFO ] Deduced a trap composed of 49 places in 1897 ms of which 3 ms to minimize.
[2023-03-18 11:00:18] [INFO ] Deduced a trap composed of 137 places in 1642 ms of which 1 ms to minimize.
[2023-03-18 11:00:20] [INFO ] Deduced a trap composed of 127 places in 1727 ms of which 0 ms to minimize.
[2023-03-18 11:00:23] [INFO ] Deduced a trap composed of 51 places in 1841 ms of which 1 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.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 11:00:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:00:23] [INFO ] After 25167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 138 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 248 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 11:00:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:24] [INFO ] Implicit Places using invariants in 1003 ms returned []
Implicit Place search using SMT only with invariants took 1013 ms to find 0 implicit places.
[2023-03-18 11:00:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:00:24] [INFO ] Invariant cache hit.
[2023-03-18 11:00:32] [INFO ] Dead Transitions using invariants and state equation in 8349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9632 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10311 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
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 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1202 transitions
Redundant transition composition rules discarded 1202 transitions
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1260 place count 165 transition count 1059
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1220 edges and 162 vertex of which 2 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.0 ms
Discarding 160 places :
Also discarding 1034 output transitions
Drop transitions removed 1034 transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 1275 place count 2 transition count 14
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1288 place count 2 transition count 1
Applied a total of 1288 rules in 138 ms. Remains 2 /497 variables (removed 495) and now considering 1/27456 (removed 27455) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 11:00:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 11:00:33] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:00:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 29 ms returned sat
[2023-03-18 11:00:33] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:00:33] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 11:00:33] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40800 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40800 steps, saw 28869 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:00:36] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 11:00:36] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 11:00:36] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:00:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:00:40] [INFO ] After 3787ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:00:40] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 11:00:47] [INFO ] After 7018ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:00:50] [INFO ] Deduced a trap composed of 13 places in 734 ms of which 4 ms to minimize.
[2023-03-18 11:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1577 ms
[2023-03-18 11:00:51] [INFO ] After 10433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 848 ms.
[2023-03-18 11:00:52] [INFO ] After 15262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 532 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 535 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41426 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41426 steps, saw 29275 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:00:56] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 11:00:56] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-18 11:00:56] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:00:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 11:00:59] [INFO ] After 3577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:00] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 11:01:03] [INFO ] After 3380ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:04] [INFO ] After 4070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1590 ms.
[2023-03-18 11:01:05] [INFO ] After 9435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 130 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 123 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 11:01:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:01:05] [INFO ] Invariant cache hit.
[2023-03-18 11:01:06] [INFO ] Implicit Places using invariants in 921 ms returned []
Implicit Place search using SMT only with invariants took 924 ms to find 0 implicit places.
[2023-03-18 11:01:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:01:06] [INFO ] Invariant cache hit.
[2023-03-18 11:01:15] [INFO ] Dead Transitions using invariants and state equation in 8364 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9414 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10249 edges and 497 vertex of which 378 / 497 are part of one of the 61 SCC in 4 ms
Free SCC test removed 317 places
Drop transitions removed 10913 transitions
Ensure Unique test removed 14180 transitions
Reduce isomorphic transitions removed 25093 transitions.
Graph (complete) has 2405 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2349
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2339
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2339
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2337
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2314
Drop transitions removed 1204 transitions
Redundant transition composition rules discarded 1204 transitions
Iterating global reduction 3 with 1204 rules applied. Total rules applied 1263 place count 166 transition count 1110
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1292 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1274 place count 146 transition count 1099
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1387 place count 146 transition count 986
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1389 place count 144 transition count 976
Iterating global reduction 5 with 2 rules applied. Total rules applied 1391 place count 144 transition count 976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1392 place count 144 transition count 975
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1394 place count 143 transition count 974
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1399 place count 143 transition count 969
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1411 place count 143 transition count 950
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1443 place count 131 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1444 place count 130 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 1445 place count 130 transition count 926
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1453 place count 130 transition count 918
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1511 place count 130 transition count 860
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1517 place count 130 transition count 854
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1527 place count 124 transition count 850
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1534 place count 124 transition count 843
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 124 transition count 841
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 122 transition count 839
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 122 transition count 835
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 122 transition count 833
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 120 transition count 831
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1553 place count 120 transition count 828
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1557 place count 120 transition count 912
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1576 place count 116 transition count 897
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1577 place count 115 transition count 893
Iterating global reduction 12 with 1 rules applied. Total rules applied 1578 place count 115 transition count 893
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1587 place count 115 transition count 884
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1606 place count 115 transition count 865
Applied a total of 1606 rules in 247 ms. Remains 115 /497 variables (removed 382) and now considering 865/27456 (removed 26591) transitions.
Running SMT prover for 1 properties.
[2023-03-18 11:01:15] [INFO ] Flow matrix only has 824 transitions (discarded 41 similar events)
// Phase 1: matrix 824 rows 115 cols
[2023-03-18 11:01:15] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 11:01:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:01:15] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 11:01:15] [INFO ] After 30ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:15] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 11:01:15] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 3 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42001 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 42001 steps, saw 29641 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:01:19] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 11:01:19] [INFO ] Computed 8 place invariants in 70 ms
[2023-03-18 11:01:19] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:01:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:01:22] [INFO ] After 3549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:23] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 11:01:26] [INFO ] After 3286ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:28] [INFO ] Deduced a trap composed of 49 places in 1781 ms of which 0 ms to minimize.
[2023-03-18 11:01:31] [INFO ] Deduced a trap composed of 91 places in 1871 ms of which 1 ms to minimize.
[2023-03-18 11:01:33] [INFO ] Deduced a trap composed of 11 places in 1960 ms of which 1 ms to minimize.
[2023-03-18 11:01:38] [INFO ] Deduced a trap composed of 49 places in 1861 ms of which 2 ms to minimize.
[2023-03-18 11:01:41] [INFO ] Deduced a trap composed of 68 places in 1703 ms of which 1 ms to minimize.
[2023-03-18 11:01:43] [INFO ] Deduced a trap composed of 101 places in 1440 ms of which 0 ms to minimize.
[2023-03-18 11:01:44] [INFO ] Deduced a trap composed of 92 places in 1178 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.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 11:01:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:01:44] [INFO ] After 25660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 585 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42710 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42710 steps, saw 30093 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:01:48] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 11:01:49] [INFO ] Computed 8 place invariants in 118 ms
[2023-03-18 11:01:49] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:01:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:01:52] [INFO ] After 3645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:52] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 11:01:55] [INFO ] After 2730ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:01:58] [INFO ] Deduced a trap composed of 21 places in 1882 ms of which 1 ms to minimize.
[2023-03-18 11:02:00] [INFO ] Deduced a trap composed of 92 places in 1625 ms of which 1 ms to minimize.
[2023-03-18 11:02:02] [INFO ] Deduced a trap composed of 49 places in 2073 ms of which 1 ms to minimize.
[2023-03-18 11:02:05] [INFO ] Deduced a trap composed of 47 places in 2104 ms of which 1 ms to minimize.
[2023-03-18 11:02:07] [INFO ] Deduced a trap composed of 51 places in 1968 ms of which 2 ms to minimize.
[2023-03-18 11:02:09] [INFO ] Deduced a trap composed of 91 places in 1903 ms of which 1 ms to minimize.
[2023-03-18 11:02:12] [INFO ] Deduced a trap composed of 84 places in 1911 ms of which 1 ms to minimize.
[2023-03-18 11:02:15] [INFO ] Deduced a trap composed of 12 places in 2127 ms of which 1 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.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 11:02:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:02:15] [INFO ] After 25925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 115 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 111 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 11:02:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:02:15] [INFO ] Invariant cache hit.
[2023-03-18 11:02:16] [INFO ] Implicit Places using invariants in 947 ms returned []
Implicit Place search using SMT only with invariants took 948 ms to find 0 implicit places.
[2023-03-18 11:02:16] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:02:16] [INFO ] Invariant cache hit.
[2023-03-18 11:02:24] [INFO ] Dead Transitions using invariants and state equation in 8447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9517 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10333 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 4 with 115 rules applied. Total rules applied 1381 place count 143 transition count 938
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1383 place count 141 transition count 928
Iterating global reduction 5 with 2 rules applied. Total rules applied 1385 place count 141 transition count 928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1386 place count 141 transition count 927
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1388 place count 140 transition count 926
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 127 transition count 808
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 121 transition count 804
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 121 transition count 798
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1533 place count 119 transition count 794
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1537 place count 119 transition count 790
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1539 place count 119 transition count 788
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1543 place count 117 transition count 786
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1545 place count 117 transition count 784
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1550 place count 117 transition count 868
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1571 place count 112 transition count 852
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1572 place count 111 transition count 848
Iterating global reduction 12 with 1 rules applied. Total rules applied 1573 place count 111 transition count 848
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1582 place count 111 transition count 839
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1601 place count 111 transition count 820
Applied a total of 1601 rules in 227 ms. Remains 111 /497 variables (removed 386) and now considering 820/27456 (removed 26636) transitions.
Running SMT prover for 1 properties.
[2023-03-18 11:02:24] [INFO ] Flow matrix only has 779 transitions (discarded 41 similar events)
// Phase 1: matrix 779 rows 111 cols
[2023-03-18 11:02:24] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 11:02:24] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:02:25] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:02:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 11:02:25] [INFO ] After 20ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:02:25] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 11:02:25] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41291 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41291 steps, saw 29186 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:02:28] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 11:02:28] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-18 11:02:28] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:02:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:02:32] [INFO ] After 3796ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:02:32] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 11:02:40] [INFO ] After 8235ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:02:43] [INFO ] Deduced a trap composed of 25 places in 1996 ms of which 0 ms to minimize.
[2023-03-18 11:02:46] [INFO ] Deduced a trap composed of 84 places in 2290 ms of which 1 ms to minimize.
[2023-03-18 11:02:48] [INFO ] Deduced a trap composed of 92 places in 1601 ms of which 0 ms to minimize.
[2023-03-18 11:02:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7474 ms
[2023-03-18 11:02:49] [INFO ] After 16424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1906 ms.
[2023-03-18 11:02:51] [INFO ] After 22341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 530 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41377 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41377 steps, saw 29243 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:02:54] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 11:02:54] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-18 11:02:55] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:02:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 11:02:58] [INFO ] After 3837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:02:59] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 11:03:09] [INFO ] After 10074ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-18 11:03:09] [INFO ] After 14101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 112 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 101 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 11:03:09] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:03:09] [INFO ] Invariant cache hit.
[2023-03-18 11:03:10] [INFO ] Implicit Places using invariants in 933 ms returned []
Implicit Place search using SMT only with invariants took 934 ms to find 0 implicit places.
[2023-03-18 11:03:10] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:03:10] [INFO ] Invariant cache hit.
[2023-03-18 11:03:18] [INFO ] Dead Transitions using invariants and state equation in 8516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9555 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
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 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 58 place count 165 transition count 2261
Drop transitions removed 1201 transitions
Redundant transition composition rules discarded 1201 transitions
Iterating global reduction 3 with 1201 rules applied. Total rules applied 1259 place count 165 transition count 1060
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1235 edges and 163 vertex of which 146 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1270 place count 146 transition count 1050
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 4 with 107 rules applied. Total rules applied 1377 place count 146 transition count 943
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1380 place count 143 transition count 932
Iterating global reduction 5 with 3 rules applied. Total rules applied 1383 place count 143 transition count 932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1384 place count 143 transition count 931
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 142 transition count 929
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 142 transition count 929
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1388 place count 141 transition count 928
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 141 transition count 923
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 141 transition count 904
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 129 transition count 884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 128 transition count 882
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 128 transition count 882
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 128 transition count 874
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 128 transition count 816
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 128 transition count 810
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 122 transition count 806
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 122 transition count 800
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1528 place count 122 transition count 799
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1531 place count 121 transition count 797
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1533 place count 121 transition count 795
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1534 place count 121 transition count 794
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1537 place count 120 transition count 792
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1539 place count 120 transition count 790
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1544 place count 120 transition count 874
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1565 place count 115 transition count 858
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1566 place count 114 transition count 854
Iterating global reduction 12 with 1 rules applied. Total rules applied 1567 place count 114 transition count 854
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1576 place count 114 transition count 845
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1595 place count 114 transition count 826
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1600 place count 114 transition count 826
Applied a total of 1600 rules in 229 ms. Remains 114 /497 variables (removed 383) and now considering 826/27456 (removed 26630) transitions.
Running SMT prover for 1 properties.
[2023-03-18 11:03:19] [INFO ] Flow matrix only has 791 transitions (discarded 35 similar events)
// Phase 1: matrix 791 rows 114 cols
[2023-03-18 11:03:19] [INFO ] Computed 0 place invariants in 10 ms
[2023-03-18 11:03:19] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:03:19] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:03:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 11:03:19] [INFO ] After 25ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:03:19] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 11:03:19] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40359 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40359 steps, saw 28589 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:03:22] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 11:03:22] [INFO ] Computed 8 place invariants in 68 ms
[2023-03-18 11:03:22] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:03:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:03:26] [INFO ] After 3910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:03:27] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 11:03:32] [INFO ] After 5922ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:03:36] [INFO ] Deduced a trap composed of 49 places in 2170 ms of which 1 ms to minimize.
[2023-03-18 11:03:43] [INFO ] Deduced a trap composed of 84 places in 1969 ms of which 1 ms to minimize.
[2023-03-18 11:03:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 10669 ms
[2023-03-18 11:03:44] [INFO ] After 17303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-18 11:03:44] [INFO ] After 21828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 457 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41360 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41360 steps, saw 29232 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:03:48] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 11:03:48] [INFO ] Computed 8 place invariants in 69 ms
[2023-03-18 11:03:48] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:03:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 11:03:52] [INFO ] After 3923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:03:52] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 11:03:58] [INFO ] After 5349ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:04:00] [INFO ] Deduced a trap composed of 57 places in 2111 ms of which 0 ms to minimize.
[2023-03-18 11:04:09] [INFO ] Deduced a trap composed of 49 places in 1912 ms of which 1 ms to minimize.
[2023-03-18 11:04:12] [INFO ] Deduced a trap composed of 161 places in 2032 ms of which 0 ms to minimize.
[2023-03-18 11:04:15] [INFO ] Deduced a trap composed of 84 places in 2129 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.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 11:04:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:04:15] [INFO ] After 26327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 108 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 103 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 11:04:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:04:15] [INFO ] Invariant cache hit.
[2023-03-18 11:04:16] [INFO ] Implicit Places using invariants in 900 ms returned []
Implicit Place search using SMT only with invariants took 913 ms to find 0 implicit places.
[2023-03-18 11:04:16] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:04:16] [INFO ] Invariant cache hit.
[2023-03-18 11:04:24] [INFO ] Dead Transitions using invariants and state equation in 8323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9348 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 317 places
Drop transitions removed 11151 transitions
Ensure Unique test removed 13967 transitions
Reduce isomorphic transitions removed 25118 transitions.
Graph (complete) has 2352 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2314
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2314
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 24 place count 167 transition count 2312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 59 place count 166 transition count 2289
Drop transitions removed 1214 transitions
Redundant transition composition rules discarded 1214 transitions
Iterating global reduction 3 with 1214 rules applied. Total rules applied 1273 place count 166 transition count 1075
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1238 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1284 place count 146 transition count 1064
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 1396 place count 146 transition count 952
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1398 place count 144 transition count 942
Iterating global reduction 5 with 2 rules applied. Total rules applied 1400 place count 144 transition count 942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1401 place count 144 transition count 941
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1403 place count 143 transition count 940
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1408 place count 143 transition count 935
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1420 place count 143 transition count 916
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1452 place count 131 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1453 place count 130 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1454 place count 130 transition count 894
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1462 place count 130 transition count 886
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1520 place count 130 transition count 828
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1526 place count 130 transition count 822
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1536 place count 124 transition count 818
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1542 place count 124 transition count 812
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1544 place count 124 transition count 810
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1548 place count 122 transition count 808
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1552 place count 122 transition count 804
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1554 place count 122 transition count 802
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1558 place count 120 transition count 800
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1560 place count 120 transition count 798
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1565 place count 120 transition count 885
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1586 place count 115 transition count 869
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1587 place count 114 transition count 865
Iterating global reduction 12 with 1 rules applied. Total rules applied 1588 place count 114 transition count 865
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1597 place count 114 transition count 856
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1617 place count 114 transition count 836
Applied a total of 1617 rules in 211 ms. Remains 114 /497 variables (removed 383) and now considering 836/27456 (removed 26620) transitions.
Running SMT prover for 1 properties.
[2023-03-18 11:04:24] [INFO ] Flow matrix only has 794 transitions (discarded 42 similar events)
// Phase 1: matrix 794 rows 114 cols
[2023-03-18 11:04:24] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 11:04:24] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:04:24] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:04:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 11:04:24] [INFO ] After 23ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:04:24] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 11:04:25] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41781 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41781 steps, saw 29511 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:04:28] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 11:04:28] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 11:04:28] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:04:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 11:04:32] [INFO ] After 3667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:04:32] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 11:04:37] [INFO ] After 5407ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:04:39] [INFO ] Deduced a trap composed of 163 places in 1491 ms of which 1 ms to minimize.
[2023-03-18 11:04:41] [INFO ] Deduced a trap composed of 19 places in 1487 ms of which 1 ms to minimize.
[2023-03-18 11:04:44] [INFO ] Deduced a trap composed of 157 places in 2090 ms of which 2 ms to minimize.
[2023-03-18 11:04:46] [INFO ] Deduced a trap composed of 111 places in 1857 ms of which 1 ms to minimize.
[2023-03-18 11:04:49] [INFO ] Deduced a trap composed of 47 places in 2106 ms of which 0 ms to minimize.
[2023-03-18 11:04:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 11910 ms
[2023-03-18 11:04:50] [INFO ] After 17864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1139 ms.
[2023-03-18 11:04:51] [INFO ] After 22878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 554 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 554 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40607 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40607 steps, saw 28722 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:04:55] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 11:04:55] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 11:04:55] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:04:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 11:04:59] [INFO ] After 3484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:04:59] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 11:05:03] [INFO ] After 4162ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:05:06] [INFO ] Deduced a trap composed of 147 places in 1832 ms of which 0 ms to minimize.
[2023-03-18 11:05:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2702 ms
[2023-03-18 11:05:07] [INFO ] After 7913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 537 ms.
[2023-03-18 11:05:07] [INFO ] After 12120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 105 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 11:05:07] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:05:07] [INFO ] Invariant cache hit.
[2023-03-18 11:05:08] [INFO ] Implicit Places using invariants in 935 ms returned []
Implicit Place search using SMT only with invariants took 936 ms to find 0 implicit places.
[2023-03-18 11:05:08] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 11:05:08] [INFO ] Invariant cache hit.
[2023-03-18 11:05:16] [INFO ] Dead Transitions using invariants and state equation in 7910 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8951 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
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 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1200 transitions
Redundant transition composition rules discarded 1200 transitions
Iterating global reduction 3 with 1200 rules applied. Total rules applied 1258 place count 165 transition count 1061
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1228 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1269 place count 144 transition count 1050
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1382 place count 144 transition count 937
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1384 place count 142 transition count 927
Iterating global reduction 5 with 2 rules applied. Total rules applied 1386 place count 142 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1387 place count 142 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1389 place count 141 transition count 925
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1394 place count 141 transition count 920
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1406 place count 141 transition count 901
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1438 place count 129 transition count 881
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1439 place count 128 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1440 place count 128 transition count 879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1448 place count 128 transition count 871
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1506 place count 128 transition count 813
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1512 place count 128 transition count 807
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1522 place count 122 transition count 803
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1528 place count 122 transition count 797
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1530 place count 122 transition count 795
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1534 place count 120 transition count 793
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1538 place count 120 transition count 789
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1540 place count 120 transition count 787
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1544 place count 118 transition count 785
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1546 place count 118 transition count 783
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1551 place count 118 transition count 867
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1572 place count 113 transition count 851
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1573 place count 112 transition count 847
Iterating global reduction 12 with 1 rules applied. Total rules applied 1574 place count 112 transition count 847
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1583 place count 112 transition count 838
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1602 place count 112 transition count 819
Applied a total of 1602 rules in 212 ms. Remains 112 /497 variables (removed 385) and now considering 819/27456 (removed 26637) transitions.
Running SMT prover for 1 properties.
[2023-03-18 11:05:16] [INFO ] Flow matrix only has 781 transitions (discarded 38 similar events)
// Phase 1: matrix 781 rows 112 cols
[2023-03-18 11:05:16] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-18 11:05:16] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:05:17] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:05:17] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 11:05:17] [INFO ] After 19ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:05:17] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 11:05:17] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41077 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41077 steps, saw 29075 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:05:20] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 11:05:20] [INFO ] Computed 8 place invariants in 62 ms
[2023-03-18 11:05:20] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:05:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 11:05:24] [INFO ] After 3658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:05:24] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 11:05:29] [INFO ] After 4576ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:05:31] [INFO ] Deduced a trap composed of 101 places in 1107 ms of which 0 ms to minimize.
[2023-03-18 11:05:33] [INFO ] Deduced a trap composed of 187 places in 1359 ms of which 0 ms to minimize.
[2023-03-18 11:05:35] [INFO ] Deduced a trap composed of 149 places in 1440 ms of which 0 ms to minimize.
[2023-03-18 11:05:37] [INFO ] Deduced a trap composed of 19 places in 1293 ms of which 1 ms to minimize.
[2023-03-18 11:05:39] [INFO ] Deduced a trap composed of 47 places in 1611 ms of which 0 ms to minimize.
[2023-03-18 11:05:42] [INFO ] Deduced a trap composed of 59 places in 1903 ms of which 0 ms to minimize.
[2023-03-18 11:05:45] [INFO ] Deduced a trap composed of 49 places in 1834 ms of which 1 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.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 11:05:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:05:45] [INFO ] After 25265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 665 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 38874 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38874 steps, saw 27511 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:05:49] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 11:05:49] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 11:05:50] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:05:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 11:05:54] [INFO ] After 4070ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:05:54] [INFO ] State equation strengthened by 1374 read => feed constraints.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13175968 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16109852 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 StableMarking -timeout 180 -rebuildPNML
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="RERS2020-PT-pb103"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is RERS2020-PT-pb103, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r345-tall-167889216700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;