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.r091-tall-171624188300717.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 greatspnxred
Input is DES-PT-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300717
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K 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 DES-PT-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716322809243

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 20:20:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 20:20:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:20:10] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-21 20:20:10] [INFO ] Transformed 274 places.
[2024-05-21 20:20:10] [INFO ] Transformed 231 transitions.
[2024-05-21 20:20:10] [INFO ] Found NUPN structural information;
[2024-05-21 20:20:10] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 217 rows 274 cols
[2024-05-21 20:20:10] [INFO ] Computed 59 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (208 resets) in 54 ms. (181 steps per ms)
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (319 resets) in 98 ms. (707 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-21 20:20:10] [INFO ] Invariant cache hit.
[2024-05-21 20:20:11] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-21 20:20:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 20:20:11] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-21 20:20:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:11] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 20:20:11] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:11] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 20:20:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:20:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2024-05-21 20:20:11] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-21 20:20:11] [INFO ] Added : 95 causal constraints over 19 iterations in 496 ms. Result :sat
Minimization took 113 ms.
[2024-05-21 20:20:12] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 20:20:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:12] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-21 20:20:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 20:20:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:12] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-21 20:20:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:20:12] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 25 ms.
[2024-05-21 20:20:13] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 16 ms to minimize.
[2024-05-21 20:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-21 20:20:13] [INFO ] Added : 67 causal constraints over 14 iterations in 558 ms. Result :sat
Minimization took 135 ms.
[2024-05-21 20:20:13] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 20:20:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:13] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-21 20:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 20:20:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:13] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-21 20:20:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:20:13] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-21 20:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-21 20:20:13] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 14 ms.
[2024-05-21 20:20:14] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:20:14] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:20:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-21 20:20:14] [INFO ] Added : 80 causal constraints over 17 iterations in 670 ms. Result :sat
Minimization took 119 ms.
[2024-05-21 20:20:14] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 20:20:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:14] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-21 20:20:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 20:20:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:15] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-05-21 20:20:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2024-05-21 20:20:15] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:20:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:20:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-05-21 20:20:15] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-21 20:20:16] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-21 20:20:16] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-21 20:20:16] [INFO ] Added : 194 causal constraints over 41 iterations in 1518 ms. Result :sat
Minimization took 152 ms.
[2024-05-21 20:20:17] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 20:20:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:17] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-21 20:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-21 20:20:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:17] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-21 20:20:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2024-05-21 20:20:17] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-21 20:20:17] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 20 ms.
[2024-05-21 20:20:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-21 20:20:17] [INFO ] Added : 81 causal constraints over 17 iterations in 459 ms. Result :sat
Minimization took 153 ms.
[2024-05-21 20:20:18] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 20:20:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:20:18] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-21 20:20:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 20:20:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:18] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-21 20:20:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2024-05-21 20:20:18] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 15 ms.
[2024-05-21 20:20:19] [INFO ] Added : 134 causal constraints over 28 iterations in 625 ms. Result :sat
Minimization took 119 ms.
[2024-05-21 20:20:19] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 20:20:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:19] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 20:20:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 20:20:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:20:19] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-21 20:20:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2024-05-21 20:20:19] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-21 20:20:20] [INFO ] Added : 97 causal constraints over 20 iterations in 621 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 271 transition count 213
Applied a total of 12 rules in 96 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:20:21] [INFO ] Computed 60 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13748 resets) in 2011 ms. (497 steps per ms)
BEST_FIRST walk for 5000004 steps (11428 resets) in 4402 ms. (1135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-21 20:20:28] [INFO ] Invariant cache hit.
[2024-05-21 20:20:28] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:28] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:28] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 20:20:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:20:28] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:20:28] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
[2024-05-21 20:20:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:20:28] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 20:20:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-21 20:20:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:20:28] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-21 20:20:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-21 20:20:28] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 20:20:29] [INFO ] Added : 85 causal constraints over 17 iterations in 282 ms. Result :sat
Minimization took 106 ms.
[2024-05-21 20:20:29] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 20:20:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 20:20:29] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-21 20:20:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:29] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-21 20:20:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:20:29] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 20:20:29] [INFO ] Added : 75 causal constraints over 15 iterations in 253 ms. Result :sat
Minimization took 92 ms.
[2024-05-21 20:20:29] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-21 20:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:20:30] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 20:20:30] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:20:30] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:20:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-05-21 20:20:30] [INFO ] Added : 88 causal constraints over 18 iterations in 445 ms. Result :sat
Minimization took 93 ms.
[2024-05-21 20:20:30] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-21 20:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:20:31] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-21 20:20:31] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-21 20:20:31] [INFO ] Added : 91 causal constraints over 19 iterations in 405 ms. Result :sat
Minimization took 86 ms.
[2024-05-21 20:20:31] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-21 20:20:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:20:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-21 20:20:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:20:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:20:32] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:20:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:20:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2024-05-21 20:20:32] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 20:20:32] [INFO ] Added : 167 causal constraints over 34 iterations in 557 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-21 20:20:34] [INFO ] Invariant cache hit.
[2024-05-21 20:20:34] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 20:20:34] [INFO ] Invariant cache hit.
[2024-05-21 20:20:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:20:34] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-21 20:20:34] [INFO ] Redundant transitions in 10 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 20:20:34] [INFO ] Invariant cache hit.
[2024-05-21 20:20:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/270 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 213/483 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:20:38] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:20:40] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:20:40] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:20:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 1/484 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 340 constraints, problems are : Problem set: 0 solved, 210 unsolved in 17325 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/483 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 210/549 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:21:05] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:21:05] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:21:05] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/484 variables, and 552 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 10/10 constraints]
After SMT, in 47540ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 47551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48148 ms. Remains : 271/271 places, 213/213 transitions.
RANDOM walk for 40000 steps (559 resets) in 1049 ms. (38 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (92 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (95 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (88 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (99 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (94 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (89 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (91 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (88 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 706394 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 10
Probabilistic random walk after 706394 steps, saw 101480 distinct states, run finished after 3005 ms. (steps per millisecond=235 ) properties seen :0
[2024-05-21 20:21:25] [INFO ] Invariant cache hit.
[2024-05-21 20:21:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/191 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/216 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/223 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 176/399 variables, 223/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 53/452 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/453 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 31/484 variables, 31/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 333 constraints, problems are : Problem set: 0 solved, 10 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/191 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/216 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/223 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 176/399 variables, 223/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 53/452 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 20:21:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-21 20:21:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/452 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1/453 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 20:21:28] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/453 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 31/484 variables, 31/346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 20:21:28] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:21:28] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:21:28] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/484 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 349 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 3021ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7838 ms.
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 271/271 places, 213/213 transitions.
RANDOM walk for 40000 steps (541 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (91 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (86 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (84 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (86 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (90 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (91 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (89 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (97 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 790991 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 10
Probabilistic random walk after 790991 steps, saw 113229 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-05-21 20:21:40] [INFO ] Invariant cache hit.
[2024-05-21 20:21:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/191 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/216 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/223 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 176/399 variables, 223/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 53/452 variables, 16/296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/453 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 31/484 variables, 31/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 333 constraints, problems are : Problem set: 0 solved, 10 unsolved in 979 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/191 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/216 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/223 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 176/399 variables, 223/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 53/452 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 6/310 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 20:21:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:21:41] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/452 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1/453 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 20:21:42] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/453 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 31/484 variables, 31/346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 20:21:42] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:21:42] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:21:42] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/484 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 349 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 2967ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8321 ms.
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-21 20:21:51] [INFO ] Invariant cache hit.
[2024-05-21 20:21:51] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 20:21:51] [INFO ] Invariant cache hit.
[2024-05-21 20:21:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:21:52] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-21 20:21:52] [INFO ] Redundant transitions in 9 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-21 20:21:52] [INFO ] Invariant cache hit.
[2024-05-21 20:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/270 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 213/483 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:21:56] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:21:57] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:21:57] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:21:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 1/484 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:22:03] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:22:03] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:22:03] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 340 constraints, problems are : Problem set: 0 solved, 210 unsolved in 17692 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/483 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 210/549 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-21 20:22:23] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:22:23] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:22:24] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/484 variables, and 552 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 10/10 constraints]
After SMT, in 47846ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 47850ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48452 ms. Remains : 271/271 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:22:40] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 20:22:40] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:22:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 20:22:40] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-21 20:22:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 20:22:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 20:22:40] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-21 20:22:40] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 1
[2024-05-21 20:22:40] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-21 20:22:41] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 1065 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-40a-UpperBounds-00
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:22:41] [INFO ] Computed 60 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (131 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (24 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:22:41] [INFO ] Invariant cache hit.
[2024-05-21 20:22:41] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:22:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:22:41] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-21 20:22:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:22:41] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:22:41] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-21 20:22:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:22:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:22:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:22:41] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 20:22:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:22:41] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:22:41] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:22:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-05-21 20:22:41] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 20:22:41] [INFO ] Added : 85 causal constraints over 17 iterations in 295 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 271 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p68) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 212/212 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 269 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 268 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 267 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 266 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 265 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 264 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 263 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 262 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 261 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 260 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 259 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 258 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 257 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 256 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 255 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 254 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 253 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 252 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 251 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 250 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 249 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 248 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 247 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 246 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 245 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 244 transition count 185
Applied a total of 27 rules in 57 ms. Remains 244 /271 variables (removed 27) and now considering 185/212 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 244/271 places, 185/212 transitions.
// Phase 1: matrix 185 rows 244 cols
[2024-05-21 20:22:42] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13573 resets) in 1872 ms. (533 steps per ms)
BEST_FIRST walk for 1000000 steps (2299 resets) in 934 ms. (1069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:22:45] [INFO ] Invariant cache hit.
[2024-05-21 20:22:45] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 20:22:45] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 20:22:45] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-21 20:22:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:22:45] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:22:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:22:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 20:22:45] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:22:45] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-21 20:22:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:22:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 3 ms to minimize.
[2024-05-21 20:22:45] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:22:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2024-05-21 20:22:45] [INFO ] Computed and/alt/rep : 176/322/176 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 20:22:45] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 20:22:46] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:22:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-21 20:22:46] [INFO ] Added : 119 causal constraints over 24 iterations in 497 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 185/185 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 244/244 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 185/185 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-21 20:22:46] [INFO ] Invariant cache hit.
[2024-05-21 20:22:46] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 20:22:46] [INFO ] Invariant cache hit.
[2024-05-21 20:22:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:22:46] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-21 20:22:46] [INFO ] Redundant transitions in 6 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 20:22:46] [INFO ] Invariant cache hit.
[2024-05-21 20:22:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 2/242 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/243 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD181 is UNSAT
At refinement iteration 8 (OVERLAPS) 185/428 variables, 243/304 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 2/306 constraints. Problems are: Problem set: 52 solved, 130 unsolved
[2024-05-21 20:22:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-21 20:22:52] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:22:52] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 3/309 constraints. Problems are: Problem set: 52 solved, 130 unsolved
[2024-05-21 20:22:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:22:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:22:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 3/312 constraints. Problems are: Problem set: 52 solved, 130 unsolved
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 9/321 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/321 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 14 (OVERLAPS) 1/429 variables, 1/322 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/429 variables, 0/322 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 16 (OVERLAPS) 0/429 variables, 0/322 constraints. Problems are: Problem set: 52 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 322 constraints, problems are : Problem set: 52 solved, 130 unsolved in 13129 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 244/244 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 52 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 35/35 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 17/52 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 12/64 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/64 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 2/190 variables, 1/65 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 3/68 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/68 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 53/243 variables, 8/76 constraints. Problems are: Problem set: 52 solved, 130 unsolved
[2024-05-21 20:23:01] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 20:23:01] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/78 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/78 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 185/428 variables, 243/321 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 2/323 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 130/453 constraints. Problems are: Problem set: 52 solved, 130 unsolved
[2024-05-21 20:23:04] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:23:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 20:23:06] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:23:08] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 4/457 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/457 constraints. Problems are: Problem set: 52 solved, 130 unsolved
At refinement iteration 15 (OVERLAPS) 1/429 variables, 1/458 constraints. Problems are: Problem set: 52 solved, 130 unsolved
[2024-05-21 20:23:27] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:23:27] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/429 variables, and 460 constraints, problems are : Problem set: 52 solved, 130 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 244/244 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 130/182 constraints, Known Traps: 23/23 constraints]
After SMT, in 43229ms problems are : Problem set: 52 solved, 130 unsolved
Search for dead transitions found 52 dead transitions in 43232ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 244/244 places, 133/185 transitions.
Graph (complete) has 622 edges and 244 vertex of which 192 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.1 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 192 /244 variables (removed 52) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 192 cols
[2024-05-21 20:23:30] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 20:23:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 20:23:30] [INFO ] Invariant cache hit.
[2024-05-21 20:23:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:23:30] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 192/244 places, 133/185 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43982 ms. Remains : 192/244 places, 133/185 transitions.
[2024-05-21 20:23:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13655 resets) in 1784 ms. (560 steps per ms)
BEST_FIRST walk for 1000001 steps (2292 resets) in 903 ms. (1106 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:23:33] [INFO ] Invariant cache hit.
[2024-05-21 20:23:33] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-21 20:23:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-21 20:23:33] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 20:23:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:23:33] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:23:33] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:23:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:23:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 20:23:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 20:23:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 20:23:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:23:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:23:33] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:23:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-21 20:23:33] [INFO ] Computed and/alt/rep : 124/208/124 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-21 20:23:33] [INFO ] Added : 91 causal constraints over 19 iterations in 202 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 192/192 places, 133/133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-21 20:23:33] [INFO ] Invariant cache hit.
[2024-05-21 20:23:33] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 20:23:33] [INFO ] Invariant cache hit.
[2024-05-21 20:23:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:23:34] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-21 20:23:34] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 20:23:34] [INFO ] Invariant cache hit.
[2024-05-21 20:23:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/190 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/191 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 133/324 variables, 191/252 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:23:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 20:23:36] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:23:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-21 20:23:37] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-21 20:23:37] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:23:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:23:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:23:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:23:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:23:39] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 15 (OVERLAPS) 1/325 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 17 (OVERLAPS) 0/325 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 265 constraints, problems are : Problem set: 0 solved, 130 unsolved in 8785 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 2/190 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:23:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:23:44] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:23:44] [INFO ] Deduced a trap composed of 40 places in 25 ms of which 1 ms to minimize.
[2024-05-21 20:23:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-21 20:23:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 20:23:44] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 20:23:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 1/191 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 13 (OVERLAPS) 133/324 variables, 191/269 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 130/401 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 17 (OVERLAPS) 1/325 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 20:24:01] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-21 20:24:01] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-21 20:24:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:24:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/325 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/325 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 406 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 21/21 constraints]
After SMT, in 38843ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 38845ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39167 ms. Remains : 192/192 places, 133/133 transitions.
RANDOM walk for 40000 steps (548 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1217897 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :0 out of 2
Probabilistic random walk after 1217897 steps, saw 170591 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
[2024-05-21 20:24:16] [INFO ] Invariant cache hit.
[2024-05-21 20:24:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 61/74 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/109 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/134 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 90/231 variables, 141/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/243 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/244 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/286 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/286 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/286 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 39/325 variables, 39/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/325 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/325 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/74 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/109 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/134 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/141 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 90/231 variables, 141/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/243 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:24:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:24:16] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/244 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/244 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:24:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/244 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/244 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 42/286 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/286 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/286 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 39/325 variables, 39/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/325 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/325 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 260 constraints, problems are : Problem set: 0 solved, 2 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 13690 steps, including 44 resets, run visited all 2 properties in 67 ms. (steps per millisecond=204 )
Parikh walk visited 2 properties in 71 ms.
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-40a-UpperBounds-00 in 95649 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-04
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:24:16] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (138 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:24:16] [INFO ] Invariant cache hit.
[2024-05-21 20:24:16] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:24:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:24:16] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-21 20:24:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:24:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:24:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:24:17] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-21 20:24:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:24:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:24:17] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-21 20:24:17] [INFO ] Added : 75 causal constraints over 15 iterations in 263 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 271 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p103) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 212/212 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 269 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 268 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 267 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 266 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 265 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 264 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 263 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 262 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 261 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 260 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 259 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 258 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 257 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 256 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 255 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 254 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 253 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 252 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 251 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 250 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 249 transition count 190
Applied a total of 22 rules in 34 ms. Remains 249 /271 variables (removed 22) and now considering 190/212 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 249/271 places, 190/212 transitions.
// Phase 1: matrix 190 rows 249 cols
[2024-05-21 20:24:17] [INFO ] Computed 61 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13667 resets) in 1812 ms. (551 steps per ms)
BEST_FIRST walk for 1000001 steps (2286 resets) in 883 ms. (1131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:24:20] [INFO ] Invariant cache hit.
[2024-05-21 20:24:20] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 20:24:20] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:24:20] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-21 20:24:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:24:20] [INFO ] [Real]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:24:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:24:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:24:20] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-21 20:24:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-21 20:24:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 20:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-21 20:24:20] [INFO ] Computed and/alt/rep : 181/325/181 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-21 20:24:21] [INFO ] Added : 72 causal constraints over 15 iterations in 271 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 249/249 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 249 /249 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 20:24:21] [INFO ] Invariant cache hit.
[2024-05-21 20:24:21] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 20:24:21] [INFO ] Invariant cache hit.
[2024-05-21 20:24:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:24:21] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-21 20:24:21] [INFO ] Redundant transitions in 2 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-21 20:24:21] [INFO ] Invariant cache hit.
[2024-05-21 20:24:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/247 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 2/249 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 190/439 variables, 249/310 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:24:28] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:24:28] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:24:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:24:30] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:24:31] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:24:32] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:24:34] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-21 20:24:35] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 0/439 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 320 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18604 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/247 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:24:42] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-21 20:24:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 20:24:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 190/439 variables, 249/321 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 187/510 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:24:58] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 511 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 48709ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49159 ms. Remains : 249/249 places, 190/190 transitions.
RANDOM walk for 40000 steps (558 resets) in 340 ms. (117 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (86 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1266142 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :0 out of 2
Probabilistic random walk after 1266142 steps, saw 176815 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
[2024-05-21 20:25:13] [INFO ] Invariant cache hit.
[2024-05-21 20:25:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/35 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/43 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/56 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/58 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/58 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/62 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 137/199 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/199 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/233 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/233 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/265 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:25:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/265 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/265 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/274 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/274 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 165/439 variables, 220/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/439 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/439 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/439 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/439 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/35 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/43 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/44 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/56 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/58 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/62 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 137/199 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/199 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/233 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/265 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/265 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/265 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/274 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/274 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 165/439 variables, 220/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/439 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/439 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/439 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/439 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 604ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 381 ms.
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 249/249 places, 190/190 transitions.
RANDOM walk for 40000 steps (548 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1242152 steps, run timeout after 3007 ms. (steps per millisecond=413 ) properties seen :0 out of 2
Probabilistic random walk after 1242152 steps, saw 173700 distinct states, run finished after 3007 ms. (steps per millisecond=413 ) properties seen :0
[2024-05-21 20:25:17] [INFO ] Invariant cache hit.
[2024-05-21 20:25:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/35 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/43 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/56 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/58 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/58 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/62 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/62 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 137/199 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/199 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/233 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/233 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/265 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:25:18] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/265 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/265 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/274 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/274 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 165/439 variables, 220/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/439 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/439 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/439 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/439 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/35 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/43 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/44 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/56 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/58 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/62 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 137/199 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/199 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/233 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/233 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/265 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/265 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/265 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/274 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/274 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 165/439 variables, 220/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/439 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/439 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/439 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/439 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 616ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 249/249 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 249 /249 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-21 20:25:18] [INFO ] Invariant cache hit.
[2024-05-21 20:25:19] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 20:25:19] [INFO ] Invariant cache hit.
[2024-05-21 20:25:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:25:19] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-21 20:25:19] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-21 20:25:19] [INFO ] Invariant cache hit.
[2024-05-21 20:25:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/247 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 2/249 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 190/439 variables, 249/310 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:25:25] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:25:26] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-21 20:25:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:25:28] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:25:29] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:25:30] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:25:32] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-21 20:25:32] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 0/439 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 320 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18897 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 2/247 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 190/439 variables, 249/321 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 187/510 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 20:25:55] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 511 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 249/249 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 12/12 constraints]
After SMT, in 48988ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49388 ms. Remains : 249/249 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:26:08] [INFO ] Invariant cache hit.
[2024-05-21 20:26:08] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:26:08] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-21 20:26:08] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:26:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 20:26:08] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 20:26:08] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 20:26:08] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:26:08] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 300 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-40a-UpperBounds-04 in 111883 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-09
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:26:08] [INFO ] Computed 60 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (133 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:26:08] [INFO ] Invariant cache hit.
[2024-05-21 20:26:08] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:26:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:26:08] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 20:26:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:26:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:26:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:26:08] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-21 20:26:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:26:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:26:08] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 20:26:09] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:26:09] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-21 20:26:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-21 20:26:09] [INFO ] Added : 88 causal constraints over 18 iterations in 439 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 271 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p89) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 212/212 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 269 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 268 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 267 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 266 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 265 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 264 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 263 transition count 204
Applied a total of 8 rules in 17 ms. Remains 263 /271 variables (removed 8) and now considering 204/212 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 263/271 places, 204/212 transitions.
// Phase 1: matrix 204 rows 263 cols
[2024-05-21 20:26:09] [INFO ] Computed 61 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13609 resets) in 1837 ms. (544 steps per ms)
BEST_FIRST walk for 1000001 steps (2292 resets) in 934 ms. (1069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:26:12] [INFO ] Invariant cache hit.
[2024-05-21 20:26:12] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 20:26:12] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:26:12] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-21 20:26:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:26:12] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:26:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-21 20:26:12] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:26:12] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 20:26:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 20:26:12] [INFO ] Computed and/alt/rep : 195/339/195 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 20:26:13] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-21 20:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-21 20:26:13] [INFO ] Added : 86 causal constraints over 18 iterations in 379 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 263/263 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 5 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 20:26:13] [INFO ] Invariant cache hit.
[2024-05-21 20:26:13] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 20:26:13] [INFO ] Invariant cache hit.
[2024-05-21 20:26:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:26:14] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-21 20:26:14] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 20:26:14] [INFO ] Invariant cache hit.
[2024-05-21 20:26:14] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 2/263 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 204/467 variables, 263/324 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:26:21] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:26:22] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:26:22] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:26:22] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 20:26:23] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:26:25] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 20:26:25] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:26:28] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:26:28] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 14 (OVERLAPS) 0/467 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 335 constraints, problems are : Problem set: 0 solved, 201 unsolved in 19845 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 2/263 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 204/467 variables, 263/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 201/536 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:26:44] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 20:26:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:26:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 539 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 12/12 constraints]
After SMT, in 49950ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 49953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50470 ms. Remains : 263/263 places, 204/204 transitions.
RANDOM walk for 40000 steps (546 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (86 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1237138 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 2
Probabilistic random walk after 1237138 steps, saw 173076 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
[2024-05-21 20:27:07] [INFO ] Invariant cache hit.
[2024-05-21 20:27:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/63 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/71 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/72 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/84 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/86 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/90 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 137/227 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/261 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/293 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:27:07] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/293 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/293 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/302 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/302 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 165/467 variables, 220/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/467 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/467 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 327 constraints, problems are : Problem set: 0 solved, 2 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/63 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/71 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/72 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/84 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/86 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/90 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/90 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 137/227 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/261 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/261 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/293 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/293 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/293 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/302 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/302 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 165/467 variables, 220/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/467 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/467 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:27:07] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:27:07] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/467 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/467 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/467 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 686 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 263/263 places, 204/204 transitions.
RANDOM walk for 40000 steps (523 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1320850 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 2
Probabilistic random walk after 1320850 steps, saw 184355 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
[2024-05-21 20:27:11] [INFO ] Invariant cache hit.
[2024-05-21 20:27:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/63 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/71 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/72 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/84 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/86 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/90 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 137/227 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/261 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/293 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:27:12] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/293 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/293 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/302 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/302 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 165/467 variables, 220/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/467 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/467 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/467 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 327 constraints, problems are : Problem set: 0 solved, 2 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/63 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/71 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/72 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/84 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/86 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/90 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/90 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 137/227 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/261 variables, 19/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/261 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/293 variables, 22/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/293 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/293 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/302 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/302 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 165/467 variables, 220/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/467 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/467 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:27:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:27:12] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/467 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/467 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/467 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 331 constraints, problems are : Problem set: 0 solved, 2 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 863ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 619 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 263/263 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 20:27:13] [INFO ] Invariant cache hit.
[2024-05-21 20:27:13] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 20:27:13] [INFO ] Invariant cache hit.
[2024-05-21 20:27:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:27:13] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-05-21 20:27:13] [INFO ] Redundant transitions in 0 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-21 20:27:13] [INFO ] Invariant cache hit.
[2024-05-21 20:27:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 2/263 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 204/467 variables, 263/324 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:27:21] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:27:21] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:27:22] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:27:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:27:23] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:27:25] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:27:25] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:27:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:27:28] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 14 (OVERLAPS) 0/467 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 335 constraints, problems are : Problem set: 0 solved, 201 unsolved in 20291 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 2/263 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 204/467 variables, 263/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 201/536 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:27:45] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-21 20:27:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:27:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 539 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 12/12 constraints]
After SMT, in 50409ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 50413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50950 ms. Remains : 263/263 places, 204/204 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:28:04] [INFO ] Invariant cache hit.
[2024-05-21 20:28:04] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:04] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 20:28:04] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:28:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:04] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-21 20:28:04] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 20:28:04] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:28:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-21 20:28:04] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:28:04] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 513 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-40a-UpperBounds-09 in 116174 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-11
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:28:04] [INFO ] Computed 60 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (24 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:28:04] [INFO ] Invariant cache hit.
[2024-05-21 20:28:04] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:28:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 20:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:28:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 20:28:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:28:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-21 20:28:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:28:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-21 20:28:05] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 20:28:05] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-21 20:28:05] [INFO ] Added : 91 causal constraints over 19 iterations in 416 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 271 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p82) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 212/212 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 211
Applied a total of 1 rules in 5 ms. Remains 270 /271 variables (removed 1) and now considering 211/212 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 270/271 places, 211/212 transitions.
// Phase 1: matrix 211 rows 270 cols
[2024-05-21 20:28:05] [INFO ] Computed 61 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13736 resets) in 1848 ms. (540 steps per ms)
BEST_FIRST walk for 1000001 steps (2311 resets) in 912 ms. (1095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:28:08] [INFO ] Invariant cache hit.
[2024-05-21 20:28:08] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 20:28:08] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:28:08] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-21 20:28:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:28:08] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 20:28:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:28:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 20:28:08] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 20:28:09] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 20:28:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-05-21 20:28:09] [INFO ] Computed and/alt/rep : 202/346/202 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-21 20:28:09] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 20:28:09] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-21 20:28:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-05-21 20:28:09] [INFO ] Added : 91 causal constraints over 19 iterations in 478 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 270/270 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-21 20:28:09] [INFO ] Invariant cache hit.
[2024-05-21 20:28:10] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 20:28:10] [INFO ] Invariant cache hit.
[2024-05-21 20:28:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:28:10] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-21 20:28:10] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-21 20:28:10] [INFO ] Invariant cache hit.
[2024-05-21 20:28:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 2/268 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 2/270 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 211/481 variables, 270/331 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:28:17] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:28:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:28:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:28:21] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:28:21] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:28:21] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 13 (OVERLAPS) 0/481 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 339 constraints, problems are : Problem set: 0 solved, 208 unsolved in 18491 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 2/268 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 2/270 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 211/481 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 208/547 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:28:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-21 20:28:40] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:28:40] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:28:43] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:28:57] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:28:58] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 553 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 12/12 constraints]
After SMT, in 48609ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49096 ms. Remains : 270/270 places, 211/211 transitions.
RANDOM walk for 40000 steps (538 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1279889 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :0 out of 2
Probabilistic random walk after 1279889 steps, saw 178400 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
[2024-05-21 20:29:02] [INFO ] Invariant cache hit.
[2024-05-21 20:29:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/85 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/86 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/98 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/100 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/104 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/104 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 137/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/275 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/275 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/307 variables, 22/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/307 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/307 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/316 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/316 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 165/481 variables, 220/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/481 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/481 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/481 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/481 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/85 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/86 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/98 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/100 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/104 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/104 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 137/241 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/275 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/275 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/307 variables, 22/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/307 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/307 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/316 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/316 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 165/481 variables, 220/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/481 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/481 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/481 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/481 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 977 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 211/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 270 /270 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 270/270 places, 211/211 transitions.
RANDOM walk for 40000 steps (553 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (87 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1294958 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :0 out of 2
Probabilistic random walk after 1294958 steps, saw 180147 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
[2024-05-21 20:29:06] [INFO ] Invariant cache hit.
[2024-05-21 20:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/85 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/86 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/98 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/100 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/104 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/104 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 137/241 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/275 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/275 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/307 variables, 22/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/307 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/307 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/316 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/316 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 165/481 variables, 220/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/481 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/481 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/481 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/481 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/77 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/85 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/86 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/98 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/100 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/104 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/104 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 137/241 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/275 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/275 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/307 variables, 22/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/307 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/307 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/316 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/316 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 165/481 variables, 220/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/481 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/481 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/481 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/481 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 809ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 800 ms.
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 270/270 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 270 /270 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-21 20:29:08] [INFO ] Invariant cache hit.
[2024-05-21 20:29:08] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 20:29:08] [INFO ] Invariant cache hit.
[2024-05-21 20:29:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:29:09] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-21 20:29:09] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-21 20:29:09] [INFO ] Invariant cache hit.
[2024-05-21 20:29:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 2/268 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 2/270 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 211/481 variables, 270/331 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:29:16] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 20:29:17] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:29:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 20:29:19] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-21 20:29:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:29:20] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 13 (OVERLAPS) 0/481 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 339 constraints, problems are : Problem set: 0 solved, 208 unsolved in 18141 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 2/268 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 2/270 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 211/481 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 208/547 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:29:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-21 20:29:38] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-21 20:29:38] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-05-21 20:29:41] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 208 unsolved
[2024-05-21 20:29:56] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:29:56] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 553 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 12/12 constraints]
After SMT, in 48244ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 48246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48726 ms. Remains : 270/270 places, 211/211 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 270 /270 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 20:29:57] [INFO ] Invariant cache hit.
[2024-05-21 20:29:57] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 20:29:57] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-21 20:29:57] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:29:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:29:57] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-21 20:29:57] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 20:29:57] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:29:57] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 349 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-40a-UpperBounds-11 in 112849 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-14
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 213 rows 271 cols
[2024-05-21 20:29:57] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:29:57] [INFO ] Invariant cache hit.
[2024-05-21 20:29:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:29:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:29:57] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-21 20:29:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:29:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 20:29:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 20:29:57] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-21 20:29:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:29:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-21 20:29:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:29:58] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-21 20:29:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:29:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2024-05-21 20:29:58] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-21 20:29:58] [INFO ] Added : 167 causal constraints over 34 iterations in 577 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 271 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p52) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 212/212 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 269 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 268 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 267 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 266 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 265 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 264 transition count 205
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 263 transition count 204
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 262 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 261 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 260 transition count 201
Applied a total of 11 rules in 32 ms. Remains 260 /271 variables (removed 11) and now considering 201/212 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 260/271 places, 201/212 transitions.
// Phase 1: matrix 201 rows 260 cols
[2024-05-21 20:29:59] [INFO ] Computed 61 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13684 resets) in 1828 ms. (546 steps per ms)
BEST_FIRST walk for 1000001 steps (2294 resets) in 874 ms. (1142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:30:01] [INFO ] Invariant cache hit.
[2024-05-21 20:30:01] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-21 20:30:01] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 20:30:02] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-21 20:30:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:30:02] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-21 20:30:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 20:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:30:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 20:30:02] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 20:30:02] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 20:30:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 20:30:02] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 20:30:02] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:30:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-21 20:30:02] [INFO ] Computed and/alt/rep : 192/338/192 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 20:30:02] [INFO ] Added : 147 causal constraints over 30 iterations in 472 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 260 /260 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 260/260 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 201/201 transitions.
Applied a total of 0 rules in 12 ms. Remains 260 /260 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-21 20:30:03] [INFO ] Invariant cache hit.
[2024-05-21 20:30:03] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 20:30:03] [INFO ] Invariant cache hit.
[2024-05-21 20:30:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:30:03] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-05-21 20:30:03] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 20:30:03] [INFO ] Invariant cache hit.
[2024-05-21 20:30:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 2/258 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:30:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 9 (OVERLAPS) 201/460 variables, 259/321 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 2/323 constraints. Problems are: Problem set: 20 solved, 178 unsolved
[2024-05-21 20:30:11] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:30:11] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:30:12] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 3/326 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/326 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 1/461 variables, 1/327 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 0/327 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 15 (OVERLAPS) 0/461 variables, 0/327 constraints. Problems are: Problem set: 20 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 327 constraints, problems are : Problem set: 20 solved, 178 unsolved in 17325 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 260/260 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 35/35 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 17/52 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 4/56 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/56 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 2/238 variables, 1/57 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/57 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 21/259 variables, 8/65 constraints. Problems are: Problem set: 20 solved, 178 unsolved
[2024-05-21 20:30:23] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 20:30:23] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/67 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/67 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 201/460 variables, 259/326 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 2/328 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 178/506 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/506 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 1/461 variables, 1/507 constraints. Problems are: Problem set: 20 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 507 constraints, problems are : Problem set: 20 solved, 178 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 260/260 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 178/198 constraints, Known Traps: 6/6 constraints]
After SMT, in 47437ms problems are : Problem set: 20 solved, 178 unsolved
Search for dead transitions found 20 dead transitions in 47440ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 260/260 places, 181/201 transitions.
Graph (complete) has 814 edges and 260 vertex of which 240 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 240 /260 variables (removed 20) and now considering 181/181 (removed 0) transitions.
// Phase 1: matrix 181 rows 240 cols
[2024-05-21 20:30:51] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 20:30:51] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 20:30:51] [INFO ] Invariant cache hit.
[2024-05-21 20:30:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:30:51] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/260 places, 181/201 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48363 ms. Remains : 240/260 places, 181/201 transitions.
[2024-05-21 20:30:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13656 resets) in 1761 ms. (567 steps per ms)
BEST_FIRST walk for 1000001 steps (2250 resets) in 867 ms. (1152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 20:30:54] [INFO ] Invariant cache hit.
[2024-05-21 20:30:54] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 20:30:54] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 20:30:54] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-21 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:30:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-21 20:30:54] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-21 20:30:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-21 20:30:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:30:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-21 20:30:54] [INFO ] Computed and/alt/rep : 172/288/172 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-21 20:30:54] [INFO ] Added : 154 causal constraints over 31 iterations in 421 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 181/181 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 240/240 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 181/181 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2024-05-21 20:30:55] [INFO ] Invariant cache hit.
[2024-05-21 20:30:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 20:30:55] [INFO ] Invariant cache hit.
[2024-05-21 20:30:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:30:55] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-21 20:30:55] [INFO ] Redundant transitions in 0 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 20:30:55] [INFO ] Invariant cache hit.
[2024-05-21 20:30:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 2/238 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/239 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 181/420 variables, 239/300 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:00] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:01] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:31:01] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:31:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:31:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:31:01] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 20:31:02] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 20:31:02] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 7/310 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:04] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:31:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (OVERLAPS) 1/421 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (OVERLAPS) 0/421 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 314 constraints, problems are : Problem set: 0 solved, 178 unsolved in 14946 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 240/240 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 2/238 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:12] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 20:31:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:12] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 20:31:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 20:31:13] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:14] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:14] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:15] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 20:31:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 20:31:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 1/239 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (OVERLAPS) 181/420 variables, 239/321 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 178/501 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-21 20:31:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-21 20:31:27] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:31:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-21 20:31:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/421 variables, and 505 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 239/240 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 25/25 constraints]
After SMT, in 45039ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 45041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45443 ms. Remains : 240/240 places, 181/181 transitions.
RANDOM walk for 40000 steps (548 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (96 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (93 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1226202 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :0 out of 2
Probabilistic random walk after 1226202 steps, saw 171619 distinct states, run finished after 3001 ms. (steps per millisecond=408 ) properties seen :0
[2024-05-21 20:31:43] [INFO ] Invariant cache hit.
[2024-05-21 20:31:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 93/122 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/157 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/182 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/189 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 138/327 variables, 189/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/339 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/340 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/340 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 42/382 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/382 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/382 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 39/421 variables, 39/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/421 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/421 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 240/240 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 93/122 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/157 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/182 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/189 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 138/327 variables, 189/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/339 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/340 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/340 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 42/382 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/382 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/382 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 39/421 variables, 39/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/421 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/421 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 305 constraints, problems are : Problem set: 0 solved, 2 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 240/240 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1413 steps, including 1 resets, run visited all 2 properties in 20 ms. (steps per millisecond=70 )
Parikh walk visited 2 properties in 20 ms.
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-40a-UpperBounds-14 in 106831 ms.
[2024-05-21 20:31:44] [INFO ] Flatten gal took : 58 ms
[2024-05-21 20:31:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 20:31:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 213 transitions and 1029 arcs took 5 ms.
Total runtime 694264 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-40a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 271
TRANSITIONS: 213
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.002s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1765
MODEL NAME: /home/mcc/execution/415/model
271 places, 213 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-40a-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716323556464

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DES-PT-40a, 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 r091-tall-171624188300717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;