About the Execution of 2023-gold for DBSingleClientW-PT-d2m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1196.636 | 100085.00 | 124584.00 | 414.40 | 0 0 1 0 1 1 0 0 0 1 1 2 0 1 1 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.r109-tall-171624208400346.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 DBSingleClientW-PT-d2m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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 DBSingleClientW-PT-d2m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716327974847
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=DBSingleClientW-PT-d2m05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 21:46:16] [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-21 21:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:46:16] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-21 21:46:16] [INFO ] Transformed 4763 places.
[2024-05-21 21:46:16] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:46:16] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 21:46:16] [INFO ] Computed 6 invariants in 158 ms
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 945 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
[2024-05-21 21:46:17] [INFO ] Invariant cache hit.
[2024-05-21 21:46:17] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-21 21:46:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 21:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:18] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-21 21:46:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 21:46:18] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:19] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-05-21 21:46:19] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 21:46:20] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1010 ms returned sat
[2024-05-21 21:46:21] [INFO ] Deduced a trap composed of 194 places in 592 ms of which 9 ms to minimize.
[2024-05-21 21:46:22] [INFO ] Deduced a trap composed of 217 places in 623 ms of which 2 ms to minimize.
[2024-05-21 21:46:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1475 ms
[2024-05-21 21:46:22] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 599 ms.
[2024-05-21 21:46:23] [INFO ] Added : 5 causal constraints over 1 iterations in 1469 ms. Result :unknown
[2024-05-21 21:46:23] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:46:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 21:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:24] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2024-05-21 21:46:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:46:24] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-21 21:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:25] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-05-21 21:46:27] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1590 ms returned sat
[2024-05-21 21:46:27] [INFO ] Deduced a trap composed of 75 places in 640 ms of which 2 ms to minimize.
[2024-05-21 21:46:28] [INFO ] Deduced a trap composed of 56 places in 633 ms of which 2 ms to minimize.
[2024-05-21 21:46:29] [INFO ] Deduced a trap composed of 198 places in 586 ms of which 5 ms to minimize.
[2024-05-21 21:46:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2234 ms
[2024-05-21 21:46:29] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 589 ms.
[2024-05-21 21:46:29] [INFO ] Added : 0 causal constraints over 0 iterations in 592 ms. Result :unknown
[2024-05-21 21:46:30] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-21 21:46:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:30] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-05-21 21:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:46:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:31] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2024-05-21 21:46:32] [INFO ] [Nat]Added 1588 Read/Feed constraints in 823 ms returned sat
[2024-05-21 21:46:32] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 372 ms.
[2024-05-21 21:46:33] [INFO ] Added : 14 causal constraints over 3 iterations in 1025 ms. Result :sat
Minimization took 1219 ms.
[2024-05-21 21:46:34] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-05-21 21:46:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-21 21:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:35] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-21 21:46:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:46:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 21:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:36] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2024-05-21 21:46:36] [INFO ] [Nat]Added 1588 Read/Feed constraints in 843 ms returned sat
[2024-05-21 21:46:37] [INFO ] Deduced a trap composed of 237 places in 552 ms of which 1 ms to minimize.
[2024-05-21 21:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 710 ms
[2024-05-21 21:46:37] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 363 ms.
[2024-05-21 21:46:38] [INFO ] Added : 5 causal constraints over 1 iterations in 629 ms. Result :sat
Minimization took 648 ms.
[2024-05-21 21:46:39] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:46:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 21:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:39] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2024-05-21 21:46:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:46:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 21:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:40] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2024-05-21 21:46:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1710 ms returned sat
[2024-05-21 21:46:43] [INFO ] Deduced a trap composed of 56 places in 664 ms of which 4 ms to minimize.
[2024-05-21 21:46:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1325 ms
[2024-05-21 21:46:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 394 ms.
[2024-05-21 21:46:45] [INFO ] Deduced a trap composed of 49 places in 631 ms of which 1 ms to minimize.
[2024-05-21 21:46:45] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
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-21 21:46:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:46:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:46] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2024-05-21 21:46:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:46:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 21:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:46] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-05-21 21:46:47] [INFO ] [Nat]Added 1588 Read/Feed constraints in 651 ms returned sat
[2024-05-21 21:46:48] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 366 ms.
[2024-05-21 21:46:48] [INFO ] Added : 2 causal constraints over 1 iterations in 620 ms. Result :sat
Minimization took 867 ms.
[2024-05-21 21:46:49] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-05-21 21:46:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:49] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2024-05-21 21:46:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:46:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:50] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2024-05-21 21:46:51] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1012 ms returned sat
[2024-05-21 21:46:52] [INFO ] Deduced a trap composed of 33 places in 619 ms of which 1 ms to minimize.
[2024-05-21 21:46:53] [INFO ] Deduced a trap composed of 28 places in 623 ms of which 2 ms to minimize.
[2024-05-21 21:46:53] [INFO ] Deduced a trap composed of 48 places in 619 ms of which 1 ms to minimize.
[2024-05-21 21:46:54] [INFO ] Deduced a trap composed of 103 places in 611 ms of which 1 ms to minimize.
[2024-05-21 21:46:55] [INFO ] Deduced a trap composed of 98 places in 584 ms of which 1 ms to minimize.
[2024-05-21 21:46: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 6
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-21 21:46:55] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-05-21 21:46:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 21:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:56] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2024-05-21 21:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:46:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:46:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:46:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:46:57] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-21 21:46:58] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1240 ms returned sat
[2024-05-21 21:46:58] [INFO ] Deduced a trap composed of 30 places in 620 ms of which 1 ms to minimize.
[2024-05-21 21:46:59] [INFO ] Deduced a trap composed of 29 places in 623 ms of which 2 ms to minimize.
[2024-05-21 21:47:00] [INFO ] Deduced a trap composed of 51 places in 609 ms of which 1 ms to minimize.
[2024-05-21 21:47:01] [INFO ] Deduced a trap composed of 125 places in 575 ms of which 1 ms to minimize.
[2024-05-21 21:47:01] [INFO ] Deduced a trap composed of 117 places in 564 ms of which 1 ms to minimize.
[2024-05-21 21:47:01] [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)
[2024-05-21 21:47:02] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-05-21 21:47:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:02] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2024-05-21 21:47:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:47:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:03] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2024-05-21 21:47:05] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1964 ms returned sat
[2024-05-21 21:47:05] [INFO ] Deduced a trap composed of 50 places in 616 ms of which 1 ms to minimize.
[2024-05-21 21:47:06] [INFO ] Deduced a trap composed of 102 places in 599 ms of which 1 ms to minimize.
[2024-05-21 21:47:07] [INFO ] Deduced a trap composed of 52 places in 622 ms of which 1 ms to minimize.
[2024-05-21 21:47:08] [INFO ] Deduced a trap composed of 52 places in 613 ms of which 1 ms to minimize.
[2024-05-21 21:47:08] [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 8
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) : [1944, 1944, 7, 5, 7, 2, 5, 5, 7] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1220
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1220
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1012 place count 748 transition count 1202
Discarding 311 places :
Symmetric choice reduction at 2 with 311 rule applications. Total rules 1323 place count 437 transition count 891
Iterating global reduction 2 with 311 rules applied. Total rules applied 1634 place count 437 transition count 891
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1645 place count 437 transition count 880
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 1879 place count 203 transition count 550
Iterating global reduction 3 with 234 rules applied. Total rules applied 2113 place count 203 transition count 550
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 3 with 207 rules applied. Total rules applied 2320 place count 203 transition count 343
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2342 place count 181 transition count 306
Iterating global reduction 4 with 22 rules applied. Total rules applied 2364 place count 181 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2374 place count 181 transition count 296
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2388 place count 167 transition count 282
Iterating global reduction 5 with 14 rules applied. Total rules applied 2402 place count 167 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2406 place count 167 transition count 278
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2417 place count 156 transition count 267
Iterating global reduction 6 with 11 rules applied. Total rules applied 2428 place count 156 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2433 place count 156 transition count 262
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2435 place count 154 transition count 258
Iterating global reduction 7 with 2 rules applied. Total rules applied 2437 place count 154 transition count 258
Applied a total of 2437 rules in 228 ms. Remains 154 /1183 variables (removed 1029) and now considering 258/2478 (removed 2220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 154/1183 places, 258/2478 transitions.
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:08] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229863 resets, run finished after 1648 ms. (steps per millisecond=606 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95011 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95509 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95661 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 96187 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 96125 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95289 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95618 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95751 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95563 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 9) seen :1
[2024-05-21 21:47:17] [INFO ] Invariant cache hit.
[2024-05-21 21:47:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:17] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:47:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:17] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:47:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 44 ms returned sat
[2024-05-21 21:47:17] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 21:47:17] [INFO ] Added : 18 causal constraints over 4 iterations in 117 ms. Result :sat
Minimization took 63 ms.
[2024-05-21 21:47:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:17] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:47:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:17] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:47:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 33 ms returned sat
[2024-05-21 21:47:17] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:17] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-05-21 21:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-21 21:47:17] [INFO ] Added : 14 causal constraints over 3 iterations in 186 ms. Result :sat
Minimization took 60 ms.
[2024-05-21 21:47:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:18] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:18] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:47:18] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 21:47:18] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 21:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-21 21:47:18] [INFO ] Added : 17 causal constraints over 5 iterations in 235 ms. Result :sat
Minimization took 56 ms.
[2024-05-21 21:47:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:47:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:18] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Nat]Added 111 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:47:18] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:18] [INFO ] Added : 26 causal constraints over 6 iterations in 173 ms. Result :sat
Minimization took 72 ms.
[2024-05-21 21:47:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:19] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:19] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 32 ms returned sat
[2024-05-21 21:47:19] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:19] [INFO ] Added : 14 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 57 ms.
[2024-05-21 21:47:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:19] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:47:19] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2024-05-21 21:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-21 21:47:19] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:19] [INFO ] Added : 2 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 31 ms.
[2024-05-21 21:47:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:19] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:19] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:47:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 27 ms returned sat
[2024-05-21 21:47:19] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:19] [INFO ] Added : 20 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 64 ms.
[2024-05-21 21:47:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:20] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:20] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:47:20] [INFO ] [Nat]Added 111 Read/Feed constraints in 27 ms returned sat
[2024-05-21 21:47:20] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 21:47:20] [INFO ] Added : 15 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 56 ms.
[2024-05-21 21:47:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:20] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:20] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:47:20] [INFO ] [Nat]Added 111 Read/Feed constraints in 26 ms returned sat
[2024-05-21 21:47:20] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:20] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-21 21:47:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:47:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2024-05-21 21:47:20] [INFO ] Added : 13 causal constraints over 3 iterations in 290 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [1944, 1944, 7, 5, 7, 2, 5, 5, 7] Max seen :[0, 0, 0, 0, 0, 1, 0, 0, 0]
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 154/154 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-21 21:47:21] [INFO ] Invariant cache hit.
[2024-05-21 21:47:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 21:47:21] [INFO ] Invariant cache hit.
[2024-05-21 21:47:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:22] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-21 21:47:22] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-21 21:47:22] [INFO ] Invariant cache hit.
[2024-05-21 21:47:22] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 154/154 places, 258/258 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02
[2024-05-21 21:47:22] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2301 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 943 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2024-05-21 21:47:22] [INFO ] Invariant cache hit.
[2024-05-21 21:47:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:22] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:22] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:47:22] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:22] [INFO ] [Nat]Added 111 Read/Feed constraints in 43 ms returned sat
[2024-05-21 21:47:22] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 21:47:22] [INFO ] Added : 18 causal constraints over 4 iterations in 117 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 130 transition count 198
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 128 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 127 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 127 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 125 transition count 177
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 125 transition count 177
Applied a total of 73 rules in 29 ms. Remains 125 /154 variables (removed 29) and now considering 177/258 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 125/154 places, 177/258 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-21 21:47:22] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229904 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95235 resets, run finished after 516 ms. (steps per millisecond=1937 ) properties (out of 1) seen :0
[2024-05-21 21:47:24] [INFO ] Invariant cache hit.
[2024-05-21 21:47:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:24] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 21:47:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:24] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:47:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 21:47:24] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:47:24] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 11 ms.
[2024-05-21 21:47:24] [INFO ] Added : 13 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 21:47:24] [INFO ] Invariant cache hit.
[2024-05-21 21:47:24] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 21:47:24] [INFO ] Invariant cache hit.
[2024-05-21 21:47:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 21:47:25] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-21 21:47:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:25] [INFO ] Invariant cache hit.
[2024-05-21 21:47:25] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 125/125 places, 177/177 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02 in 2965 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:25] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:47:25] [INFO ] Invariant cache hit.
[2024-05-21 21:47:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:25] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 21:47:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:25] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:47:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:25] [INFO ] [Nat]Added 111 Read/Feed constraints in 33 ms returned sat
[2024-05-21 21:47:25] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:25] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-21 21:47:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-21 21:47:25] [INFO ] Added : 14 causal constraints over 3 iterations in 199 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 131 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 131 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 125 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 125 transition count 178
Applied a total of 73 rules in 27 ms. Remains 125 /154 variables (removed 29) and now considering 178/258 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 125/154 places, 178/258 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 21:47:25] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229728 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95430 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 1) seen :0
[2024-05-21 21:47:27] [INFO ] Invariant cache hit.
[2024-05-21 21:47:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:27] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 21:47:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:27] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 21:47:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:47:27] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:47:27] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 11 ms.
[2024-05-21 21:47:27] [INFO ] Added : 19 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 21:47:27] [INFO ] Invariant cache hit.
[2024-05-21 21:47:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:47:27] [INFO ] Invariant cache hit.
[2024-05-21 21:47:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:47:28] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 21:47:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:47:28] [INFO ] Invariant cache hit.
[2024-05-21 21:47:28] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 125/125 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04 in 3070 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:28] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:47:28] [INFO ] Invariant cache hit.
[2024-05-21 21:47:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:28] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:47:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:47:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:28] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:47:28] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 21:47:28] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:47:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-21 21:47:28] [INFO ] Added : 17 causal constraints over 5 iterations in 227 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 51 place count 131 transition count 199
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 131 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 69 place count 126 transition count 176
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 126 transition count 176
Applied a total of 71 rules in 40 ms. Remains 126 /154 variables (removed 28) and now considering 176/258 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 126/154 places, 176/258 transitions.
// Phase 1: matrix 176 rows 126 cols
[2024-05-21 21:47:28] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229674 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95717 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 1) seen :0
[2024-05-21 21:47:30] [INFO ] Invariant cache hit.
[2024-05-21 21:47:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:30] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 21:47:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:30] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:47:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 21:47:30] [INFO ] [Nat]Added 55 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:47:30] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 125 transitions) in 14 ms.
[2024-05-21 21:47:30] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-21 21:47:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 21:47:30] [INFO ] Added : 20 causal constraints over 5 iterations in 159 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 21:47:30] [INFO ] Invariant cache hit.
[2024-05-21 21:47:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 21:47:31] [INFO ] Invariant cache hit.
[2024-05-21 21:47:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 21:47:31] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-21 21:47:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:47:31] [INFO ] Invariant cache hit.
[2024-05-21 21:47:31] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 126/126 places, 176/176 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 3088 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:31] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2312 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 919 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2024-05-21 21:47:31] [INFO ] Invariant cache hit.
[2024-05-21 21:47:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:31] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:47:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:31] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 21:47:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:31] [INFO ] [Nat]Added 111 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:47:31] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 21:47:31] [INFO ] Added : 26 causal constraints over 6 iterations in 183 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 245
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 137 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 133 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 133 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 132 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 132 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 131 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 131 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 128 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 128 transition count 179
Applied a total of 66 rules in 18 ms. Remains 128 /154 variables (removed 26) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 128/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 128 cols
[2024-05-21 21:47:31] [INFO ] Computed 2 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 229535 resets, run finished after 1243 ms. (steps per millisecond=804 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95618 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 1) seen :0
[2024-05-21 21:47:33] [INFO ] Invariant cache hit.
[2024-05-21 21:47:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:33] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:47:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:47:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 21:47:33] [INFO ] [Nat]Added 54 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:47:33] [INFO ] Computed and/alt/rep : 51/127/51 causal constraints (skipped 127 transitions) in 12 ms.
[2024-05-21 21:47:34] [INFO ] Added : 12 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/128 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 21:47:34] [INFO ] Invariant cache hit.
[2024-05-21 21:47:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:47:34] [INFO ] Invariant cache hit.
[2024-05-21 21:47:34] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 21:47:34] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-21 21:47:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:34] [INFO ] Invariant cache hit.
[2024-05-21 21:47:34] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 128/128 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09 in 3115 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:34] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 999 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2024-05-21 21:47:34] [INFO ] Invariant cache hit.
[2024-05-21 21:47:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:34] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:47:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:34] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 21:47:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 34 ms returned sat
[2024-05-21 21:47:34] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 21:47:34] [INFO ] Added : 14 causal constraints over 4 iterations in 102 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 132 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 132 transition count 207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 130 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 130 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 129 transition count 202
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 68 place count 126 transition count 179
Iterating global reduction 5 with 3 rules applied. Total rules applied 71 place count 126 transition count 179
Applied a total of 71 rules in 20 ms. Remains 126 /154 variables (removed 28) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 126/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 126 cols
[2024-05-21 21:47:35] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230046 resets, run finished after 1249 ms. (steps per millisecond=800 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96072 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 1) seen :0
[2024-05-21 21:47:36] [INFO ] Invariant cache hit.
[2024-05-21 21:47:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:36] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 21:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:47:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:47:37] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:47:37] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 10 ms.
[2024-05-21 21:47:37] [INFO ] Added : 18 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 21:47:37] [INFO ] Invariant cache hit.
[2024-05-21 21:47:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:47:37] [INFO ] Invariant cache hit.
[2024-05-21 21:47:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:47:37] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-21 21:47:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:37] [INFO ] Invariant cache hit.
[2024-05-21 21:47:37] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10 in 3134 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-11
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:37] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2024-05-21 21:47:37] [INFO ] Invariant cache hit.
[2024-05-21 21:47:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:37] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:47:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:37] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:47:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:47:37] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-21 21:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 21:47:37] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 21:47:37] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 247
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 247
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 244
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 236
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 131 transition count 200
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 131 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 130 transition count 199
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 130 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 129 transition count 198
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 129 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 129 transition count 195
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 66 place count 126 transition count 175
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 126 transition count 175
Applied a total of 69 rules in 19 ms. Remains 126 /154 variables (removed 28) and now considering 175/258 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/154 places, 175/258 transitions.
// Phase 1: matrix 175 rows 126 cols
[2024-05-21 21:47:37] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229577 resets, run finished after 1100 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95211 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 1) seen :1
[2024-05-21 21:47:39] [INFO ] Invariant cache hit.
[2024-05-21 21:47:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:39] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-21 21:47:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-21 21:47:39] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:47:39] [INFO ] [Nat]Added 51 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:47:39] [INFO ] Computed and/alt/rep : 50/125/50 causal constraints (skipped 124 transitions) in 10 ms.
[2024-05-21 21:47:39] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-05-21 21:47:39] [INFO ] Invariant cache hit.
[2024-05-21 21:47:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 21:47:39] [INFO ] Invariant cache hit.
[2024-05-21 21:47:39] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:47:40] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 21:47:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:40] [INFO ] Invariant cache hit.
[2024-05-21 21:47:40] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 126/126 places, 175/175 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-11 in 2582 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:40] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2278 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 866 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:47:40] [INFO ] Invariant cache hit.
[2024-05-21 21:47:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:40] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:47:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:40] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 21:47:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 27 ms returned sat
[2024-05-21 21:47:40] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 21:47:40] [INFO ] Added : 20 causal constraints over 4 iterations in 114 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 141 transition count 236
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 141 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 141 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 138 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 138 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 138 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 134 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 133 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 133 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 133 transition count 201
Applied a total of 55 rules in 15 ms. Remains 133 /154 variables (removed 21) and now considering 201/258 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 133/154 places, 201/258 transitions.
// Phase 1: matrix 201 rows 133 cols
[2024-05-21 21:47:40] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229934 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96006 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 1) seen :0
[2024-05-21 21:47:42] [INFO ] Invariant cache hit.
[2024-05-21 21:47:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:42] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:47:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:42] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:47:42] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:47:42] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:47:42] [INFO ] Computed and/alt/rep : 52/123/52 causal constraints (skipped 148 transitions) in 12 ms.
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:47:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-21 21:47:43] [INFO ] Added : 16 causal constraints over 4 iterations in 172 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 133/133 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-21 21:47:43] [INFO ] Invariant cache hit.
[2024-05-21 21:47:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:47:43] [INFO ] Invariant cache hit.
[2024-05-21 21:47:43] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:47:43] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 21:47:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:43] [INFO ] Invariant cache hit.
[2024-05-21 21:47:43] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 133/133 places, 201/201 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13 in 3343 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:43] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 981 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:47:43] [INFO ] Invariant cache hit.
[2024-05-21 21:47:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:43] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:47:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:43] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:47:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:43] [INFO ] [Nat]Added 111 Read/Feed constraints in 29 ms returned sat
[2024-05-21 21:47:43] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 21:47:43] [INFO ] Added : 15 causal constraints over 4 iterations in 112 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 137 transition count 224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 135 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 135 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 133 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 133 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 133 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 132 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 132 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 132 transition count 214
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 60 place count 129 transition count 194
Iterating global reduction 5 with 3 rules applied. Total rules applied 63 place count 129 transition count 194
Applied a total of 63 rules in 14 ms. Remains 129 /154 variables (removed 25) and now considering 194/258 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 129/154 places, 194/258 transitions.
// Phase 1: matrix 194 rows 129 cols
[2024-05-21 21:47:44] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230107 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95870 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties (out of 1) seen :0
[2024-05-21 21:47:45] [INFO ] Invariant cache hit.
[2024-05-21 21:47:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:45] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:47:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:47:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:47:45] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 143 transitions) in 13 ms.
[2024-05-21 21:47:46] [INFO ] Added : 11 causal constraints over 3 iterations in 57 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 129/129 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-21 21:47:46] [INFO ] Invariant cache hit.
[2024-05-21 21:47:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:47:46] [INFO ] Invariant cache hit.
[2024-05-21 21:47:46] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:47:46] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-21 21:47:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:46] [INFO ] Invariant cache hit.
[2024-05-21 21:47:46] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 129/129 places, 194/194 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14 in 3068 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:47:46] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2292 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 970 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:47:46] [INFO ] Invariant cache hit.
[2024-05-21 21:47:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:46] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:47:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:46] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:47:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:47:46] [INFO ] [Nat]Added 111 Read/Feed constraints in 25 ms returned sat
[2024-05-21 21:47:46] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:47:46] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-05-21 21:47:47] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 16 ms to minimize.
[2024-05-21 21:47:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2024-05-21 21:47:47] [INFO ] Added : 13 causal constraints over 3 iterations in 292 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 140 transition count 237
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 140 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 140 transition count 235
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 137 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 137 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 137 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 132 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 130 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 130 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 129 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 129 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 126 transition count 174
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 126 transition count 174
Applied a total of 70 rules in 15 ms. Remains 126 /154 variables (removed 28) and now considering 174/258 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/154 places, 174/258 transitions.
// Phase 1: matrix 174 rows 126 cols
[2024-05-21 21:47:47] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229986 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95895 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 1) seen :0
[2024-05-21 21:47:48] [INFO ] Invariant cache hit.
[2024-05-21 21:47:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-21 21:47:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:47:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:47:49] [INFO ] [Nat]Added 51 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:47:49] [INFO ] Computed and/alt/rep : 50/124/50 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-21 21:47:49] [INFO ] Added : 9 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 21:47:49] [INFO ] Invariant cache hit.
[2024-05-21 21:47:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:47:49] [INFO ] Invariant cache hit.
[2024-05-21 21:47:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:47:49] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-21 21:47:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:47:49] [INFO ] Invariant cache hit.
[2024-05-21 21:47:49] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 126/126 places, 174/174 transitions.
[2024-05-21 21:47:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229661 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95425 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 1) seen :0
[2024-05-21 21:47:51] [INFO ] Invariant cache hit.
[2024-05-21 21:47:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:47:51] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15 in 4608 ms.
[2024-05-21 21:47:51] [INFO ] Flatten gal took : 50 ms
[2024-05-21 21:47:51] [INFO ] Applying decomposition
[2024-05-21 21:47:51] [INFO ] Flatten gal took : 17 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/graph6810979202697393690.txt' '-o' '/tmp/graph6810979202697393690.bin' '-w' '/tmp/graph6810979202697393690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6810979202697393690.bin' '-l' '-1' '-v' '-w' '/tmp/graph6810979202697393690.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:47:51] [INFO ] Decomposing Gal with order
[2024-05-21 21:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:47:51] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-21 21:47:51] [INFO ] Flatten gal took : 55 ms
[2024-05-21 21:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 11 ms.
[2024-05-21 21:47:51] [INFO ] Time to serialize gal into /tmp/UpperBounds7052919428345017134.gal : 7 ms
[2024-05-21 21:47:51] [INFO ] Time to serialize properties into /tmp/UpperBounds15471253275226040035.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/UpperBounds7052919428345017134.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15471253275226040035.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 ...284
Loading property file /tmp/UpperBounds15471253275226040035.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,365195,2.14447,82708,1977,2358,62196,74777,611,375174,266,494738,0
Total reachable state count : 365195
Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-02 :0 <= u13.l1613 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-02,0,2.23536,82708,1,0,62196,74777,753,375174,319,494738,1607
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-04 :0 <= i6.u14.l1723 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-04,0,2.24301,82708,1,0,62196,74777,782,375174,324,494738,1746
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-05 :0 <= i0.u15.p260 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-05,0,2.2445,82708,1,0,62196,74777,811,375174,334,494738,2182
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-09 :0 <= i7.u21.l4116 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-09,0,2.24547,82708,1,0,62196,74777,832,375174,338,494738,2378
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-10 :0 <= i6.u7.p269 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-10,0,2.24622,82708,1,0,62196,74777,856,375174,344,494738,2512
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-11 :0 <= i0.u0.l3672 <= 2
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-11,0,2.25216,82708,1,0,62196,74777,877,375174,376,494738,3438
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-13 :0 <= i6.u12.l2317 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-13,0,2.25384,82708,1,0,62196,74777,902,375174,383,494738,3541
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-14 :0 <= i0.u0.l2295 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-14,0,2.25654,82708,1,0,62196,74777,923,375174,422,494738,4394
Total runtime 97763 ms.
BK_STOP 1716328074932
--------------------
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="DBSingleClientW-PT-d2m05"
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 DBSingleClientW-PT-d2m05, 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 r109-tall-171624208400346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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 ;