fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189600597
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7173.220 841788.00 984569.00 1942.60 0 1 0 8 0 0 0 1 0 0 0 0 0 0 0 0 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.r092-tall-171624189600597.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 itstools
Input is DBSingleClientW-PT-d2m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189600597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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-d2m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716333587199

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 23:19:48] [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 23:19:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:19:48] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-21 23:19:48] [INFO ] Transformed 4763 places.
[2024-05-21 23:19:48] [INFO ] Transformed 2478 transitions.
[2024-05-21 23:19:48] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 26 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 23:19:48] [INFO ] Computed 6 invariants in 144 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 10000 steps (2313 resets) in 349 ms. (28 steps per ms)
BEST_FIRST walk for 30001 steps (2836 resets) in 188 ms. (158 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
[2024-05-21 23:19:49] [INFO ] Invariant cache hit.
[2024-05-21 23:19:50] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2024-05-21 23:19:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 29 ms returned sat
[2024-05-21 23:19:51] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2024-05-21 23:19:51] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 23:19:52] [INFO ] [Real]Added 1588 Read/Feed constraints in 990 ms returned sat
[2024-05-21 23:19:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 49 ms returned sat
[2024-05-21 23:19:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2024-05-21 23:19:53] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2024-05-21 23:19:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 926 ms returned sat
[2024-05-21 23:19:55] [INFO ] Deduced a trap composed of 194 places in 1010 ms of which 78 ms to minimize.
[2024-05-21 23:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1236 ms
[2024-05-21 23:19:56] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 748 ms.
[2024-05-21 23:19:57] [INFO ] Added : 14 causal constraints over 3 iterations in 1606 ms. Result :sat
Minimization took 259 ms.
[2024-05-21 23:19:57] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 23:19:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 23:19:58] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2024-05-21 23:19:59] [INFO ] [Real]Added 1588 Read/Feed constraints in 845 ms returned sat
[2024-05-21 23:19:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2024-05-21 23:19:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 23:20:00] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-21 23:20:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 735 ms returned sat
[2024-05-21 23:20:02] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 801 ms.
[2024-05-21 23:20:02] [INFO ] Added : 1 causal constraints over 1 iterations in 1100 ms. Result :sat
Minimization took 624 ms.
[2024-05-21 23:20:03] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2024-05-21 23:20:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 23:20:03] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-21 23:20:04] [INFO ] [Real]Added 1588 Read/Feed constraints in 697 ms returned sat
[2024-05-21 23:20:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2024-05-21 23:20:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 23:20:05] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2024-05-21 23:20:06] [INFO ] [Nat]Added 1588 Read/Feed constraints in 874 ms returned sat
[2024-05-21 23:20:07] [INFO ] Deduced a trap composed of 202 places in 664 ms of which 33 ms to minimize.
[2024-05-21 23:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 819 ms
[2024-05-21 23:20:07] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 690 ms.
[2024-05-21 23:20:08] [INFO ] Added : 12 causal constraints over 3 iterations in 1352 ms. Result :sat
Minimization took 616 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
Support contains 3 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.16 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) 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 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 609 place count 745 transition count 1200
Iterating global reduction 1 with 391 rules applied. Total rules applied 1000 place count 745 transition count 1200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1009 place count 745 transition count 1191
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1325 place count 429 transition count 875
Iterating global reduction 2 with 316 rules applied. Total rules applied 1641 place count 429 transition count 875
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1653 place count 429 transition count 863
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1893 place count 189 transition count 522
Iterating global reduction 3 with 240 rules applied. Total rules applied 2133 place count 189 transition count 522
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2344 place count 189 transition count 311
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2369 place count 164 transition count 271
Iterating global reduction 4 with 25 rules applied. Total rules applied 2394 place count 164 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2400 place count 164 transition count 265
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2417 place count 147 transition count 248
Iterating global reduction 5 with 17 rules applied. Total rules applied 2434 place count 147 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2438 place count 147 transition count 244
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2452 place count 133 transition count 230
Iterating global reduction 6 with 14 rules applied. Total rules applied 2466 place count 133 transition count 230
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2479 place count 133 transition count 217
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2485 place count 127 transition count 188
Iterating global reduction 7 with 6 rules applied. Total rules applied 2491 place count 127 transition count 188
Applied a total of 2491 rules in 382 ms. Remains 127 /1183 variables (removed 1056) and now considering 188/2478 (removed 2290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 127/1183 places, 188/2478 transitions.
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 23:20:09] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 1000000 steps (229619 resets) in 1307 ms. (764 steps per ms)
BEST_FIRST walk for 3000001 steps (287450 resets) in 1673 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
[2024-05-21 23:20:12] [INFO ] Invariant cache hit.
[2024-05-21 23:20:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 23:20:12] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 23:20:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:20:12] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2024-05-21 23:20:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:20:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 23:20:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-21 23:20:12] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-21 23:20:12] [INFO ] Added : 13 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 124 ms.
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-21 23:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-21 23:20:13] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 17 ms.
[2024-05-21 23:20:13] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 84 ms.
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-21 23:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2024-05-21 23:20:13] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 20 ms.
[2024-05-21 23:20:13] [INFO ] Added : 28 causal constraints over 6 iterations in 110 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 23:20:13] [INFO ] Invariant cache hit.
[2024-05-21 23:20:14] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 23:20:14] [INFO ] Invariant cache hit.
[2024-05-21 23:20:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:20:14] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2024-05-21 23:20:14] [INFO ] Redundant transitions in 5 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-21 23:20:15] [INFO ] Invariant cache hit.
[2024-05-21 23:20:15] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 195 constraints, problems are : Problem set: 0 solved, 187 unsolved in 4999 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 382 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13210 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 18731ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 18741ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19826 ms. Remains : 127/127 places, 188/188 transitions.
[2024-05-21 23:20:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
RANDOM walk for 1000000 steps (229889 resets) in 1161 ms. (860 steps per ms)
BEST_FIRST walk for 3000002 steps (287959 resets) in 1615 ms. (1856 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
[2024-05-21 23:20:36] [INFO ] Invariant cache hit.
[2024-05-21 23:20:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:20:36] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 23:20:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:20:36] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2024-05-21 23:20:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:20:36] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 23:20:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-21 23:20:36] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 11 ms.
[2024-05-21 23:20:36] [INFO ] Added : 13 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 98 ms.
[2024-05-21 23:20:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:20:36] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 23:20:36] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-21 23:20:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:20:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 23:20:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2024-05-21 23:20:37] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 11 ms.
[2024-05-21 23:20:37] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 87 ms.
[2024-05-21 23:20:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:20:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 23:20:37] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-21 23:20:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:20:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 23:20:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-21 23:20:37] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 20 ms.
[2024-05-21 23:20:37] [INFO ] Added : 28 causal constraints over 6 iterations in 110 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 21 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 23:20:37] [INFO ] Invariant cache hit.
[2024-05-21 23:20:37] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:20:37] [INFO ] Invariant cache hit.
[2024-05-21 23:20:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:20:38] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-21 23:20:38] [INFO ] Redundant transitions in 9 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-21 23:20:38] [INFO ] Invariant cache hit.
[2024-05-21 23:20:38] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 195 constraints, problems are : Problem set: 0 solved, 187 unsolved in 4808 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/315 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 187/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 382 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13191 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 18242ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 18249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18598 ms. Remains : 127/127 places, 188/188 transitions.
RANDOM walk for 40000 steps (9234 resets) in 1374 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3742 resets) in 394 ms. (101 steps per ms) remains 6/6 properties
[2024-05-21 23:20:57] [INFO ] Flatten gal took : 106 ms
BEST_FIRST walk for 40002 steps (3856 resets) in 570 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3911 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
[2024-05-21 23:20:57] [INFO ] Flatten gal took : 102 ms
BEST_FIRST walk for 40003 steps (3909 resets) in 321 ms. (124 steps per ms) remains 6/6 properties
[2024-05-21 23:20:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6492667914278131235.gal : 167 ms
[2024-05-21 23:20:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6635026552108041716.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6492667914278131235.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6635026552108041716.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3823 resets) in 309 ms. (129 steps per ms) remains 6/6 properties

BEST_FIRST walk for 40004 steps (3868 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6635026552108041716.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :528 after 928
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :928 after 2304
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2304 after 15502
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :15502 after 78652
Interrupted probabilistic random walk after 664438 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :2 out of 6
Probabilistic random walk after 664438 steps, saw 276374 distinct states, run finished after 3005 ms. (steps per millisecond=221 ) properties seen :2
[2024-05-21 23:21:00] [INFO ] Invariant cache hit.
[2024-05-21 23:21:00] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 151/161 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 67/228 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 12 (OVERLAPS) 72/315 variables, 54/154 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 41/195 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 8192
Problem MAX1 is UNSAT
SDD size :78652 after 770759
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/315 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 196 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1471 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/135 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 8/13 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/207 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 53/68 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/222 variables, 1/69 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 11/80 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/80 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/315 variables, 58/138 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 58/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/315 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 197 constraints, problems are : Problem set: 3 solved, 1 unsolved in 688 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2195ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 125 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 123 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 123 transition count 168
Applied a total of 10 rules in 26 ms. Remains 123 /127 variables (removed 4) and now considering 168/188 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 123/127 places, 168/188 transitions.
RANDOM walk for 40000 steps (9216 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3925 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :770759 after 2.55562e+06
Interrupted probabilistic random walk after 1916859 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :0 out of 1
Probabilistic random walk after 1916859 steps, saw 799529 distinct states, run finished after 3016 ms. (steps per millisecond=635 ) properties seen :0
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 23:21:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 23:21:05] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/204 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/219 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/291 variables, 54/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 23:21:06] [INFO ] Invariant cache hit.
[2024-05-21 23:21:07] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 23:21:07] [INFO ] Invariant cache hit.
[2024-05-21 23:21:07] [INFO ] State equation strengthened by 49 read => feed constraints.
Invariant property MIN1 does not hold.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.55562e+06 after 4.1641e+07
[2024-05-21 23:21:08] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2024-05-21 23:21:08] [INFO ] Redundant transitions in 10 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 23:21:08] [INFO ] Invariant cache hit.
[2024-05-21 23:21:08] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
Invariant property MIN0 does not hold.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :4.1641e+07 after 5.38691e+07
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5339 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :5.38691e+07 after 5.74548e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
Invariant property MIN2 does not hold.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :5.74548e+07 after 6.56413e+07
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 21968 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 27624ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 27637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29127 ms. Remains : 123/123 places, 168/168 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 4, 0] Max Struct:[3255, 10, 3255]
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3255]
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 23:21:35] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 10000 steps (2258 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (915 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-21 23:21:35] [INFO ] Invariant cache hit.
[2024-05-21 23:21:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 23:21:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 23:21:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:21:36] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2024-05-21 23:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:21:36] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 23:21:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-21 23:21:36] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 11 ms.
[2024-05-21 23:21:36] [INFO ] Added : 13 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 178
Applied a total of 5 rules in 14 ms. Remains 125 /127 variables (removed 2) and now considering 178/188 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 125/127 places, 178/188 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 23:21:36] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 1000000 steps (229804 resets) in 1262 ms. (791 steps per ms)
BEST_FIRST walk for 1000001 steps (95629 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-21 23:21:38] [INFO ] Invariant cache hit.
[2024-05-21 23:21:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:21:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 23:21:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 23:21:38] [INFO ] [Real]Added 57 Read/Feed constraints in 9 ms returned sat
[2024-05-21 23:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:21:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 23:21:38] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-21 23:21:38] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 16 ms.
[2024-05-21 23:21:38] [INFO ] Added : 12 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
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 23:21:38] [INFO ] Invariant cache hit.
[2024-05-21 23:21:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:21:38] [INFO ] Invariant cache hit.
[2024-05-21 23:21:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 23:21:39] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-21 23:21:39] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 23:21:39] [INFO ] Invariant cache hit.
[2024-05-21 23:21:39] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5145 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9783 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 15206ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 15208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15818 ms. Remains : 125/125 places, 178/178 transitions.
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 63 ms
RANDOM walk for 40000 steps (9286 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:21:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6793343504745727586.gal : 17 ms
[2024-05-21 23:21:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12441503962779597087.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6793343504745727586.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12441503962779597087.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12441503962779597087.prop.
BEST_FIRST walk for 40001 steps (3778 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40001 steps (3832 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 928
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :928 after 2100
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2100 after 14818
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14818 after 66419
Interrupted probabilistic random walk after 1703830 steps, run timeout after 3009 ms. (steps per millisecond=566 ) properties seen :1 out of 2
Probabilistic random walk after 1703830 steps, saw 709518 distinct states, run finished after 3009 ms. (steps per millisecond=566 ) properties seen :1
[2024-05-21 23:21:57] [INFO ] Invariant cache hit.
[2024-05-21 23:21:57] [INFO ] State equation strengthened by 57 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :66419 after 688019
At refinement iteration 3 (OVERLAPS) 131/135 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 71/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 186 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3255]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-01 in 21980 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 23:21:57] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (2318 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (983 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[10]
[2024-05-21 23:21:57] [INFO ] Invariant cache hit.
[2024-05-21 23:21:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-21 23:21:58] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 23:21:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:21:58] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-21 23:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:21:58] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 23:21:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2024-05-21 23:21:58] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 13 ms.
[2024-05-21 23:21:58] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[10]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 125 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 123 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 123 transition count 168
Applied a total of 10 rules in 7 ms. Remains 123 /127 variables (removed 4) and now considering 168/188 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 123/127 places, 168/188 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 23:21:58] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[10]
RANDOM walk for 1000000 steps (229674 resets) in 1017 ms. (982 steps per ms)
BEST_FIRST walk for 1000001 steps (96195 resets) in 471 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-21 23:21:59] [INFO ] Invariant cache hit.
[2024-05-21 23:21:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:21:59] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-21 23:21:59] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 23:21:59] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 23:21:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:21:59] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 23:21:59] [INFO ] [Nat]Added 49 Read/Feed constraints in 5 ms returned sat
[2024-05-21 23:21:59] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2024-05-21 23:21:59] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 23:22:00] [INFO ] Invariant cache hit.
[2024-05-21 23:22:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 23:22:00] [INFO ] Invariant cache hit.
[2024-05-21 23:22:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 23:22:00] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 23:22:00] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 23:22:00] [INFO ] Invariant cache hit.
[2024-05-21 23:22:00] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4772 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11694 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 16741ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 16742ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17047 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 23:22:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (229495 resets) in 1007 ms. (992 steps per ms)
BEST_FIRST walk for 1000000 steps (96535 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2024-05-21 23:22:18] [INFO ] Invariant cache hit.
[2024-05-21 23:22:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 23:22:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 23:22:18] [INFO ] [Real]Added 49 Read/Feed constraints in 21 ms returned sat
[2024-05-21 23:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:18] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 23:22:18] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 23:22:18] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-21 23:22:18] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 23:22:18] [INFO ] Invariant cache hit.
[2024-05-21 23:22:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 23:22:18] [INFO ] Invariant cache hit.
[2024-05-21 23:22:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 23:22:19] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 23:22:19] [INFO ] Redundant transitions in 0 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 23:22:19] [INFO ] Invariant cache hit.
[2024-05-21 23:22:19] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4228 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11488 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15920ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15922ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16223 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 23:22:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[10]
RANDOM walk for 1000000 steps (230098 resets) in 1027 ms. (972 steps per ms)
BEST_FIRST walk for 1000001 steps (96197 resets) in 472 ms. (2114 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[10]
[2024-05-21 23:22:36] [INFO ] Invariant cache hit.
[2024-05-21 23:22:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 23:22:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 23:22:36] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 23:22:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 23:22:36] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-21 23:22:36] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 23:22:36] [INFO ] Invariant cache hit.
[2024-05-21 23:22:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 23:22:36] [INFO ] Invariant cache hit.
[2024-05-21 23:22:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 23:22:37] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 23:22:37] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 23:22:37] [INFO ] Invariant cache hit.
[2024-05-21 23:22:37] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 4035 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 11642 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 15903ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15905ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16229 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 23:22:53] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 40000 steps (9185 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2024-05-21 23:22:53] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:22:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4766062467301159189.gal : 18 ms
[2024-05-21 23:22:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6442595877615087278.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4766062467301159189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6442595877615087278.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (3894 resets) in 159 ms. (250 steps per ms) remains 1/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2024-05-21 23:22:53] [INFO ] Invariant cache hit.
[2024-05-21 23:22:53] [INFO ] State equation strengthened by 49 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality6442595877615087278.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 928
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :928 after 2100
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 291/291 variables, and 175 constraints, problems are : Problem set: 1 solved, 0 unsolved in 473 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 486ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[10]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03 in 55876 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3255]
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 23:22:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 10000 steps (2347 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (990 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-21 23:22:53] [INFO ] Invariant cache hit.
[2024-05-21 23:22:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:53] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 23:22:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 23:22:53] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-21 23:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:53] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 23:22:53] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-21 23:22:53] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 25 ms.
[2024-05-21 23:22:54] [INFO ] Added : 28 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 178
Applied a total of 5 rules in 7 ms. Remains 125 /127 variables (removed 2) and now considering 178/188 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 125/127 places, 178/188 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 23:22:54] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 1000000 steps (229651 resets) in 1059 ms. (943 steps per ms)
BEST_FIRST walk for 1000001 steps (95515 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2024-05-21 23:22:55] [INFO ] Invariant cache hit.
[2024-05-21 23:22:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:55] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 23:22:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 23:22:55] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 23:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 23:22:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 23:22:55] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 23:22:56] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 9 ms.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 584 ms
[2024-05-21 23:22:56] [INFO ] Added : 21 causal constraints over 5 iterations in 678 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
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 3 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 3 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 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
[2024-05-21 23:22:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 23:22:57] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 23:22:57] [INFO ] Redundant transitions in 0 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 23:22:57] [INFO ] Invariant cache hit.
[2024-05-21 23:22:57] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5130 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 13969 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 19330ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 19332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19654 ms. Remains : 125/125 places, 178/178 transitions.
[2024-05-21 23:23:16] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 40000 steps (9159 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2024-05-21 23:23:16] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:23:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14849918999950350335.gal : 2 ms
[2024-05-21 23:23:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18427403602751769239.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14849918999950350335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18427403602751769239.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (3828 resets) in 40 ms. (975 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18427403602751769239.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40001 steps (3827 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 898
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :898 after 1648
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1648 after 14578
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14578 after 77024
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :77024 after 744229
Interrupted probabilistic random walk after 2204339 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :1 out of 2
Probabilistic random walk after 2204339 steps, saw 901946 distinct states, run finished after 3001 ms. (steps per millisecond=734 ) properties seen :1
[2024-05-21 23:23:19] [INFO ] Invariant cache hit.
[2024-05-21 23:23:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 9/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3255]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07 in 25910 ms.
[2024-05-21 23:23:19] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:23:19] [INFO ] Applying decomposition
[2024-05-21 23:23:19] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2312284489389617472.txt' '-o' '/tmp/graph2312284489389617472.bin' '-w' '/tmp/graph2312284489389617472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2312284489389617472.bin' '-l' '-1' '-v' '-w' '/tmp/graph2312284489389617472.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:23:19] [INFO ] Decomposing Gal with order
[2024-05-21 23:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:23:19] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-21 23:23:19] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:23:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 14 ms.
[2024-05-21 23:23:19] [INFO ] Time to serialize gal into /tmp/UpperBounds13247758741616798366.gal : 4 ms
[2024-05-21 23:23:19] [INFO ] Time to serialize properties into /tmp/UpperBounds1080051228244472185.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13247758741616798366.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1080051228244472185.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds1080051228244472185.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,9.63576e+08,612.939,5677756,13623,5754,4.50708e+06,724835,558,4.71924e+07,177,8.25209e+06,0
Total reachable state count : 963575600

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-01 :0 <= u1.l1772 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-01 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-d2m10-UpperBounds-01,0,621.931,5677756,1,0,4.50708e+06,724835,682,4.71924e+07,213,8.25209e+06,4357
Min sum of variable value : 0
Maximum sum along a path : 8
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-03 :0 <= i4.u6.l3696 <= 8
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-03 8 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-d2m10-UpperBounds-03,0,627.197,5677756,1,0,4.50708e+06,724835,704,4.71924e+07,225,8.25209e+06,6518
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-07 :0 <= i5.u14.l1710 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-07 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-d2m10-UpperBounds-07,0,627.749,5677756,1,0,4.50708e+06,724835,723,4.71924e+07,244,8.25209e+06,7095
Total runtime 840632 ms.

BK_STOP 1716334428987

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d2m10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d2m10, 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 r092-tall-171624189600597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m10.tgz
mv DBSingleClientW-PT-d2m10 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;