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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.1K 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 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 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 110K 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-60a-UpperBounds-00
FORMULA_NAME DES-PT-60a-UpperBounds-01
FORMULA_NAME DES-PT-60a-UpperBounds-02
FORMULA_NAME DES-PT-60a-UpperBounds-03
FORMULA_NAME DES-PT-60a-UpperBounds-04
FORMULA_NAME DES-PT-60a-UpperBounds-05
FORMULA_NAME DES-PT-60a-UpperBounds-06
FORMULA_NAME DES-PT-60a-UpperBounds-07
FORMULA_NAME DES-PT-60a-UpperBounds-08
FORMULA_NAME DES-PT-60a-UpperBounds-09
FORMULA_NAME DES-PT-60a-UpperBounds-10
FORMULA_NAME DES-PT-60a-UpperBounds-11
FORMULA_NAME DES-PT-60a-UpperBounds-12
FORMULA_NAME DES-PT-60a-UpperBounds-13
FORMULA_NAME DES-PT-60a-UpperBounds-14
FORMULA_NAME DES-PT-60a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717199035811

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:43:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:43:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:43:57] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-31 23:43:57] [INFO ] Transformed 354 places.
[2024-05-31 23:43:57] [INFO ] Transformed 311 transitions.
[2024-05-31 23:43:57] [INFO ] Found NUPN structural information;
[2024-05-31 23:43:57] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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, 1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 297 rows 354 cols
[2024-05-31 23:43:57] [INFO ] Computed 59 invariants in 29 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (226 resets) in 81 ms. (121 steps per ms)
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (366 resets) in 189 ms. (421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:43:57] [INFO ] Invariant cache hit.
[2024-05-31 23:43:58] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-31 23:43:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:43:58] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 23:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:43:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-31 23:43:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 23:43:58] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2024-05-31 23:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 95 ms returned sat
[2024-05-31 23:43:59] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
[2024-05-31 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-31 23:43:59] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 35 ms.
[2024-05-31 23:44:00] [INFO ] Added : 125 causal constraints over 25 iterations in 1047 ms. Result :sat
Minimization took 254 ms.
[2024-05-31 23:44:00] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-31 23:44:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 23:44:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-31 23:44:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2024-05-31 23:44:01] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-31 23:44:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 70 ms returned sat
[2024-05-31 23:44:01] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-05-31 23:44:01] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 26 ms.
[2024-05-31 23:44:02] [INFO ] Added : 142 causal constraints over 29 iterations in 1000 ms. Result :sat
Minimization took 242 ms.
[2024-05-31 23:44:02] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-31 23:44:02] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 23:44:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-31 23:44:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:03] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-31 23:44:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 226 ms returned sat
[2024-05-31 23:44:03] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 3 ms to minimize.
[2024-05-31 23:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-31 23:44:03] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 27 ms.
[2024-05-31 23:44:05] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-31 23:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-31 23:44:05] [INFO ] Added : 202 causal constraints over 41 iterations in 1779 ms. Result :sat
Minimization took 397 ms.
[2024-05-31 23:44:05] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:05] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 23:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-31 23:44:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:44:06] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 23:44:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2024-05-31 23:44:06] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-31 23:44:08] [INFO ] Added : 180 causal constraints over 37 iterations in 1907 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 23:44:08] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:08] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:44:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-31 23:44:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-31 23:44:09] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-31 23:44:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 44 ms returned sat
[2024-05-31 23:44:09] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 24 ms.
[2024-05-31 23:44:09] [INFO ] Added : 98 causal constraints over 20 iterations in 669 ms. Result :sat
Minimization took 252 ms.
[2024-05-31 23:44:10] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:10] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-31 23:44:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-31 23:44:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:10] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 23:44:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2024-05-31 23:44:10] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:44:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-31 23:44:11] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2024-05-31 23:44:12] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 6 ms to minimize.
[2024-05-31 23:44:12] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:44:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2024-05-31 23:44:12] [INFO ] Added : 210 causal constraints over 43 iterations in 1832 ms. Result :sat
Minimization took 332 ms.
[2024-05-31 23:44:13] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:13] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-31 23:44:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:13] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-31 23:44:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2024-05-31 23:44:13] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-31 23:44:14] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-31 23:44:14] [INFO ] Added : 149 causal constraints over 30 iterations in 1092 ms. Result :sat
Minimization took 361 ms.
[2024-05-31 23:44:15] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-31 23:44:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:15] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-31 23:44:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-31 23:44:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:44:15] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-31 23:44:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 40 ms returned sat
[2024-05-31 23:44:15] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-31 23:44:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:44:16] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-31 23:44:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2024-05-31 23:44:16] [INFO ] Added : 94 causal constraints over 19 iterations in 883 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 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 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
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 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 111 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2024-05-31 23:44:21] [INFO ] Computed 60 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13676 resets) in 3165 ms. (315 steps per ms)
BEST_FIRST walk for 8000007 steps (18179 resets) in 8575 ms. (932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:44:33] [INFO ] Invariant cache hit.
[2024-05-31 23:44:33] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2024-05-31 23:44:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 23:44:33] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 23:44:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2024-05-31 23:44:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-31 23:44:33] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-31 23:44:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:44:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:44:33] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
[2024-05-31 23:44:34] [INFO ] Added : 145 causal constraints over 29 iterations in 676 ms. Result :sat
Minimization took 169 ms.
[2024-05-31 23:44:34] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:44:34] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 23:44:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:44:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-31 23:44:35] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-31 23:44:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-31 23:44:35] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 23 ms.
[2024-05-31 23:44:35] [INFO ] Added : 136 causal constraints over 28 iterations in 641 ms. Result :sat
Minimization took 145 ms.
[2024-05-31 23:44:36] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:44:36] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-31 23:44:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:44:36] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-31 23:44:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:44:36] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:44:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:44:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-31 23:44:36] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:44:37] [INFO ] Added : 245 causal constraints over 49 iterations in 1146 ms. Result :sat
Minimization took 231 ms.
[2024-05-31 23:44:38] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:38] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 23:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:38] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-31 23:44:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2024-05-31 23:44:38] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-31 23:44:39] [INFO ] Added : 197 causal constraints over 40 iterations in 882 ms. Result :sat
Minimization took 194 ms.
[2024-05-31 23:44:39] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-31 23:44:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:44:39] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-31 23:44:39] [INFO ] [Real]Added 2 Read/Feed constraints in 9 ms returned sat
[2024-05-31 23:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2024-05-31 23:44:40] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-31 23:44:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 22 ms returned sat
[2024-05-31 23:44:40] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-31 23:44:40] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-31 23:44:40] [INFO ] Added : 97 causal constraints over 20 iterations in 517 ms. Result :sat
Minimization took 142 ms.
[2024-05-31 23:44:40] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:44:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:44:41] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:44:41] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-31 23:44:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 24 ms returned sat
[2024-05-31 23:44:41] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:44:41] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:44:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2024-05-31 23:44:41] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:44:42] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-31 23:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2024-05-31 23:44:42] [INFO ] Added : 261 causal constraints over 53 iterations in 1354 ms. Result :sat
Minimization took 182 ms.
[2024-05-31 23:44:43] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:44:43] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 23:44:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:44:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-31 23:44:43] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 23:44:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-31 23:44:43] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2024-05-31 23:44:44] [INFO ] Added : 170 causal constraints over 34 iterations in 754 ms. Result :sat
Minimization took 151 ms.
[2024-05-31 23:44:44] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:44:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:44:44] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-31 23:44:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:44:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:44:44] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-31 23:44:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-31 23:44:44] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 21 ms.
[2024-05-31 23:44:45] [INFO ] Added : 72 causal constraints over 15 iterations in 342 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-31 23:44:50] [INFO ] Invariant cache hit.
[2024-05-31 23:44:50] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-31 23:44:50] [INFO ] Invariant cache hit.
[2024-05-31 23:44:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:44:50] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-05-31 23:44:50] [INFO ] Redundant transitions in 14 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-31 23:44:50] [INFO ] Invariant cache hit.
[2024-05-31 23:44:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:44:58] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:45:04] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:45:06] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:45:09] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:45:11] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:45:17] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 418 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:45:23] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:45:25] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:45:25] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:45:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/643 variables, 350/420 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 290/712 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 712 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61229 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (550 resets) in 1584 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 629152 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 16
Probabilistic random walk after 629152 steps, saw 90582 distinct states, run finished after 3005 ms. (steps per millisecond=209 ) properties seen :0
[2024-05-31 23:45:55] [INFO ] Invariant cache hit.
[2024-05-31 23:45:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 73/586 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/587 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 57/644 variables, 57/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3191 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 73/586 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-31 23:46:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:46:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:46:00] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:46:00] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/587 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-31 23:46:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 57/644 variables, 57/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 434 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 8213ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (559 resets) in 415 ms. (96 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (13 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 669170 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 16
Probabilistic random walk after 669170 steps, saw 96237 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-31 23:46:06] [INFO ] Invariant cache hit.
[2024-05-31 23:46:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 73/586 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 1/587 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 57/644 variables, 57/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 0/644 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 413 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2950 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 208/216 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/249 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/274 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/281 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 232/513 variables, 281/336 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 73/586 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/586 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-31 23:46:11] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-31 23:46:11] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:46:12] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:46:12] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/587 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-31 23:46:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 57/644 variables, 57/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/644 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 434 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5075 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints]
After SMT, in 8040ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2094 ms.
Support contains 8 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-31 23:46:16] [INFO ] Invariant cache hit.
[2024-05-31 23:46:16] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 23:46:16] [INFO ] Invariant cache hit.
[2024-05-31 23:46:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:46:17] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2024-05-31 23:46:17] [INFO ] Redundant transitions in 6 ms returned []
Running 290 sub problems to find dead transitions.
[2024-05-31 23:46:17] [INFO ] Invariant cache hit.
[2024-05-31 23:46:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:46:24] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:46:30] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:46:32] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:46:35] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:46:37] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:46:44] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 418 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-05-31 23:46:49] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:46:51] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-31 23:46:51] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:46:51] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 293/643 variables, 350/420 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 290/712 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 712 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 10/10 constraints]
After SMT, in 60262ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60968 ms. Remains : 351/351 places, 293/293 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 351 transition count 293
Applied a total of 1 rules in 23 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 293 rows 351 cols
[2024-05-31 23:47:17] [INFO ] Computed 60 invariants in 15 ms
[2024-05-31 23:47:17] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:47:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 23:47:18] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-31 23:47:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:47:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:47:18] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-05-31 23:47:18] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:47:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-31 23:47:19] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-31 23:47:19] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-31 23:47:19] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 1
[2024-05-31 23:47:19] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-05-31 23:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 2
[2024-05-31 23:47:20] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
TRAPS : Iteration 3
[2024-05-31 23:47:21] [INFO ] After 2868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-05-31 23:47:21] [INFO ] After 3462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Over-approximation ignoring read arcs solved 0 properties in 3798 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-60a-UpperBounds-02
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 293 rows 351 cols
[2024-05-31 23:47:21] [INFO ] Computed 60 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (24 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:47:21] [INFO ] Invariant cache hit.
[2024-05-31 23:47:21] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:47:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:47:21] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-31 23:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:47:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:47:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2024-05-31 23:47:22] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-31 23:47:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:47:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-31 23:47:22] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-31 23:47:22] [INFO ] Added : 145 causal constraints over 29 iterations in 647 ms. Result :sat
Minimization took 164 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p94) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 324 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 323 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 322 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 321 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 320 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 319 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 318 transition count 259
Applied a total of 33 rules in 73 ms. Remains 318 /351 variables (removed 33) and now considering 259/292 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 318/351 places, 259/292 transitions.
// Phase 1: matrix 259 rows 318 cols
[2024-05-31 23:47:23] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13644 resets) in 2937 ms. (340 steps per ms)
BEST_FIRST walk for 1000001 steps (2296 resets) in 1025 ms. (974 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:47:27] [INFO ] Invariant cache hit.
[2024-05-31 23:47:27] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:47:27] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:47:27] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-31 23:47:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:47:27] [INFO ] [Real]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-31 23:47:27] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-31 23:47:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:47:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:47:27] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:47:27] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-31 23:47:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:47:27] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:47:27] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:47:28] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 10 ms to minimize.
[2024-05-31 23:47:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:47:28] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:47:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 364 ms
[2024-05-31 23:47:28] [INFO ] Computed and/alt/rep : 250/436/250 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-31 23:47:28] [INFO ] Added : 145 causal constraints over 29 iterations in 572 ms. Result :sat
Minimization took 118 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 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 259/259 transitions.
Applied a total of 0 rules in 7 ms. Remains 318 /318 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 318/318 places, 259/259 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 259/259 transitions.
Applied a total of 0 rules in 6 ms. Remains 318 /318 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2024-05-31 23:47:29] [INFO ] Invariant cache hit.
[2024-05-31 23:47:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-31 23:47:29] [INFO ] Invariant cache hit.
[2024-05-31 23:47:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:47:30] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-31 23:47:30] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-31 23:47:30] [INFO ] Invariant cache hit.
[2024-05-31 23:47:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 2/316 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-31 23:47:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/317 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 256 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 TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 9 (OVERLAPS) 259/576 variables, 317/379 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 2/381 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-31 23:47:43] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-05-31 23:47:43] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:47:44] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:47:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:47:44] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 5/386 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-31 23:47:46] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:47:46] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 2/388 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/388 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 14 (OVERLAPS) 1/577 variables, 1/389 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/577 variables, 0/389 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-31 23:47:57] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-31 23:47:57] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-31 23:47:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-31 23:47:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-31 23:47:57] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/577 variables, 5/394 constraints. Problems are: Problem set: 64 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 394 constraints, problems are : Problem set: 64 solved, 192 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 318/318 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 64 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 35/35 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 17/52 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 13/65 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/65 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 2/252 variables, 1/66 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/66 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 65/317 variables, 8/74 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-31 23:48:03] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/75 constraints. Problems are: Problem set: 64 solved, 192 unsolved
[2024-05-31 23:48:03] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:48:03] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 2/77 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/77 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 259/576 variables, 317/394 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 2/396 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 192/588 constraints. Problems are: Problem set: 64 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/588 constraints. Problems are: Problem set: 64 solved, 192 unsolved
SMT process timed out in 60186ms, After SMT, problems are : Problem set: 64 solved, 192 unsolved
Search for dead transitions found 64 dead transitions in 60189ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 318/318 places, 195/259 transitions.
Graph (complete) has 850 edges and 318 vertex of which 254 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 254 /318 variables (removed 64) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 254 cols
[2024-05-31 23:48:30] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:48:30] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 23:48:30] [INFO ] Invariant cache hit.
[2024-05-31 23:48:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:48:30] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 254/318 places, 195/259 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61369 ms. Remains : 254/318 places, 195/259 transitions.
[2024-05-31 23:48:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13625 resets) in 2891 ms. (345 steps per ms)
BEST_FIRST walk for 1000001 steps (2277 resets) in 1014 ms. (985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:48:34] [INFO ] Invariant cache hit.
[2024-05-31 23:48:34] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-31 23:48:34] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:48:35] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-31 23:48:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:48:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:48:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:48:35] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-31 23:48:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:48:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:48:35] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:48:35] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:48:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2024-05-31 23:48:35] [INFO ] Computed and/alt/rep : 186/298/186 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-31 23:48:35] [INFO ] Added : 144 causal constraints over 30 iterations in 433 ms. Result :sat
Minimization took 98 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 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 195/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 254/254 places, 195/195 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 195/195 transitions.
Applied a total of 0 rules in 11 ms. Remains 254 /254 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2024-05-31 23:48:36] [INFO ] Invariant cache hit.
[2024-05-31 23:48:36] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-31 23:48:36] [INFO ] Invariant cache hit.
[2024-05-31 23:48:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:48:36] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-31 23:48:36] [INFO ] Redundant transitions in 1 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-31 23:48:36] [INFO ] Invariant cache hit.
[2024-05-31 23:48:36] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 2/252 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 1/253 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 195/448 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (OVERLAPS) 1/449 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:48:44] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:48:45] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:48:45] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:48:45] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 10/327 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-31 23:48:48] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:48:48] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/449 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 16 (OVERLAPS) 0/449 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 329 constraints, problems are : Problem set: 0 solved, 192 unsolved in 16577 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 2/252 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 195/448 variables, 253/326 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 192/520 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-31 23:49:02] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/449 variables, and 521 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 253/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 13/13 constraints]
After SMT, in 46688ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 46691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47156 ms. Remains : 254/254 places, 195/195 transitions.
RANDOM walk for 40000 steps (531 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1009881 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 2
Probabilistic random walk after 1009881 steps, saw 142866 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
[2024-05-31 23:49:26] [INFO ] Invariant cache hit.
[2024-05-31 23:49:26] [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) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/176 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/183 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/315 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/327 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/328 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/390 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/449 variables, 59/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 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) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:49:26] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:49:26] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/176 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/183 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 132/315 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/327 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:49:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:49:27] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:49:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 62/390 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/390 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 59/449 variables, 59/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 946 ms.
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 195/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 254/254 places, 195/195 transitions.
RANDOM walk for 40000 steps (535 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (76 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1148160 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 2
Probabilistic random walk after 1148160 steps, saw 160922 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2024-05-31 23:49:31] [INFO ] Invariant cache hit.
[2024-05-31 23:49:31] [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) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/176 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/183 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/315 variables, 183/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/327 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/328 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/328 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/390 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/449 variables, 59/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/449 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 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) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 89/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/151 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:49:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:49:31] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 25/176 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/183 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 132/315 variables, 183/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/327 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:49:32] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:49:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:49:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/328 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 62/390 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/390 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 59/449 variables, 59/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/449 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 254/254 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 835ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 57040 steps, including 365 resets, run visited all 2 properties in 289 ms. (steps per millisecond=197 )
Parikh walk visited 2 properties in 302 ms.
FORMULA DES-PT-60a-UpperBounds-02 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-60a-UpperBounds-02 in 131070 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-31 23:49:32] [INFO ] Computed 60 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:49:32] [INFO ] Invariant cache hit.
[2024-05-31 23:49:32] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:49:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:49:32] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-31 23:49:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:49:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:49:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2024-05-31 23:49:33] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 23:49:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:49:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-31 23:49:33] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:49:33] [INFO ] Added : 136 causal constraints over 28 iterations in 628 ms. Result :sat
Minimization took 154 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p38) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 324 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 323 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 322 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 321 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 320 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 319 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 318 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 317 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 316 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 315 transition count 256
Applied a total of 36 rules in 62 ms. Remains 315 /351 variables (removed 36) and now considering 256/292 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 315/351 places, 256/292 transitions.
// Phase 1: matrix 256 rows 315 cols
[2024-05-31 23:49:34] [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 (13667 resets) in 2881 ms. (346 steps per ms)
BEST_FIRST walk for 1000001 steps (2270 resets) in 1031 ms. (968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:49:38] [INFO ] Invariant cache hit.
[2024-05-31 23:49:38] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:49:38] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:49:38] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:49:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:49:38] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 23:49:38] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-31 23:49:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:49:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-31 23:49:38] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-31 23:49:38] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:49:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:49:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2024-05-31 23:49:38] [INFO ] Computed and/alt/rep : 247/359/247 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-31 23:49:39] [INFO ] Added : 136 causal constraints over 28 iterations in 545 ms. Result :sat
Minimization took 129 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 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 315/315 places, 256/256 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-31 23:49:39] [INFO ] Invariant cache hit.
[2024-05-31 23:49:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-31 23:49:40] [INFO ] Invariant cache hit.
[2024-05-31 23:49:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:49:40] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-31 23:49:40] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-31 23:49:40] [INFO ] Invariant cache hit.
[2024-05-31 23:49:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 2/314 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 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 TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 7 (OVERLAPS) 256/570 variables, 314/375 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 2/377 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:49:50] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:49:51] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-31 23:49:51] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:49:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 4/381 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:49:55] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:49:55] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:49:55] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:49:55] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 4/385 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:49:56] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 1/386 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:49:59] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 1/387 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 0/387 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 14 (OVERLAPS) 1/571 variables, 1/388 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 0/388 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 16 (OVERLAPS) 0/571 variables, 0/388 constraints. Problems are: Problem set: 68 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 388 constraints, problems are : Problem set: 68 solved, 185 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 315/315 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 68 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 35/35 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 17/52 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 7/59 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/59 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 1/60 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:50:11] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/61 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/61 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 70/314 variables, 8/69 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 3/72 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:50:14] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 1/73 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/73 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 256/570 variables, 314/387 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 2/389 constraints. Problems are: Problem set: 68 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/570 variables, 185/574 constraints. Problems are: Problem set: 68 solved, 185 unsolved
[2024-05-31 23:50:26] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/570 variables, 1/575 constraints. Problems are: Problem set: 68 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/571 variables, and 575 constraints, problems are : Problem set: 68 solved, 185 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/315 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/253 constraints, Known Traps: 13/13 constraints]
After SMT, in 60205ms problems are : Problem set: 68 solved, 185 unsolved
Search for dead transitions found 68 dead transitions in 60209ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 315/315 places, 188/256 transitions.
Graph (complete) has 820 edges and 315 vertex of which 247 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.0 ms
Discarding 68 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 247 /315 variables (removed 68) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 247 cols
[2024-05-31 23:50:40] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:50:40] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-31 23:50:40] [INFO ] Invariant cache hit.
[2024-05-31 23:50:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:50:41] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 247/315 places, 188/256 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61292 ms. Remains : 247/315 places, 188/256 transitions.
[2024-05-31 23:50:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13644 resets) in 2951 ms. (338 steps per ms)
BEST_FIRST walk for 1000001 steps (2277 resets) in 1057 ms. (945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:50:45] [INFO ] Invariant cache hit.
[2024-05-31 23:50:45] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:50:45] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:50:45] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-31 23:50:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:50:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-31 23:50:45] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 23:50:45] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 23:50:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:50:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:50:45] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:50:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-31 23:50:45] [INFO ] Computed and/alt/rep : 179/283/179 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-31 23:50:46] [INFO ] Added : 133 causal constraints over 27 iterations in 409 ms. Result :sat
Minimization took 79 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 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 247 /247 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 247/247 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 247 /247 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 23:50:46] [INFO ] Invariant cache hit.
[2024-05-31 23:50:47] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 23:50:47] [INFO ] Invariant cache hit.
[2024-05-31 23:50:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:50:47] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-31 23:50:47] [INFO ] Redundant transitions in 0 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 23:50:47] [INFO ] Invariant cache hit.
[2024-05-31 23:50:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/244 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 2/246 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 188/434 variables, 246/307 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 23:50:52] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:50:52] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:50:52] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:50:52] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:50:53] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:50:53] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
[2024-05-31 23:50:54] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 1/435 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 23:50:57] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:50:57] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-31 23:50:57] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:50:57] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:50:57] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 23:51:01] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:51:03] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:51:03] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/435 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 325 constraints, problems are : Problem set: 0 solved, 185 unsolved in 20420 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/244 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 2/246 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 23:51:10] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 188/434 variables, 246/322 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 185/509 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 23:51:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-31 23:51:32] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 511 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 246/247 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 17/18 constraints]
After SMT, in 50525ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 50527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50974 ms. Remains : 247/247 places, 188/188 transitions.
RANDOM walk for 40000 steps (544 resets) in 391 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1234133 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 2
Probabilistic random walk after 1234133 steps, saw 172679 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
[2024-05-31 23:51:40] [INFO ] Invariant cache hit.
[2024-05-31 23:51:41] [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) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 86/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/169 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/176 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 125/301 variables, 176/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/313 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/314 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/314 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/376 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/435 variables, 59/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/435 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 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) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 86/109 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/144 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/169 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/176 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 125/301 variables, 176/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/313 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/313 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/314 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/314 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/376 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/435 variables, 59/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/435 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/435 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 312 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1129 steps, including 1 resets, run visited all 2 properties in 11 ms. (steps per millisecond=102 )
Parikh walk visited 2 properties in 10 ms.
FORMULA DES-PT-60a-UpperBounds-03 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-60a-UpperBounds-03 in 128995 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-06
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 293 rows 351 cols
[2024-05-31 23:51:41] [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 (137 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 steps (19 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:51:41] [INFO ] Invariant cache hit.
[2024-05-31 23:51:41] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:51:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:51:41] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-31 23:51:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:51:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2024-05-31 23:51:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:51:42] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 23:51:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:51:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:51:42] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:51:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-31 23:51:42] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:51:43] [INFO ] Added : 245 causal constraints over 49 iterations in 1192 ms. Result :sat
Minimization took 237 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p69) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Applied a total of 8 rules in 25 ms. Remains 343 /351 variables (removed 8) and now considering 284/292 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 343/351 places, 284/292 transitions.
// Phase 1: matrix 284 rows 343 cols
[2024-05-31 23:51:44] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13730 resets) in 2909 ms. (343 steps per ms)
BEST_FIRST walk for 1000001 steps (2244 resets) in 1022 ms. (977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:51:48] [INFO ] Invariant cache hit.
[2024-05-31 23:51:48] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:51:48] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:51:48] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-31 23:51:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:51:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2024-05-31 23:51:48] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:51:48] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-31 23:51:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:51:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 24 ms returned sat
[2024-05-31 23:51:48] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:51:49] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
[2024-05-31 23:51:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2024-05-31 23:51:49] [INFO ] Computed and/alt/rep : 275/461/275 causal constraints (skipped 6 transitions) in 19 ms.
[2024-05-31 23:51:50] [INFO ] Added : 245 causal constraints over 50 iterations in 1073 ms. Result :sat
Minimization took 167 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 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 284/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 343 /343 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 343/343 places, 284/284 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 284/284 transitions.
Applied a total of 0 rules in 6 ms. Remains 343 /343 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-31 23:51:51] [INFO ] Invariant cache hit.
[2024-05-31 23:51:51] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-31 23:51:51] [INFO ] Invariant cache hit.
[2024-05-31 23:51:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:51:51] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-05-31 23:51:51] [INFO ] Redundant transitions in 2 ms returned []
Running 281 sub problems to find dead transitions.
[2024-05-31 23:51:51] [INFO ] Invariant cache hit.
[2024-05-31 23:51:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 2/341 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 281 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/342 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 281 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 TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 8 (OVERLAPS) 284/626 variables, 342/403 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 2/405 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/405 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 11 (OVERLAPS) 1/627 variables, 1/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 13 (OVERLAPS) 0/627 variables, 0/406 constraints. Problems are: Problem set: 14 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 406 constraints, problems are : Problem set: 14 solved, 267 unsolved in 19942 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 343/343 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 35/35 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/52 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-31 23:52:12] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 1/53 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/54 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 15/342 variables, 8/62 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-31 23:52:16] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:52:18] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:52:18] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:52:18] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:52:18] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 5/67 constraints. Problems are: Problem set: 14 solved, 267 unsolved
[2024-05-31 23:52:19] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:52:19] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/69 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/69 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 284/626 variables, 342/411 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 2/413 constraints. Problems are: Problem set: 14 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 267/680 constraints. Problems are: Problem set: 14 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/627 variables, and 680 constraints, problems are : Problem set: 14 solved, 267 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 342/343 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/281 constraints, Known Traps: 8/8 constraints]
After SMT, in 50169ms problems are : Problem set: 14 solved, 267 unsolved
Search for dead transitions found 14 dead transitions in 50172ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 343/343 places, 270/284 transitions.
Graph (complete) has 1150 edges and 343 vertex of which 329 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 329 /343 variables (removed 14) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 329 cols
[2024-05-31 23:52:42] [INFO ] Computed 61 invariants in 6 ms
[2024-05-31 23:52:42] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-31 23:52:42] [INFO ] Invariant cache hit.
[2024-05-31 23:52:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:52:42] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 329/343 places, 270/284 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51610 ms. Remains : 329/343 places, 270/284 transitions.
[2024-05-31 23:52:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13715 resets) in 2926 ms. (341 steps per ms)
BEST_FIRST walk for 1000001 steps (2297 resets) in 1027 ms. (972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:52:46] [INFO ] Invariant cache hit.
[2024-05-31 23:52:46] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2024-05-31 23:52:46] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-31 23:52:46] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-31 23:52:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:52:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-31 23:52:46] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 10 ms returned sat
[2024-05-31 23:52:47] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-31 23:52:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:52:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2024-05-31 23:52:47] [INFO ] Computed and/alt/rep : 261/423/261 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:52:47] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-31 23:52:47] [INFO ] Added : 197 causal constraints over 40 iterations in 837 ms. Result :sat
Minimization took 139 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 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 329 /329 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 329/329 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 329 /329 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-31 23:52:48] [INFO ] Invariant cache hit.
[2024-05-31 23:52:49] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-31 23:52:49] [INFO ] Invariant cache hit.
[2024-05-31 23:52:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:52:49] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2024-05-31 23:52:49] [INFO ] Redundant transitions in 0 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-31 23:52:49] [INFO ] Invariant cache hit.
[2024-05-31 23:52:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 2/327 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:52:54] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-31 23:52:55] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 270/598 variables, 328/391 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:53:03] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-31 23:53:03] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:53:03] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:53:04] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 13 (OVERLAPS) 1/599 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:53:13] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2024-05-31 23:53:13] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:53:13] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-31 23:53:14] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 4/402 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:53:16] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:53:16] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:53:16] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:53:17] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/599 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/599 variables, and 406 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 2/327 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:53:21] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:53:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:53:23] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:53:23] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:53:25] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 12 (OVERLAPS) 270/598 variables, 328/408 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 267/677 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-31 23:53:42] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 678 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 328/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 20/20 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61020 ms. Remains : 329/329 places, 270/270 transitions.
RANDOM walk for 40000 steps (536 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (97 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 950796 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 2
Probabilistic random walk after 950796 steps, saw 135151 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
[2024-05-31 23:53:53] [INFO ] Invariant cache hit.
[2024-05-31 23:53:53] [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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 139/191 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/226 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/251 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/258 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 207/465 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/477 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/478 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/540 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/599 variables, 59/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/599 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/599 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/191 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/226 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/251 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/258 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 207/465 variables, 258/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/477 variables, 8/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/478 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/540 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/540 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/599 variables, 59/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/599 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/599 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 394 constraints, problems are : Problem set: 0 solved, 2 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 329/329 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2590 steps, including 1 resets, run visited all 2 properties in 20 ms. (steps per millisecond=129 )
Parikh walk visited 2 properties in 19 ms.
FORMULA DES-PT-60a-UpperBounds-06 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-60a-UpperBounds-06 in 132400 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 293 rows 351 cols
[2024-05-31 23:53:53] [INFO ] Computed 60 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (22 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:53:54] [INFO ] Invariant cache hit.
[2024-05-31 23:53:54] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:53:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-31 23:53:54] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 23:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:53:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:53:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2024-05-31 23:53:54] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-31 23:53:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:53:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2024-05-31 23:53:54] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-31 23:53:55] [INFO ] Added : 197 causal constraints over 40 iterations in 827 ms. Result :sat
Minimization took 194 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p201) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Applied a total of 20 rules in 26 ms. Remains 331 /351 variables (removed 20) and now considering 272/292 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 331/351 places, 272/292 transitions.
// Phase 1: matrix 272 rows 331 cols
[2024-05-31 23:53:56] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13623 resets) in 2978 ms. (335 steps per ms)
BEST_FIRST walk for 1000000 steps (2289 resets) in 1048 ms. (953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:54:00] [INFO ] Invariant cache hit.
[2024-05-31 23:54:00] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:54:00] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:54:00] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-31 23:54:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:54:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-31 23:54:00] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:54:00] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-31 23:54:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:54:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2024-05-31 23:54:00] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:54:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-31 23:54:00] [INFO ] Computed and/alt/rep : 263/441/263 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:54:01] [INFO ] Added : 209 causal constraints over 42 iterations in 888 ms. Result :sat
Minimization took 136 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 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 331 /331 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 331/331 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 331 /331 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-31 23:54:02] [INFO ] Invariant cache hit.
[2024-05-31 23:54:02] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-31 23:54:02] [INFO ] Invariant cache hit.
[2024-05-31 23:54:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:54:03] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2024-05-31 23:54:03] [INFO ] Redundant transitions in 1 ms returned []
Running 269 sub problems to find dead transitions.
[2024-05-31 23:54:03] [INFO ] Invariant cache hit.
[2024-05-31 23:54:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 2/329 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 1/330 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 269 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 269 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 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
At refinement iteration 7 (OVERLAPS) 272/602 variables, 330/391 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 2/393 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-31 23:54:13] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:54:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:54:14] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-31 23:54:16] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 4/397 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-31 23:54:17] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:54:17] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-31 23:54:17] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:54:19] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 4/401 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/401 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 12 (OVERLAPS) 1/603 variables, 1/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 0/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/603 variables, 0/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 402 constraints, problems are : Problem set: 31 solved, 238 unsolved in 27383 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 331/331 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 31 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 6/58 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/58 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 1/59 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/60 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/60 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 32/330 variables, 8/68 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/69 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-31 23:54:33] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:54:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:54:35] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 3/72 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/72 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 272/602 variables, 330/402 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 2/404 constraints. Problems are: Problem set: 31 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 238/642 constraints. Problems are: Problem set: 31 solved, 238 unsolved
[2024-05-31 23:54:51] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:54:51] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/603 variables, and 644 constraints, problems are : Problem set: 31 solved, 238 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 330/331 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/269 constraints, Known Traps: 13/13 constraints]
After SMT, in 57585ms problems are : Problem set: 31 solved, 238 unsolved
Search for dead transitions found 31 dead transitions in 57589ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 331/331 places, 241/272 transitions.
Graph (complete) has 1041 edges and 331 vertex of which 300 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 300 /331 variables (removed 31) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 300 cols
[2024-05-31 23:55:00] [INFO ] Computed 61 invariants in 9 ms
[2024-05-31 23:55:01] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-31 23:55:01] [INFO ] Invariant cache hit.
[2024-05-31 23:55:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:55:01] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 300/331 places, 241/272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58876 ms. Remains : 300/331 places, 241/272 transitions.
[2024-05-31 23:55:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13648 resets) in 2999 ms. (333 steps per ms)
BEST_FIRST walk for 1000001 steps (2279 resets) in 1036 ms. (964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:55:05] [INFO ] Invariant cache hit.
[2024-05-31 23:55:05] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:55:05] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:55:05] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:55:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:55:05] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:55:05] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-31 23:55:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:55:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:55:05] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-31 23:55:05] [INFO ] Computed and/alt/rep : 232/378/232 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-31 23:55:06] [INFO ] Added : 167 causal constraints over 34 iterations in 634 ms. Result :sat
Minimization took 138 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 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 300/300 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-31 23:55:07] [INFO ] Invariant cache hit.
[2024-05-31 23:55:07] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-31 23:55:07] [INFO ] Invariant cache hit.
[2024-05-31 23:55:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:55:07] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-05-31 23:55:07] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-31 23:55:07] [INFO ] Invariant cache hit.
[2024-05-31 23:55:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:55:12] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/540 variables, 299/361 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:55:20] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:55:21] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-31 23:55:21] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:55:21] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:55:21] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:55:22] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:55:22] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 371 constraints, problems are : Problem set: 0 solved, 238 unsolved in 23059 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:55:34] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:55:35] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:55:35] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 241/540 variables, 299/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 238/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:55:50] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-31 23:55:51] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 613 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 13/13 constraints]
After SMT, in 53203ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 53207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53810 ms. Remains : 300/300 places, 241/241 transitions.
RANDOM walk for 40000 steps (546 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (86 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1149609 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :0 out of 2
Probabilistic random walk after 1149609 steps, saw 161169 distinct states, run finished after 3001 ms. (steps per millisecond=383 ) properties seen :0
[2024-05-31 23:56:04] [INFO ] Invariant cache hit.
[2024-05-31 23:56:04] [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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/229 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 178/407 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/419 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/420 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/482 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/541 variables, 59/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:56:04] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 178/407 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/419 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/420 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/482 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/482 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/482 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/541 variables, 59/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 923 ms.
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 300/300 places, 241/241 transitions.
RANDOM walk for 40000 steps (558 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (87 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1015078 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 2
Probabilistic random walk after 1015078 steps, saw 143549 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2024-05-31 23:56:09] [INFO ] Invariant cache hit.
[2024-05-31 23:56:09] [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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/229 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 178/407 variables, 229/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/419 variables, 8/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/420 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/482 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/541 variables, 59/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/541 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 363 constraints, problems are : Problem set: 0 solved, 2 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/148 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/186 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/220 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:56:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 178/407 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/407 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/419 variables, 8/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/420 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/482 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/482 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/482 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/541 variables, 59/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/541 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 366 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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 867 ms.
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 300/300 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-31 23:56:10] [INFO ] Invariant cache hit.
[2024-05-31 23:56:10] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-31 23:56:10] [INFO ] Invariant cache hit.
[2024-05-31 23:56:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:56:11] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-31 23:56:11] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-31 23:56:11] [INFO ] Invariant cache hit.
[2024-05-31 23:56:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:56:16] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 241/540 variables, 299/361 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:56:24] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:56:25] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:56:25] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-31 23:56:25] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 371 constraints, problems are : Problem set: 0 solved, 238 unsolved in 22764 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 2/298 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 1/299 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:56:37] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-05-31 23:56:38] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:56:38] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 241/540 variables, 299/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 238/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-31 23:56:53] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:56:54] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 613 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 13/13 constraints]
After SMT, in 52900ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 52904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53455 ms. Remains : 300/300 places, 241/241 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 300 transition count 241
Applied a total of 1 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 241 rows 300 cols
[2024-05-31 23:57:04] [INFO ] Computed 61 invariants in 7 ms
[2024-05-31 23:57:04] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:57:04] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:57:04] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:57:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:57:04] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:57:04] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:57:04] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:57:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:57:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
TRAPS : Iteration 1
[2024-05-31 23:57:04] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:57:04] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 603 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60a-UpperBounds-07 in 190804 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-10
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 293 rows 351 cols
[2024-05-31 23:57:04] [INFO ] Computed 60 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (137 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (23 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:57:04] [INFO ] Invariant cache hit.
[2024-05-31 23:57:04] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:57:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:57:05] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-31 23:57:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:57:05] [INFO ] [Real]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-05-31 23:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:57:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:57:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 97 ms returned sat
[2024-05-31 23:57:05] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 23:57:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2024-05-31 23:57:05] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2024-05-31 23:57:05] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-31 23:57:05] [INFO ] Added : 97 causal constraints over 20 iterations in 551 ms. Result :sat
Minimization took 145 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p128) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Applied a total of 7 rules in 14 ms. Remains 344 /351 variables (removed 7) and now considering 285/292 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 344/351 places, 285/292 transitions.
// Phase 1: matrix 285 rows 344 cols
[2024-05-31 23:57:07] [INFO ] Computed 61 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13697 resets) in 3009 ms. (332 steps per ms)
BEST_FIRST walk for 1000001 steps (2210 resets) in 1090 ms. (916 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:57:11] [INFO ] Invariant cache hit.
[2024-05-31 23:57:11] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:57:11] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:57:11] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 23:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:57:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-31 23:57:11] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:57:11] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-31 23:57:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:57:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-31 23:57:11] [INFO ] Computed and/alt/rep : 276/460/276 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-31 23:57:12] [INFO ] Added : 102 causal constraints over 21 iterations in 482 ms. Result :sat
Minimization took 140 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 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 344/344 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-31 23:57:13] [INFO ] Invariant cache hit.
[2024-05-31 23:57:13] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-31 23:57:13] [INFO ] Invariant cache hit.
[2024-05-31 23:57:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:57:13] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2024-05-31 23:57:13] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-31 23:57:13] [INFO ] Invariant cache hit.
[2024-05-31 23:57:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 2/342 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 2/344 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 285/629 variables, 344/405 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-31 23:57:27] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:57:27] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-31 23:57:28] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-31 23:57:32] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:57:32] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-31 23:57:36] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:57:36] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:57:36] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 3 ms to minimize.
[2024-05-31 23:57:36] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-31 23:57:37] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-31 23:57:37] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:57:37] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:57:38] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-31 23:57:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:57:41] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:57:41] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/629 variables, and 423 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 2/342 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 2/344 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 285/629 variables, 344/421 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 282/705 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-31 23:58:11] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/629 variables, and 706 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 17/17 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60957 ms. Remains : 344/344 places, 285/285 transitions.
RANDOM walk for 40000 steps (536 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1029686 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 2
Probabilistic random walk after 1029686 steps, saw 145438 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-05-31 23:58:17] [INFO ] Invariant cache hit.
[2024-05-31 23:58: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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/105 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/113 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/114 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/126 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/128 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/128 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/132 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/132 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 197/329 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/329 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/363 variables, 19/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/363 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/395 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:58:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/395 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/395 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/404 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/404 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 225/629 variables, 280/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/629 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/629 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/629 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 33 (OVERLAPS) 0/629 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 408 constraints, problems are : Problem set: 0 solved, 2 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/105 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/108 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/113 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/114 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/126 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/126 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/128 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/132 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 197/329 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/329 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/363 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/363 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/395 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/395 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/395 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/404 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/404 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 225/629 variables, 280/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/629 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/629 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/629 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/629 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 410 constraints, problems are : Problem set: 0 solved, 2 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2265 steps, including 2 resets, run visited all 2 properties in 40 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 40 ms.
FORMULA DES-PT-60a-UpperBounds-10 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-60a-UpperBounds-10 in 73304 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-12
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 293 rows 351 cols
[2024-05-31 23:58:18] [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 (133 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10001 steps (22 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:58:18] [INFO ] Invariant cache hit.
[2024-05-31 23:58:18] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:58:18] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:58:18] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 23:58:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:58:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:58:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:58:18] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 23:58:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:58:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 20 ms returned sat
[2024-05-31 23:58:18] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-05-31 23:58:18] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:58:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-31 23:58:18] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 22 ms.
[2024-05-31 23:58:20] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-31 23:58:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-05-31 23:58:20] [INFO ] Added : 261 causal constraints over 53 iterations in 1310 ms. Result :sat
Minimization took 177 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p9) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Applied a total of 7 rules in 24 ms. Remains 344 /351 variables (removed 7) and now considering 285/292 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 344/351 places, 285/292 transitions.
// Phase 1: matrix 285 rows 344 cols
[2024-05-31 23:58:21] [INFO ] Computed 61 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13595 resets) in 3070 ms. (325 steps per ms)
BEST_FIRST walk for 1000001 steps (2273 resets) in 1063 ms. (939 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:58:25] [INFO ] Invariant cache hit.
[2024-05-31 23:58:25] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:58:25] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:58:25] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 23:58:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:58:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:58:25] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:58:25] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-31 23:58:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:58:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-31 23:58:25] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:58:26] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:58:26] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:58:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2024-05-31 23:58:26] [INFO ] Computed and/alt/rep : 276/446/276 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:58:27] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-31 23:58:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-31 23:58:27] [INFO ] Added : 254 causal constraints over 52 iterations in 1257 ms. Result :sat
Minimization took 191 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 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 344/344 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 285/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 344 /344 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-31 23:58:28] [INFO ] Invariant cache hit.
[2024-05-31 23:58:28] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-31 23:58:28] [INFO ] Invariant cache hit.
[2024-05-31 23:58:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:58:29] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2024-05-31 23:58:29] [INFO ] Redundant transitions in 2 ms returned []
Running 282 sub problems to find dead transitions.
[2024-05-31 23:58:29] [INFO ] Invariant cache hit.
[2024-05-31 23:58:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 1/341 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 2/343 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 282 unsolved
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 TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 7 (OVERLAPS) 285/628 variables, 343/404 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 2/406 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/406 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/629 variables, 1/407 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-31 23:58:48] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-31 23:58:48] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:58:48] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:58:48] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 4/411 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-31 23:58:52] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:58:52] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:58:55] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/629 variables, 3/414 constraints. Problems are: Problem set: 10 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/629 variables, and 414 constraints, problems are : Problem set: 10 solved, 272 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 344/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 10 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 35/35 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/52 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 6/58 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/59 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-31 23:59:01] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 1/60 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/60 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 12/343 variables, 8/68 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/69 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-31 23:59:06] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/70 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/70 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 11 (OVERLAPS) 285/628 variables, 343/413 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 2/415 constraints. Problems are: Problem set: 10 solved, 272 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 272/687 constraints. Problems are: Problem set: 10 solved, 272 unsolved
[2024-05-31 23:59:27] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/629 variables, and 688 constraints, problems are : Problem set: 10 solved, 272 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 343/344 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/282 constraints, Known Traps: 10/10 constraints]
After SMT, in 60227ms problems are : Problem set: 10 solved, 272 unsolved
Search for dead transitions found 10 dead transitions in 60232ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 344/344 places, 275/285 transitions.
Graph (complete) has 1168 edges and 344 vertex of which 334 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 334 /344 variables (removed 10) and now considering 275/275 (removed 0) transitions.
// Phase 1: matrix 275 rows 334 cols
[2024-05-31 23:59:29] [INFO ] Computed 61 invariants in 7 ms
[2024-05-31 23:59:29] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-31 23:59:29] [INFO ] Invariant cache hit.
[2024-05-31 23:59:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:59:29] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 334/344 places, 275/285 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61571 ms. Remains : 334/344 places, 275/285 transitions.
[2024-05-31 23:59:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13702 resets) in 2917 ms. (342 steps per ms)
BEST_FIRST walk for 1000001 steps (2261 resets) in 1051 ms. (950 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:59:33] [INFO ] Invariant cache hit.
[2024-05-31 23:59:33] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-31 23:59:34] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:59:34] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-31 23:59:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:59:34] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-31 23:59:34] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-31 23:59:34] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-31 23:59:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:59:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:59:34] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:59:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-31 23:59:34] [INFO ] Computed and/alt/rep : 266/428/266 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-31 23:59:35] [INFO ] Added : 251 causal constraints over 51 iterations in 1067 ms. Result :sat
Minimization took 153 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 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 334/334 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 334 /334 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2024-05-31 23:59:36] [INFO ] Invariant cache hit.
[2024-05-31 23:59:36] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-31 23:59:36] [INFO ] Invariant cache hit.
[2024-05-31 23:59:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:59:37] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-31 23:59:37] [INFO ] Redundant transitions in 2 ms returned []
Running 272 sub problems to find dead transitions.
[2024-05-31 23:59:37] [INFO ] Invariant cache hit.
[2024-05-31 23:59:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 1/331 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 2/333 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 275/608 variables, 333/394 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/609 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-31 23:59:54] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:59:56] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:59:57] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:59:57] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:59:57] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-01 00:00:00] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:00:00] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 5 ms to minimize.
[2024-06-01 00:00:00] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 00:00:00] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/609 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-01 00:00:06] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 407 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/331 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 2/333 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-01 00:00:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-06-01 00:00:10] [INFO ] Deduced a trap composed of 60 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:00:12] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:00:12] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 275/608 variables, 333/407 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 272/681 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 681 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 333/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 13/14 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60824 ms. Remains : 334/334 places, 275/275 transitions.
RANDOM walk for 40000 steps (537 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1104965 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :0 out of 2
Probabilistic random walk after 1104965 steps, saw 154591 distinct states, run finished after 3001 ms. (steps per millisecond=368 ) properties seen :0
[2024-06-01 00:00:40] [INFO ] Invariant cache hit.
[2024-06-01 00:00:40] [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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/487 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/488 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/488 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/488 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/550 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/609 variables, 59/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/609 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 397 constraints, problems are : Problem set: 0 solved, 2 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 144/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/231 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/256 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/263 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 212/475 variables, 263/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:00:41] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/487 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/487 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/488 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/488 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/488 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/550 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/609 variables, 59/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/609 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 400 constraints, problems are : Problem set: 0 solved, 2 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 334/334 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1060ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36219 steps, including 98 resets, run visited all 2 properties in 248 ms. (steps per millisecond=146 )
Parikh walk visited 2 properties in 248 ms.
FORMULA DES-PT-60a-UpperBounds-12 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-60a-UpperBounds-12 in 143627 ms.
Starting property specific reduction for DES-PT-60a-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 293 rows 351 cols
[2024-06-01 00:00:41] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 30 ms. (322 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-06-01 00:00:41] [INFO ] Invariant cache hit.
[2024-06-01 00:00:41] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-06-01 00:00:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-06-01 00:00:41] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-06-01 00:00:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:00:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-06-01 00:00:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2024-06-01 00:00:42] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-06-01 00:00:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:00:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-06-01 00:00:42] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2024-06-01 00:00:43] [INFO ] Added : 170 causal constraints over 34 iterations in 753 ms. Result :sat
Minimization took 150 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p87) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Applied a total of 26 rules in 43 ms. Remains 325 /351 variables (removed 26) and now considering 266/292 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 325/351 places, 266/292 transitions.
// Phase 1: matrix 266 rows 325 cols
[2024-06-01 00:00:44] [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 (13617 resets) in 2895 ms. (345 steps per ms)
BEST_FIRST walk for 1000001 steps (2239 resets) in 1022 ms. (977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:00:47] [INFO ] Invariant cache hit.
[2024-06-01 00:00:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:00:47] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-06-01 00:00:48] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-01 00:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:00:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:00:48] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-06-01 00:00:48] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-06-01 00:00:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:00:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2024-06-01 00:00:48] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 00:00:48] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:00:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2024-06-01 00:00:48] [INFO ] Computed and/alt/rep : 257/443/257 causal constraints (skipped 6 transitions) in 17 ms.
[2024-06-01 00:00:49] [INFO ] Added : 174 causal constraints over 36 iterations in 712 ms. Result :sat
Minimization took 133 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 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 325 /325 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 325/325 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 325 /325 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-01 00:00:49] [INFO ] Invariant cache hit.
[2024-06-01 00:00:50] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-06-01 00:00:50] [INFO ] Invariant cache hit.
[2024-06-01 00:00:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:00:50] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2024-06-01 00:00:50] [INFO ] Redundant transitions in 2 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-01 00:00:50] [INFO ] Invariant cache hit.
[2024-06-01 00:00:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/323 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/324 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 263 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 TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 8 (OVERLAPS) 266/590 variables, 324/385 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/590 variables, 2/387 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-06-01 00:00:59] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 00:00:59] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:00:59] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:00:59] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:01:00] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:01:00] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:01:00] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:01:00] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/590 variables, 8/395 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-06-01 00:01:02] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 00:01:04] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:01:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 3/398 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/398 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 13 (OVERLAPS) 1/591 variables, 1/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 0/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 15 (OVERLAPS) 0/591 variables, 0/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 399 constraints, problems are : Problem set: 50 solved, 213 unsolved in 22564 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 325/325 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 50 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 35/35 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/52 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 9/61 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-06-01 00:01:13] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 1/62 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/62 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 1/63 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/64 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/64 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 51/324 variables, 8/72 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/73 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/73 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 266/590 variables, 324/397 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 2/399 constraints. Problems are: Problem set: 50 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 213/612 constraints. Problems are: Problem set: 50 solved, 213 unsolved
[2024-06-01 00:01:30] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 1/613 constraints. Problems are: Problem set: 50 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/591 variables, and 613 constraints, problems are : Problem set: 50 solved, 213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 324/325 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/263 constraints, Known Traps: 13/13 constraints]
After SMT, in 52764ms problems are : Problem set: 50 solved, 213 unsolved
Search for dead transitions found 50 dead transitions in 52767ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 325/325 places, 216/266 transitions.
Graph (complete) has 934 edges and 325 vertex of which 275 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 275 /325 variables (removed 50) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 275 cols
[2024-06-01 00:01:43] [INFO ] Computed 61 invariants in 6 ms
[2024-06-01 00:01:43] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 00:01:43] [INFO ] Invariant cache hit.
[2024-06-01 00:01:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:01:43] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 275/325 places, 216/266 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54045 ms. Remains : 275/325 places, 216/266 transitions.
[2024-06-01 00:01:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13649 resets) in 2893 ms. (345 steps per ms)
BEST_FIRST walk for 1000001 steps (2288 resets) in 1030 ms. (969 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:01:47] [INFO ] Invariant cache hit.
[2024-06-01 00:01:47] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:01:47] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-06-01 00:01:47] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 00:01:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:01:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-06-01 00:01:48] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 9 ms returned sat
[2024-06-01 00:01:48] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 00:01:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:01:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2024-06-01 00:01:48] [INFO ] Computed and/alt/rep : 207/333/207 causal constraints (skipped 6 transitions) in 14 ms.
[2024-06-01 00:01:48] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-01 00:01:48] [INFO ] Added : 174 causal constraints over 36 iterations in 671 ms. Result :sat
Minimization took 124 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 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 275 /275 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 275/275 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 00:01:49] [INFO ] Invariant cache hit.
[2024-06-01 00:01:49] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 00:01:49] [INFO ] Invariant cache hit.
[2024-06-01 00:01:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:01:49] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-06-01 00:01:49] [INFO ] Redundant transitions in 0 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-01 00:01:49] [INFO ] Invariant cache hit.
[2024-06-01 00:01:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 2/273 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 00:01:55] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 00:01:57] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:01:57] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 00:01:59] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:02:00] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 00:02:01] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 00:02:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 15 (OVERLAPS) 1/491 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 17 (OVERLAPS) 0/491 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 345 constraints, problems are : Problem set: 0 solved, 213 unsolved in 19726 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/275 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 2/273 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 00:02:11] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 00:02:11] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 216/490 variables, 274/344 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 213/559 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-01 00:02:22] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:02:22] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:02:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 3/562 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/491 variables, and 562 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 274/275 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
After SMT, in 49853ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 49855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50365 ms. Remains : 275/275 places, 216/216 transitions.
RANDOM walk for 40000 steps (532 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1220754 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 2
Probabilistic random walk after 1220754 steps, saw 170958 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
[2024-06-01 00:02:42] [INFO ] Invariant cache hit.
[2024-06-01 00:02:42] [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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 103/137 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/172 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/197 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/204 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 153/357 variables, 204/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/369 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/370 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/432 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/491 variables, 59/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/491 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/491 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 338 constraints, problems are : Problem set: 0 solved, 2 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/275 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 103/137 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/172 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/197 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/204 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 153/357 variables, 204/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/369 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/369 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/370 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/432 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/491 variables, 59/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 275/275 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 688ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 78433 steps, including 133 resets, run visited all 2 properties in 394 ms. (steps per millisecond=199 )
Parikh walk visited 2 properties in 393 ms.
FORMULA DES-PT-60a-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-60a-UpperBounds-14 in 122284 ms.
Starting property specific reduction for DES-PT-60a-UpperBounds-15
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 293 rows 351 cols
[2024-06-01 00:02:44] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (135 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (22 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:02:44] [INFO ] Invariant cache hit.
[2024-06-01 00:02:44] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-06-01 00:02:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-06-01 00:02:44] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-01 00:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:02:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2024-06-01 00:02:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-06-01 00:02:44] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 00:02:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:02:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:02:44] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 19 ms.
[2024-06-01 00:02:44] [INFO ] Added : 72 causal constraints over 15 iterations in 349 ms. Result :sat
Minimization took 162 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 351 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p232) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 350 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 349 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 348 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 347 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 346 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 345 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 344 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 343 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 342 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 341 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 340 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 339 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 338 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 337 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 336 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 335 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 334 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 333 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 332 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 331 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 330 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 329 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 328 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 327 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 326 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 325 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 324 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 323 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 322 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 30 place count 321 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 31 place count 320 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 32 place count 319 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 33 place count 318 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 34 place count 317 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 35 place count 316 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 36 place count 315 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 37 place count 314 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 37 with 1 rules applied. Total rules applied 38 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 38 with 1 rules applied. Total rules applied 39 place count 312 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 39 with 1 rules applied. Total rules applied 40 place count 311 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 40 with 1 rules applied. Total rules applied 41 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 41 with 1 rules applied. Total rules applied 42 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 42 with 1 rules applied. Total rules applied 43 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 43 with 1 rules applied. Total rules applied 44 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 45 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 46 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 46 with 1 rules applied. Total rules applied 47 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 48 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 49 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 49 with 1 rules applied. Total rules applied 50 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 50 with 1 rules applied. Total rules applied 51 place count 300 transition count 241
Applied a total of 51 rules in 62 ms. Remains 300 /351 variables (removed 51) and now considering 241/292 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 300/351 places, 241/292 transitions.
// Phase 1: matrix 241 rows 300 cols
[2024-06-01 00:02:45] [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 (13679 resets) in 2890 ms. (345 steps per ms)
BEST_FIRST walk for 1000000 steps (2282 resets) in 1035 ms. (965 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:02:49] [INFO ] Invariant cache hit.
[2024-06-01 00:02:49] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:02:49] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-06-01 00:02:49] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 00:02:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:02:49] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:02:49] [INFO ] Computed and/alt/rep : 233/419/233 causal constraints (skipped 5 transitions) in 15 ms.
[2024-06-01 00:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:02:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:02:49] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-06-01 00:02:49] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-01 00:02:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-06-01 00:02:49] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:02:49] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:02:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-06-01 00:02:49] [INFO ] Computed and/alt/rep : 233/419/233 causal constraints (skipped 5 transitions) in 21 ms.
[2024-06-01 00:02:50] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:02:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:02:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2024-06-01 00:02:50] [INFO ] Added : 85 causal constraints over 18 iterations in 538 ms. Result :sat
Minimization took 127 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 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 300/300 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-06-01 00:02:50] [INFO ] Invariant cache hit.
[2024-06-01 00:02:50] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 00:02:50] [INFO ] Invariant cache hit.
[2024-06-01 00:02:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:02:51] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-06-01 00:02:51] [INFO ] Redundant transitions in 2 ms returned []
Running 238 sub problems to find dead transitions.
[2024-06-01 00:02:51] [INFO ] Invariant cache hit.
[2024-06-01 00:02:51] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 2/298 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 1/299 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 238 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 TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 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 TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 7 (OVERLAPS) 241/540 variables, 299/360 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/362 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-06-01 00:02:59] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-06-01 00:02:59] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 00:02:59] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:03:00] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 4/366 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/366 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/541 variables, 1/367 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-06-01 00:03:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:03:04] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:03:04] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:03:05] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 4/371 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/371 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/371 constraints. Problems are: Problem set: 93 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 371 constraints, problems are : Problem set: 93 solved, 145 unsolved in 18208 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 93 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 4/56 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/56 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/205 variables, 1/57 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 4/61 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/61 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 94/299 variables, 8/69 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-06-01 00:03:11] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:03:11] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:03:11] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-06-01 00:03:11] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 00:03:11] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:03:11] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 6/75 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-06-01 00:03:13] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/76 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-06-01 00:03:14] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:03:14] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 2/78 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/78 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 241/540 variables, 299/377 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 2/379 constraints. Problems are: Problem set: 93 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 145/524 constraints. Problems are: Problem set: 93 solved, 145 unsolved
[2024-06-01 00:03:20] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 1/525 constraints. Problems are: Problem set: 93 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 525 constraints, problems are : Problem set: 93 solved, 145 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 299/300 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/238 constraints, Known Traps: 18/18 constraints]
After SMT, in 48400ms problems are : Problem set: 93 solved, 145 unsolved
Search for dead transitions found 93 dead transitions in 48403ms
Found 93 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 93 transitions
Dead transitions reduction (with SMT) removed 93 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/300 places, 148/241 transitions.
Graph (complete) has 669 edges and 300 vertex of which 207 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.1 ms
Discarding 93 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 207 /300 variables (removed 93) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 207 cols
[2024-06-01 00:03:39] [INFO ] Computed 61 invariants in 1 ms
[2024-06-01 00:03:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 00:03:39] [INFO ] Invariant cache hit.
[2024-06-01 00:03:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:03:40] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/300 places, 148/241 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49399 ms. Remains : 207/300 places, 148/241 transitions.
[2024-06-01 00:03:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13639 resets) in 2901 ms. (344 steps per ms)
BEST_FIRST walk for 1000000 steps (2266 resets) in 1022 ms. (977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 00:03:44] [INFO ] Invariant cache hit.
[2024-06-01 00:03:44] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-06-01 00:03:44] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2024-06-01 00:03:44] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 00:03:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:03:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-06-01 00:03:44] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2024-06-01 00:03:44] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:03:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:03:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:03:44] [INFO ] Computed and/alt/rep : 140/232/140 causal constraints (skipped 5 transitions) in 9 ms.
[2024-06-01 00:03:44] [INFO ] Added : 71 causal constraints over 15 iterations in 187 ms. Result :sat
Minimization took 61 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 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 207/207 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 00:03:44] [INFO ] Invariant cache hit.
[2024-06-01 00:03:44] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 00:03:44] [INFO ] Invariant cache hit.
[2024-06-01 00:03:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:03:44] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-01 00:03:44] [INFO ] Redundant transitions in 0 ms returned []
Running 145 sub problems to find dead transitions.
[2024-06-01 00:03:44] [INFO ] Invariant cache hit.
[2024-06-01 00:03:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 1/206 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/354 variables, 206/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:48] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:03:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:03:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:03:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:03:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:03:48] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:03:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:49] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:03:50] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:03:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:03:50] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:03:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:03:50] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:51] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:52] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/355 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 285 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11218 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/205 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:57] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 00:03:57] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:03:58] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:58] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:03:58] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:03:59] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:03:59] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:03:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:04:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 148/354 variables, 206/292 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 145/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 1/355 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 440 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 25/25 constraints]
After SMT, in 41302ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 41305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41684 ms. Remains : 207/207 places, 148/148 transitions.
RANDOM walk for 40000 steps (548 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (90 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1335945 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 2
Probabilistic random walk after 1335945 steps, saw 186610 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2024-06-01 00:04:29] [INFO ] Invariant cache hit.
[2024-06-01 00:04:29] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/127 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/136 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 85/221 variables, 136/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/233 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/234 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/296 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/296 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/355 variables, 59/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:04:29] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/127 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/136 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 85/221 variables, 136/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/233 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/234 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/234 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/296 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/296 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/296 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/355 variables, 59/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 467ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 207/207 places, 148/148 transitions.
RANDOM walk for 40000 steps (550 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1309474 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 2
Probabilistic random walk after 1309474 steps, saw 182476 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-06-01 00:04:33] [INFO ] Invariant cache hit.
[2024-06-01 00:04:33] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/127 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/136 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 85/221 variables, 136/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/233 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/234 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/234 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/234 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 62/296 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/296 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 59/355 variables, 59/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/355 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/55 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/93 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:04:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/127 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/136 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 85/221 variables, 136/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/233 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/234 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/234 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/234 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 62/296 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/296 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/296 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 59/355 variables, 59/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/355 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 00:04:33] [INFO ] Invariant cache hit.
[2024-06-01 00:04:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 00:04:33] [INFO ] Invariant cache hit.
[2024-06-01 00:04:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 00:04:33] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-06-01 00:04:33] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-06-01 00:04:34] [INFO ] Invariant cache hit.
[2024-06-01 00:04:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 1/206 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/354 variables, 206/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:04:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:04:37] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:04:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:04:37] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:04:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:04:38] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:38] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:04:39] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:04:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:04:39] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:04:39] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:04:39] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:40] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 1/355 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (OVERLAPS) 0/355 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 285 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11355 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/205 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:46] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2024-06-01 00:04:47] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:04:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:48] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:04:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:04:48] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:04:48] [INFO ] Deduced a trap composed of 60 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-01 00:04:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:04:49] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (OVERLAPS) 148/354 variables, 206/292 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 145/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 1/355 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/355 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 440 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 25/25 constraints]
After SMT, in 41427ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 41429ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41805 ms. Remains : 207/207 places, 148/148 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 207 transition count 148
Applied a total of 1 rules in 8 ms. Remains 207 /207 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 148 rows 207 cols
[2024-06-01 00:05:15] [INFO ] Computed 61 invariants in 2 ms
[2024-06-01 00:05:15] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:05:15] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-06-01 00:05:15] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:05:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:05:15] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 8 ms returned sat
[2024-06-01 00:05:15] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:05:15] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:05:15] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 247 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-60a-UpperBounds-15 in 151675 ms.
[2024-06-01 00:05:15] [INFO ] Flatten gal took : 82 ms
[2024-06-01 00:05:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 00:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 351 places, 293 transitions and 1409 arcs took 9 ms.
Total runtime 1278746 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-60a-UpperBounds-07
Could not compute solution for formula : DES-PT-60a-UpperBounds-15

BK_STOP 1717200316184

--------------------
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
mcc2024
ub formula name DES-PT-60a-UpperBounds-07
ub formula formula --maxsum=/tmp/2425/ub_0_
ub formula name DES-PT-60a-UpperBounds-15
ub formula formula --maxsum=/tmp/2425/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-60a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-60a, 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 r480-tall-171624189900749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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