About the Execution of 2023-gold for Szymanski-PT-b04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.768 | 3600000.00 | 3303771.00 | 245067.90 | ? 1 1 1 1 ? 0 ? 4 ? 1 1 0 1 ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556700541.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Szymanski-PT-b04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556700541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-b04-UpperBounds-00
FORMULA_NAME Szymanski-PT-b04-UpperBounds-01
FORMULA_NAME Szymanski-PT-b04-UpperBounds-02
FORMULA_NAME Szymanski-PT-b04-UpperBounds-03
FORMULA_NAME Szymanski-PT-b04-UpperBounds-04
FORMULA_NAME Szymanski-PT-b04-UpperBounds-05
FORMULA_NAME Szymanski-PT-b04-UpperBounds-06
FORMULA_NAME Szymanski-PT-b04-UpperBounds-07
FORMULA_NAME Szymanski-PT-b04-UpperBounds-08
FORMULA_NAME Szymanski-PT-b04-UpperBounds-09
FORMULA_NAME Szymanski-PT-b04-UpperBounds-10
FORMULA_NAME Szymanski-PT-b04-UpperBounds-11
FORMULA_NAME Szymanski-PT-b04-UpperBounds-12
FORMULA_NAME Szymanski-PT-b04-UpperBounds-13
FORMULA_NAME Szymanski-PT-b04-UpperBounds-14
FORMULA_NAME Szymanski-PT-b04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717168882866
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 15:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 15:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 15:21:24] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2024-05-31 15:21:24] [INFO ] Transformed 568 places.
[2024-05-31 15:21:24] [INFO ] Transformed 8320 transitions.
[2024-05-31 15:21:24] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2024-05-31 15:21:24] [INFO ] Computed 3 invariants in 70 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :10
FORMULA Szymanski-PT-b04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :3
FORMULA Szymanski-PT-b04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :6
FORMULA Szymanski-PT-b04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :5
FORMULA Szymanski-PT-b04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 15:21:25] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-31 15:21:25] [INFO ] Computed 3 invariants in 24 ms
[2024-05-31 15:21:25] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-31 15:21:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:26] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2024-05-31 15:21:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:21:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 15:21:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:26] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-05-31 15:21:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:21:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:21:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 4335 ms returned unknown
[2024-05-31 15:21:31] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:31] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2024-05-31 15:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:21:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:32] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-31 15:21:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:21:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 3382 ms returned sat
[2024-05-31 15:21:36] [INFO ] Deduced a trap composed of 138 places in 710 ms of which 7 ms to minimize.
[2024-05-31 15:21:37] [INFO ] Deduced a trap composed of 130 places in 728 ms of which 17 ms to minimize.
[2024-05-31 15:21:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 15:21:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 15:21:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:38] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-31 15:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:21:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:38] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2024-05-31 15:21:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 985 ms returned sat
[2024-05-31 15:21:40] [INFO ] Deduced a trap composed of 79 places in 491 ms of which 7 ms to minimize.
[2024-05-31 15:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 662 ms
[2024-05-31 15:21:40] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 629 ms.
[2024-05-31 15:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 811 ms. Result :sat
Minimization took 1767 ms.
[2024-05-31 15:21:43] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 15:21:43] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:43] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2024-05-31 15:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:21:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:43] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:44] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2024-05-31 15:21:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 2193 ms returned sat
[2024-05-31 15:21:46] [INFO ] Deduced a trap composed of 138 places in 342 ms of which 1 ms to minimize.
[2024-05-31 15:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2024-05-31 15:21:47] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 542 ms.
[2024-05-31 15:21:47] [INFO ] Added : 0 causal constraints over 0 iterations in 727 ms. Result :sat
Minimization took 974 ms.
[2024-05-31 15:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:48] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:49] [INFO ] [Real]Absence check using state equation in 574 ms returned unsat
[2024-05-31 15:21:49] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 15:21:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:49] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-05-31 15:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:21:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 15:21:49] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:50] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2024-05-31 15:21:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:21:54] [INFO ] [Nat]Added 147 Read/Feed constraints in 4156 ms returned sat
[2024-05-31 15:21:55] [INFO ] Deduced a trap composed of 131 places in 523 ms of which 16 ms to minimize.
[2024-05-31 15:21:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 15:21:55] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:55] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-05-31 15:21:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:21:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:21:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:21:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:21:56] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-31 15:21:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 1816 ms returned sat
[2024-05-31 15:21:58] [INFO ] Deduced a trap composed of 130 places in 569 ms of which 0 ms to minimize.
[2024-05-31 15:21:59] [INFO ] Deduced a trap composed of 130 places in 519 ms of which 1 ms to minimize.
[2024-05-31 15:21:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1274 ms
[2024-05-31 15:21:59] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 373 ms.
[2024-05-31 15:22:00] [INFO ] Added : 0 causal constraints over 0 iterations in 544 ms. Result :sat
Minimization took 742 ms.
[2024-05-31 15:22:00] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 15:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:01] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2024-05-31 15:22:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 15:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:02] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2024-05-31 15:22:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:22:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 3339 ms returned sat
[2024-05-31 15:22:06] [INFO ] Deduced a trap composed of 140 places in 552 ms of which 15 ms to minimize.
[2024-05-31 15:22:06] [INFO ] Deduced a trap composed of 116 places in 531 ms of which 0 ms to minimize.
[2024-05-31 15:22:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
Current structural bounds on expressions (after SMT) : [9, 1, 1, 1, 4, 1, 1, 1] Max seen :[4, 0, 0, 0, 4, 0, 0, 0]
FORMULA Szymanski-PT-b04-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 519 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:22:07] [INFO ] Computed 3 invariants in 34 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1688 ms. (steps per millisecond=592 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=1082 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 7) seen :3
[2024-05-31 15:22:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:22:15] [INFO ] Computed 3 invariants in 23 ms
[2024-05-31 15:22:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:15] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-31 15:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:16] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2024-05-31 15:22:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:22:19] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:22:22] [INFO ] [Nat]Added 147 Read/Feed constraints in 6049 ms returned unknown
[2024-05-31 15:22:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:22] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2024-05-31 15:22:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:23] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2024-05-31 15:22:24] [INFO ] [Nat]Added 147 Read/Feed constraints in 1453 ms returned sat
[2024-05-31 15:22:25] [INFO ] Deduced a trap composed of 132 places in 552 ms of which 1 ms to minimize.
[2024-05-31 15:22:25] [INFO ] Deduced a trap composed of 137 places in 341 ms of which 1 ms to minimize.
[2024-05-31 15:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1130 ms
[2024-05-31 15:22:26] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 404 ms.
[2024-05-31 15:22:26] [INFO ] Added : 0 causal constraints over 0 iterations in 574 ms. Result :sat
Minimization took 1425 ms.
[2024-05-31 15:22:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:28] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2024-05-31 15:22:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:28] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2024-05-31 15:22:29] [INFO ] [Nat]Added 147 Read/Feed constraints in 990 ms returned sat
[2024-05-31 15:22:30] [INFO ] Deduced a trap composed of 78 places in 560 ms of which 0 ms to minimize.
[2024-05-31 15:22:31] [INFO ] Deduced a trap composed of 129 places in 549 ms of which 0 ms to minimize.
[2024-05-31 15:22:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1286 ms
[2024-05-31 15:22:31] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 355 ms.
[2024-05-31 15:22:31] [INFO ] Added : 0 causal constraints over 0 iterations in 508 ms. Result :sat
Minimization took 369 ms.
[2024-05-31 15:22:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:32] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-31 15:22:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:33] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2024-05-31 15:22:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 1964 ms returned sat
[2024-05-31 15:22:35] [INFO ] Deduced a trap composed of 137 places in 489 ms of which 1 ms to minimize.
[2024-05-31 15:22:36] [INFO ] Deduced a trap composed of 132 places in 541 ms of which 1 ms to minimize.
[2024-05-31 15:22:36] [INFO ] Deduced a trap composed of 129 places in 533 ms of which 0 ms to minimize.
[2024-05-31 15:22:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1870 ms
[2024-05-31 15:22:37] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 336 ms.
[2024-05-31 15:22:37] [INFO ] Added : 3 causal constraints over 2 iterations in 668 ms. Result :sat
Minimization took 1893 ms.
[2024-05-31 15:22:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:40] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-05-31 15:22:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:40] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2024-05-31 15:22:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 1809 ms returned sat
[2024-05-31 15:22:42] [INFO ] Deduced a trap composed of 129 places in 526 ms of which 1 ms to minimize.
[2024-05-31 15:22:43] [INFO ] Deduced a trap composed of 137 places in 486 ms of which 1 ms to minimize.
[2024-05-31 15:22:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1256 ms
[2024-05-31 15:22:44] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 330 ms.
[2024-05-31 15:22:44] [INFO ] Added : 0 causal constraints over 0 iterations in 491 ms. Result :sat
Minimization took 910 ms.
[2024-05-31 15:22:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:45] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-31 15:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:46] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-05-31 15:22:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:22:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 4669 ms returned sat
[2024-05-31 15:22:51] [INFO ] Deduced a trap composed of 79 places in 546 ms of which 0 ms to minimize.
[2024-05-31 15:22:52] [INFO ] Deduced a trap composed of 78 places in 527 ms of which 1 ms to minimize.
[2024-05-31 15:22:52] [INFO ] Deduced a trap composed of 130 places in 519 ms of which 1 ms to minimize.
[2024-05-31 15:22:53] [INFO ] Deduced a trap composed of 138 places in 494 ms of which 1 ms to minimize.
[2024-05-31 15:22:53] [INFO ] Deduced a trap composed of 137 places in 483 ms of which 1 ms to minimize.
[2024-05-31 15:22:54] [INFO ] Deduced a trap composed of 135 places in 494 ms of which 0 ms to minimize.
[2024-05-31 15:22:55] [INFO ] Deduced a trap composed of 132 places in 532 ms of which 0 ms to minimize.
[2024-05-31 15:22:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4260 ms
[2024-05-31 15:22:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 359 ms.
[2024-05-31 15:22:55] [INFO ] Added : 2 causal constraints over 1 iterations in 597 ms. Result :sat
Minimization took 2332 ms.
[2024-05-31 15:22:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:58] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-31 15:22:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:22:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:22:59] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-05-31 15:23:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 2737 ms returned sat
[2024-05-31 15:23:02] [INFO ] Deduced a trap composed of 132 places in 499 ms of which 1 ms to minimize.
[2024-05-31 15:23:02] [INFO ] Deduced a trap composed of 140 places in 351 ms of which 1 ms to minimize.
[2024-05-31 15:23:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1044 ms
[2024-05-31 15:23:03] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 362 ms.
[2024-05-31 15:23:04] [INFO ] Deduced a trap composed of 129 places in 501 ms of which 0 ms to minimize.
[2024-05-31 15:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2024-05-31 15:23:04] [INFO ] Added : 3 causal constraints over 2 iterations in 1786 ms. Result :sat
Minimization took 2132 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 1, 1, 1, 1, 1] Max seen :[4, 0, 0, 0, 0, 0, 0]
FORMULA Szymanski-PT-b04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 269 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:23:07] [INFO ] Computed 3 invariants in 25 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1902 ms. (steps per millisecond=525 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties (out of 6) seen :4
[2024-05-31 15:23:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:23:15] [INFO ] Computed 3 invariants in 30 ms
[2024-05-31 15:23:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:16] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2024-05-31 15:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:23:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:17] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-31 15:23:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:23:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:23:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 6046 ms returned unknown
[2024-05-31 15:23:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:23] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-31 15:23:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:23:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:24] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-05-31 15:23:25] [INFO ] [Nat]Added 147 Read/Feed constraints in 957 ms returned sat
[2024-05-31 15:23:25] [INFO ] Deduced a trap composed of 78 places in 558 ms of which 1 ms to minimize.
[2024-05-31 15:23:26] [INFO ] Deduced a trap composed of 129 places in 554 ms of which 1 ms to minimize.
[2024-05-31 15:23:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1292 ms
[2024-05-31 15:23:26] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 367 ms.
[2024-05-31 15:23:26] [INFO ] Added : 0 causal constraints over 0 iterations in 528 ms. Result :sat
Minimization took 365 ms.
[2024-05-31 15:23:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:27] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2024-05-31 15:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:23:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-31 15:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:28] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-05-31 15:23:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 2005 ms returned sat
[2024-05-31 15:23:30] [INFO ] Deduced a trap composed of 137 places in 499 ms of which 1 ms to minimize.
[2024-05-31 15:23:31] [INFO ] Deduced a trap composed of 132 places in 542 ms of which 1 ms to minimize.
[2024-05-31 15:23:32] [INFO ] Deduced a trap composed of 129 places in 530 ms of which 1 ms to minimize.
[2024-05-31 15:23:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1870 ms
[2024-05-31 15:23:32] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 346 ms.
[2024-05-31 15:23:32] [INFO ] Added : 3 causal constraints over 2 iterations in 659 ms. Result :sat
Minimization took 1828 ms.
[2024-05-31 15:23:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:35] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2024-05-31 15:23:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:23:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:35] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2024-05-31 15:23:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 1754 ms returned sat
[2024-05-31 15:23:38] [INFO ] Deduced a trap composed of 129 places in 519 ms of which 0 ms to minimize.
[2024-05-31 15:23:38] [INFO ] Deduced a trap composed of 137 places in 479 ms of which 0 ms to minimize.
[2024-05-31 15:23:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1215 ms
[2024-05-31 15:23:39] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 317 ms.
[2024-05-31 15:23:39] [INFO ] Added : 0 causal constraints over 0 iterations in 481 ms. Result :sat
Minimization took 884 ms.
[2024-05-31 15:23:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:40] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-31 15:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:23:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:41] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2024-05-31 15:23:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:23:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 6062 ms returned unknown
[2024-05-31 15:23:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:47] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-31 15:23:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:23:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:23:48] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2024-05-31 15:23:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 2645 ms returned sat
[2024-05-31 15:23:51] [INFO ] Deduced a trap composed of 132 places in 543 ms of which 1 ms to minimize.
[2024-05-31 15:23:51] [INFO ] Deduced a trap composed of 140 places in 367 ms of which 1 ms to minimize.
[2024-05-31 15:23:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2024-05-31 15:23:52] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 346 ms.
[2024-05-31 15:23:53] [INFO ] Deduced a trap composed of 129 places in 541 ms of which 0 ms to minimize.
[2024-05-31 15:23:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 692 ms
[2024-05-31 15:23:53] [INFO ] Added : 3 causal constraints over 2 iterations in 1776 ms. Result :sat
Minimization took 2066 ms.
Current structural bounds on expressions (after SMT) : [5, 1, 1, 1, 1, 1] Max seen :[4, 0, 0, 0, 0, 0]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:23:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:23:56] [INFO ] Invariant cache hit.
[2024-05-31 15:23:57] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-31 15:23:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:23:57] [INFO ] Invariant cache hit.
[2024-05-31 15:23:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:23:59] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 2988 ms to find 0 implicit places.
[2024-05-31 15:24:00] [INFO ] Redundant transitions in 923 ms returned []
[2024-05-31 15:24:00] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:00] [INFO ] Invariant cache hit.
[2024-05-31 15:24:02] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6185 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-00
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:02] [INFO ] Computed 3 invariants in 22 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
[2024-05-31 15:24:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:02] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 15:24:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:03] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2024-05-31 15:24:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:24:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:03] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-05-31 15:24:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:24:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 4587 ms returned unknown
Current structural bounds on expressions (after SMT) : [5] Max seen :[4]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 285 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:08] [INFO ] Computed 3 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1494 ms. (steps per millisecond=669 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 1) seen :3
[2024-05-31 15:24:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:11] [INFO ] Computed 3 invariants in 20 ms
[2024-05-31 15:24:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:11] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-05-31 15:24:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:24:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:12] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-31 15:24:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:24:18] [INFO ] [Nat]Added 147 Read/Feed constraints in 6038 ms returned unknown
Current structural bounds on expressions (after SMT) : [5] Max seen :[4]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:24:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:18] [INFO ] Invariant cache hit.
[2024-05-31 15:24:19] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-31 15:24:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:19] [INFO ] Invariant cache hit.
[2024-05-31 15:24:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:21] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 2910 ms to find 0 implicit places.
[2024-05-31 15:24:22] [INFO ] Redundant transitions in 859 ms returned []
[2024-05-31 15:24:22] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:22] [INFO ] Invariant cache hit.
[2024-05-31 15:24:24] [INFO ] Dead Transitions using invariants and state equation in 2477 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6466 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-00 in 22191 ms.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-05
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:24] [INFO ] Computed 3 invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-31 15:24:24] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:24] [INFO ] Computed 3 invariants in 12 ms
[2024-05-31 15:24:24] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:25] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-31 15:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:24:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:25] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2024-05-31 15:24:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 964 ms returned sat
[2024-05-31 15:24:27] [INFO ] Deduced a trap composed of 78 places in 545 ms of which 1 ms to minimize.
[2024-05-31 15:24:27] [INFO ] Deduced a trap composed of 129 places in 511 ms of which 0 ms to minimize.
[2024-05-31 15:24:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1222 ms
[2024-05-31 15:24:28] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 338 ms.
[2024-05-31 15:24:28] [INFO ] Added : 0 causal constraints over 0 iterations in 510 ms. Result :sat
Minimization took 364 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:29] [INFO ] Computed 3 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
[2024-05-31 15:24:31] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:31] [INFO ] Computed 3 invariants in 12 ms
[2024-05-31 15:24:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 15:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:32] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2024-05-31 15:24:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:24:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:32] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2024-05-31 15:24:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 973 ms returned sat
[2024-05-31 15:24:34] [INFO ] Deduced a trap composed of 78 places in 494 ms of which 0 ms to minimize.
[2024-05-31 15:24:34] [INFO ] Deduced a trap composed of 129 places in 501 ms of which 0 ms to minimize.
[2024-05-31 15:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1167 ms
[2024-05-31 15:24:35] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 312 ms.
[2024-05-31 15:24:35] [INFO ] Added : 0 causal constraints over 0 iterations in 467 ms. Result :sat
Minimization took 367 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 201 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:24:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:36] [INFO ] Invariant cache hit.
[2024-05-31 15:24:36] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-31 15:24:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:36] [INFO ] Invariant cache hit.
[2024-05-31 15:24:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:39] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 3059 ms to find 0 implicit places.
[2024-05-31 15:24:39] [INFO ] Redundant transitions in 626 ms returned []
[2024-05-31 15:24:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:39] [INFO ] Invariant cache hit.
[2024-05-31 15:24:42] [INFO ] Dead Transitions using invariants and state equation in 2404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6313 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-05 in 17567 ms.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-07
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:42] [INFO ] Computed 3 invariants in 13 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2024-05-31 15:24:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:42] [INFO ] Computed 3 invariants in 11 ms
[2024-05-31 15:24:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:42] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-05-31 15:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:43] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-05-31 15:24:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 1914 ms returned sat
[2024-05-31 15:24:45] [INFO ] Deduced a trap composed of 137 places in 491 ms of which 1 ms to minimize.
[2024-05-31 15:24:46] [INFO ] Deduced a trap composed of 132 places in 499 ms of which 1 ms to minimize.
[2024-05-31 15:24:47] [INFO ] Deduced a trap composed of 129 places in 475 ms of which 0 ms to minimize.
[2024-05-31 15:24:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1752 ms
[2024-05-31 15:24:47] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 325 ms.
[2024-05-31 15:24:47] [INFO ] Added : 3 causal constraints over 2 iterations in 633 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:48] [INFO ] Computed 3 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1461 ms. (steps per millisecond=684 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties (out of 1) seen :0
[2024-05-31 15:24:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:24:50] [INFO ] Computed 3 invariants in 12 ms
[2024-05-31 15:24:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:50] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-31 15:24:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:24:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:24:51] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2024-05-31 15:24:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:24:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 1993 ms returned sat
[2024-05-31 15:24:54] [INFO ] Deduced a trap composed of 137 places in 478 ms of which 0 ms to minimize.
[2024-05-31 15:24:54] [INFO ] Deduced a trap composed of 132 places in 493 ms of which 1 ms to minimize.
[2024-05-31 15:24:55] [INFO ] Deduced a trap composed of 129 places in 492 ms of which 1 ms to minimize.
[2024-05-31 15:24:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1733 ms
[2024-05-31 15:24:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 306 ms.
[2024-05-31 15:24:55] [INFO ] Added : 3 causal constraints over 2 iterations in 610 ms. Result :sat
Minimization took 1840 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:24:58] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:58] [INFO ] Invariant cache hit.
[2024-05-31 15:24:58] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-31 15:24:58] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:24:58] [INFO ] Invariant cache hit.
[2024-05-31 15:24:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:00] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2616 ms to find 0 implicit places.
[2024-05-31 15:25:01] [INFO ] Redundant transitions in 627 ms returned []
[2024-05-31 15:25:01] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:01] [INFO ] Invariant cache hit.
[2024-05-31 15:25:03] [INFO ] Dead Transitions using invariants and state equation in 2309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5755 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-07 in 21324 ms.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-09
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:03] [INFO ] Computed 3 invariants in 18 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-31 15:25:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:03] [INFO ] Computed 3 invariants in 17 ms
[2024-05-31 15:25:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:04] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2024-05-31 15:25:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:25:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:04] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-31 15:25:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 1774 ms returned sat
[2024-05-31 15:25:07] [INFO ] Deduced a trap composed of 129 places in 497 ms of which 0 ms to minimize.
[2024-05-31 15:25:07] [INFO ] Deduced a trap composed of 137 places in 449 ms of which 0 ms to minimize.
[2024-05-31 15:25:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1170 ms
[2024-05-31 15:25:08] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 308 ms.
[2024-05-31 15:25:08] [INFO ] Added : 0 causal constraints over 0 iterations in 467 ms. Result :sat
Minimization took 873 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:09] [INFO ] Computed 3 invariants in 13 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1585 ms. (steps per millisecond=630 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
[2024-05-31 15:25:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:11] [INFO ] Computed 3 invariants in 16 ms
[2024-05-31 15:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:12] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-05-31 15:25:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:25:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:12] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-31 15:25:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:14] [INFO ] [Nat]Added 147 Read/Feed constraints in 1705 ms returned sat
[2024-05-31 15:25:15] [INFO ] Deduced a trap composed of 129 places in 504 ms of which 10 ms to minimize.
[2024-05-31 15:25:15] [INFO ] Deduced a trap composed of 137 places in 455 ms of which 1 ms to minimize.
[2024-05-31 15:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1192 ms
[2024-05-31 15:25:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 327 ms.
[2024-05-31 15:25:16] [INFO ] Added : 0 causal constraints over 0 iterations in 490 ms. Result :sat
Minimization took 869 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:25:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:17] [INFO ] Invariant cache hit.
[2024-05-31 15:25:18] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-31 15:25:18] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:18] [INFO ] Invariant cache hit.
[2024-05-31 15:25:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:20] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3029 ms to find 0 implicit places.
[2024-05-31 15:25:21] [INFO ] Redundant transitions in 635 ms returned []
[2024-05-31 15:25:21] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:21] [INFO ] Invariant cache hit.
[2024-05-31 15:25:23] [INFO ] Dead Transitions using invariants and state equation in 2531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6380 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-09 in 20107 ms.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-14
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:23] [INFO ] Computed 3 invariants in 13 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-31 15:25:23] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:23] [INFO ] Computed 3 invariants in 16 ms
[2024-05-31 15:25:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:24] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2024-05-31 15:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:25:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:24] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2024-05-31 15:25:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:25:29] [INFO ] [Nat]Added 147 Read/Feed constraints in 4509 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:29] [INFO ] Computed 3 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1457 ms. (steps per millisecond=686 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 1) seen :0
[2024-05-31 15:25:31] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:31] [INFO ] Computed 3 invariants in 16 ms
[2024-05-31 15:25:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:32] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2024-05-31 15:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:25:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:32] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2024-05-31 15:25:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 15:25:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 6037 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:25:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:39] [INFO ] Invariant cache hit.
[2024-05-31 15:25:39] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-31 15:25:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:39] [INFO ] Invariant cache hit.
[2024-05-31 15:25:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:42] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 2732 ms to find 0 implicit places.
[2024-05-31 15:25:42] [INFO ] Redundant transitions in 631 ms returned []
[2024-05-31 15:25:42] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:25:42] [INFO ] Invariant cache hit.
[2024-05-31 15:25:45] [INFO ] Dead Transitions using invariants and state equation in 2292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5863 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-14 in 21220 ms.
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-15
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:45] [INFO ] Computed 3 invariants in 13 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-31 15:25:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:45] [INFO ] Computed 3 invariants in 11 ms
[2024-05-31 15:25:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:45] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2024-05-31 15:25:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:25:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 15:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:46] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-31 15:25:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:48] [INFO ] [Nat]Added 147 Read/Feed constraints in 2734 ms returned sat
[2024-05-31 15:25:49] [INFO ] Deduced a trap composed of 132 places in 509 ms of which 1 ms to minimize.
[2024-05-31 15:25:49] [INFO ] Deduced a trap composed of 140 places in 325 ms of which 1 ms to minimize.
[2024-05-31 15:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1009 ms
[2024-05-31 15:25:50] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 335 ms.
[2024-05-31 15:25:50] [INFO ] Added : 3 causal constraints over 2 iterations in 852 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:51] [INFO ] Computed 3 invariants in 25 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1467 ms. (steps per millisecond=681 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 1) seen :0
[2024-05-31 15:25:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-31 15:25:53] [INFO ] Computed 3 invariants in 19 ms
[2024-05-31 15:25:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:53] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2024-05-31 15:25:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 15:25:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 15:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 15:25:54] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-31 15:25:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:25:57] [INFO ] [Nat]Added 147 Read/Feed constraints in 2751 ms returned sat
[2024-05-31 15:25:57] [INFO ] Deduced a trap composed of 132 places in 541 ms of which 1 ms to minimize.
[2024-05-31 15:25:58] [INFO ] Deduced a trap composed of 140 places in 325 ms of which 0 ms to minimize.
[2024-05-31 15:25:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1063 ms
[2024-05-31 15:25:58] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 309 ms.
[2024-05-31 15:25:59] [INFO ] Deduced a trap composed of 129 places in 522 ms of which 10 ms to minimize.
[2024-05-31 15:25:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
[2024-05-31 15:25:59] [INFO ] Added : 3 causal constraints over 2 iterations in 1698 ms. Result :sat
Minimization took 2022 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-31 15:26:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:26:02] [INFO ] Invariant cache hit.
[2024-05-31 15:26:03] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-31 15:26:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:26:03] [INFO ] Invariant cache hit.
[2024-05-31 15:26:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-31 15:26:05] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 3029 ms to find 0 implicit places.
[2024-05-31 15:26:06] [INFO ] Redundant transitions in 660 ms returned []
[2024-05-31 15:26:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-31 15:26:06] [INFO ] Invariant cache hit.
[2024-05-31 15:26:08] [INFO ] Dead Transitions using invariants and state equation in 2272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6160 ms. Remains : 305/305 places, 7808/7808 transitions.
Ending property specific reduction for Szymanski-PT-b04-UpperBounds-15 in 23415 ms.
[2024-05-31 15:26:09] [INFO ] Flatten gal took : 470 ms
[2024-05-31 15:26:09] [INFO ] Applying decomposition
[2024-05-31 15:26:09] [INFO ] Flatten gal took : 254 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14812799264081608204.txt' '-o' '/tmp/graph14812799264081608204.bin' '-w' '/tmp/graph14812799264081608204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14812799264081608204.bin' '-l' '-1' '-v' '-w' '/tmp/graph14812799264081608204.weights' '-q' '0' '-e' '0.001'
[2024-05-31 15:26:10] [INFO ] Decomposing Gal with order
[2024-05-31 15:26:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 15:26:11] [INFO ] Removed a total of 18109 redundant transitions.
[2024-05-31 15:26:11] [INFO ] Flatten gal took : 701 ms
[2024-05-31 15:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1092 labels/synchronizations in 291 ms.
[2024-05-31 15:26:11] [INFO ] Time to serialize gal into /tmp/UpperBounds18063092205809138549.gal : 86 ms
[2024-05-31 15:26:11] [INFO ] Time to serialize properties into /tmp/UpperBounds15829418010475297725.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18063092205809138549.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15829418010475297725.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds15829418010475297725.prop.
Detected timeout of ITS tools.
[2024-05-31 15:47:49] [INFO ] Flatten gal took : 1055 ms
[2024-05-31 15:47:49] [INFO ] Time to serialize gal into /tmp/UpperBounds6032172731058772847.gal : 102 ms
[2024-05-31 15:47:49] [INFO ] Time to serialize properties into /tmp/UpperBounds15311041186332746199.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6032172731058772847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15311041186332746199.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds15311041186332746199.prop.
Detected timeout of ITS tools.
[2024-05-31 16:09:40] [INFO ] Flatten gal took : 14328 ms
[2024-05-31 16:09:45] [INFO ] Input system was already deterministic with 7808 transitions.
[2024-05-31 16:09:46] [INFO ] Transformed 305 places.
[2024-05-31 16:09:46] [INFO ] Transformed 7808 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 16:09:46] [INFO ] Time to serialize gal into /tmp/UpperBounds3453040954934165603.gal : 61 ms
[2024-05-31 16:09:46] [INFO ] Time to serialize properties into /tmp/UpperBounds396251812009301133.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3453040954934165603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds396251812009301133.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds396251812009301133.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2272816 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15218200 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Szymanski-PT-b04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556700541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b04.tgz
mv Szymanski-PT-b04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;