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.r488-tall-171631132900549.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 DoubleExponent-PT-004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 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 67K 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 DoubleExponent-PT-004-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717193916152

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:37] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-31 22:18:37] [INFO ] Transformed 216 places.
[2024-05-31 22:18:37] [INFO ] Transformed 198 transitions.
[2024-05-31 22:18:37] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 198 rows 216 cols
[2024-05-31 22:18:37] [INFO ] Computed 24 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 109, 1, 1, 1, 1, 2, +inf, 1, 2, 1]
RANDOM walk for 10000 steps (322 resets) in 38 ms. (256 steps per ms)
FORMULA DoubleExponent-PT-004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130001 steps (3698 resets) in 164 ms. (787 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, 2, +inf, 1, 2, 1]
[2024-05-31 22:18:37] [INFO ] Invariant cache hit.
[2024-05-31 22:18:37] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-31 22:18:37] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 22 ms returned sat
[2024-05-31 22:18:38] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 9 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:38] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-31 22:18:38] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 376 ms
[2024-05-31 22:18:38] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 22:18:39] [INFO ] Added : 192 causal constraints over 39 iterations in 878 ms. Result :sat
Minimization took 231 ms.
[2024-05-31 22:18:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:39] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 22:18:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 22:18:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:40] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2024-05-31 22:18:40] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 22:18:40] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-31 22:18:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 2 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-05-31 22:18:41] [INFO ] Added : 188 causal constraints over 39 iterations in 940 ms. Result :sat
Minimization took 221 ms.
[2024-05-31 22:18:41] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 22:18:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:18:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:41] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 22:18:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:18:42] [INFO ] Added : 183 causal constraints over 37 iterations in 670 ms. Result :sat
Minimization took 207 ms.
[2024-05-31 22:18:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 22:18:42] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:18:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:42] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 22:18:43] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:18:43] [INFO ] Deduced a trap composed of 68 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-31 22:18:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 22:18:43] [INFO ] Added : 195 causal constraints over 40 iterations in 823 ms. Result :sat
Minimization took 206 ms.
[2024-05-31 22:18:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-31 22:18:44] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 22:18:44] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 22:18:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:44] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2024-05-31 22:18:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 22:18:44] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:18:45] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-31 22:18:45] [INFO ] Added : 196 causal constraints over 40 iterations in 898 ms. Result :sat
Minimization took 200 ms.
[2024-05-31 22:18:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:45] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:45] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-31 22:18:45] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 22:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:45] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 22:18:45] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2024-05-31 22:18:46] [INFO ] Added : 190 causal constraints over 39 iterations in 1039 ms. Result :sat
Minimization took 205 ms.
[2024-05-31 22:18:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 22:18:47] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 22:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:47] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 22:18:47] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 3 ms to minimize.
[2024-05-31 22:18:47] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:18:47] [INFO ] Deduced a trap composed of 99 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:18:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2024-05-31 22:18:47] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2024-05-31 22:18:48] [INFO ] Added : 193 causal constraints over 40 iterations in 999 ms. Result :sat
Minimization took 205 ms.
[2024-05-31 22:18:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:48] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:49] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:49] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Deduced a trap composed of 109 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:18:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 288 ms
[2024-05-31 22:18:49] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:18:50] [INFO ] Added : 191 causal constraints over 39 iterations in 793 ms. Result :sat
Minimization took 212 ms.
[2024-05-31 22:18:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned unsat
[2024-05-31 22:18:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:18:50] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 507 ms
[2024-05-31 22:18:51] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 22:18:52] [INFO ] Added : 194 causal constraints over 40 iterations in 813 ms. Result :sat
Minimization took 221 ms.
[2024-05-31 22:18:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:52] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:52] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-31 22:18:52] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:52] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:52] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 22:18:52] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:18:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2024-05-31 22:18:53] [INFO ] Added : 192 causal constraints over 40 iterations in 1002 ms. Result :sat
Minimization took 205 ms.
[2024-05-31 22:18:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 22:18:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 7 ms returned unsat
[2024-05-31 22:18:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 22:18:53] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:18:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-31 22:18:54] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:18:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-31 22:18:54] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 22:18:54] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:18:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2024-05-31 22:18:55] [INFO ] Added : 183 causal constraints over 37 iterations in 822 ms. Result :sat
Minimization took 237 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, 1, +inf, 1, 1, 1]
FORMULA DoubleExponent-PT-004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 215 transition count 160
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 177 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 174 transition count 157
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 83 place count 174 transition count 149
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 99 place count 166 transition count 149
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 173 place count 129 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 185 place count 123 transition count 112
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 123 transition count 98
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 213 place count 109 transition count 98
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 227 place count 109 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 108 transition count 97
Applied a total of 228 rules in 71 ms. Remains 108 /216 variables (removed 108) and now considering 97/198 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 108/216 places, 97/198 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 22=1, 43=1, 44=1, 61=1, 67=1, 89=1, 92=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {20=1, 21=1, 22=1, 43=1, 44=1, 61=1, 67=1, 89=1, 92=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, +inf, 1, 1]
// Phase 1: matrix 97 rows 108 cols
[2024-05-31 22:18:57] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (128508 resets) in 880 ms. (1135 steps per ms)
BEST_FIRST walk for 11000005 steps (932249 resets) in 5668 ms. (1940 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-31 22:19:04] [INFO ] Invariant cache hit.
[2024-05-31 22:19:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:04] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:19:04] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:04] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 22:19:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:19:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 223 ms
[2024-05-31 22:19:04] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-31 22:19:04] [INFO ] Added : 59 causal constraints over 12 iterations in 151 ms. Result :sat
Minimization took 73 ms.
[2024-05-31 22:19:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Real]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-31 22:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 16 ms returned sat
[2024-05-31 22:19:05] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-31 22:19:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 22:19:05] [INFO ] Added : 89 causal constraints over 19 iterations in 368 ms. Result :sat
Minimization took 96 ms.
[2024-05-31 22:19:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:19:05] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-31 22:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2024-05-31 22:19:05] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2024-05-31 22:19:06] [INFO ] Added : 73 causal constraints over 16 iterations in 360 ms. Result :sat
Minimization took 80 ms.
[2024-05-31 22:19:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 22:19:06] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:06] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 22:19:06] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:06] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:06] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 22:19:06] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-31 22:19:06] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-31 22:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 22:19:06] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-31 22:19:06] [INFO ] Added : 88 causal constraints over 19 iterations in 270 ms. Result :sat
Minimization took 105 ms.
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:07] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 4 ms.
[2024-05-31 22:19:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-31 22:19:07] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-31 22:19:07] [INFO ] Added : 81 causal constraints over 17 iterations in 226 ms. Result :sat
Minimization took 74 ms.
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:19:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-31 22:19:07] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-31 22:19:07] [INFO ] Added : 60 causal constraints over 13 iterations in 177 ms. Result :sat
Minimization took 89 ms.
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:07] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:19:08] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:08] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 22:19:08] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-31 22:19:08] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:08] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:19:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-05-31 22:19:08] [INFO ] Added : 89 causal constraints over 20 iterations in 462 ms. Result :sat
Minimization took 89 ms.
[2024-05-31 22:19:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:19:08] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:19:08] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 8 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-31 22:19:09] [INFO ] Added : 84 causal constraints over 17 iterations in 339 ms. Result :sat
Minimization took 96 ms.
[2024-05-31 22:19:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:09] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:09] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:09] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:09] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-05-31 22:19:09] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 4 ms.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:19:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-31 22:19:10] [INFO ] Added : 73 causal constraints over 15 iterations in 289 ms. Result :sat
Minimization took 101 ms.
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:19:10] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-31 22:19:10] [INFO ] Added : 89 causal constraints over 19 iterations in 286 ms. Result :sat
Minimization took 82 ms.
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 8 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:10] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-31 22:19:10] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:19:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 22:19:10] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-31 22:19:11] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 22:19:11] [INFO ] Added : 39 causal constraints over 9 iterations in 159 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 108/108 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:19:11] [INFO ] Invariant cache hit.
[2024-05-31 22:19:11] [INFO ] Implicit Places using invariants in 88 ms returned [28, 47, 54, 60, 75, 80, 98, 105]
[2024-05-31 22:19:11] [INFO ] Actually due to overlaps returned [80, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 97/97 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 96
Applied a total of 2 rules in 9 ms. Remains 105 /106 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 105 cols
[2024-05-31 22:19:11] [INFO ] Computed 21 invariants in 3 ms
[2024-05-31 22:19:11] [INFO ] Implicit Places using invariants in 66 ms returned [28, 47, 54, 60, 95, 102]
[2024-05-31 22:19:11] [INFO ] Actually due to overlaps returned [102, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/108 places, 96/97 transitions.
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 103 transition count 96
Applied a total of 1 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 103 cols
[2024-05-31 22:19:11] [INFO ] Computed 19 invariants in 3 ms
[2024-05-31 22:19:11] [INFO ] Implicit Places using invariants in 74 ms returned [28, 47, 54, 60]
[2024-05-31 22:19:11] [INFO ] Actually due to overlaps returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 102/108 places, 96/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 260 ms. Remains : 102/108 places, 96/97 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 42=1, 57=1, 63=1, 85=1, 88=1, 93=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 42=1, 57=1, 63=1, 85=1, 88=1, 93=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
// Phase 1: matrix 96 rows 102 cols
[2024-05-31 22:19:13] [INFO ] Computed 18 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144730 resets) in 662 ms. (1508 steps per ms)
BEST_FIRST walk for 11000004 steps (1005693 resets) in 5182 ms. (2122 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-31 22:19:19] [INFO ] Invariant cache hit.
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:19:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 217 ms
[2024-05-31 22:19:19] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-31 22:19:19] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 22:19:19] [INFO ] Added : 70 causal constraints over 14 iterations in 252 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:19] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:19:20] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-31 22:19:20] [INFO ] Added : 73 causal constraints over 15 iterations in 168 ms. Result :sat
Minimization took 72 ms.
[2024-05-31 22:19:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:20] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-31 22:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 22:19:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:20] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 182 ms
[2024-05-31 22:19:21] [INFO ] Added : 90 causal constraints over 18 iterations in 536 ms. Result :sat
Minimization took 93 ms.
[2024-05-31 22:19:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:21] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:21] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:21] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:19:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2024-05-31 22:19:21] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 443 ms
[2024-05-31 22:19:22] [INFO ] Added : 90 causal constraints over 18 iterations in 696 ms. Result :sat
Minimization took 114 ms.
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-31 22:19:22] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-31 22:19:22] [INFO ] Added : 92 causal constraints over 19 iterations in 318 ms. Result :sat
Minimization took 80 ms.
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-31 22:19:22] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 4 ms.
[2024-05-31 22:19:23] [INFO ] Added : 92 causal constraints over 19 iterations in 282 ms. Result :sat
Minimization took 114 ms.
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:19:23] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-31 22:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:23] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-31 22:19:23] [INFO ] Added : 82 causal constraints over 18 iterations in 213 ms. Result :sat
Minimization took 79 ms.
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:19:23] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 22:19:24] [INFO ] Added : 43 causal constraints over 9 iterations in 164 ms. Result :sat
Minimization took 57 ms.
[2024-05-31 22:19:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 224 ms
[2024-05-31 22:19:24] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 22:19:24] [INFO ] Added : 73 causal constraints over 15 iterations in 242 ms. Result :sat
Minimization took 86 ms.
[2024-05-31 22:19:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:19:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:24] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:24] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:19:25] [INFO ] Added : 90 causal constraints over 18 iterations in 318 ms. Result :sat
Minimization took 140 ms.
[2024-05-31 22:19:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:25] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:25] [INFO ] [Real]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-31 22:19:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:25] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:25] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:25] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:25] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 22:19:25] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:19:25] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 22:19:25] [INFO ] Added : 33 causal constraints over 7 iterations in 157 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 102/102 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-31 22:19:26] [INFO ] Invariant cache hit.
[2024-05-31 22:19:26] [INFO ] Implicit Places using invariants in 66 ms returned [46, 53, 59]
[2024-05-31 22:19:26] [INFO ] Actually due to overlaps returned [46, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/102 places, 96/96 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 95
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 3 place count 99 transition count 95
Applied a total of 3 rules in 10 ms. Remains 99 /100 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-31 22:19:26] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 22:19:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 22:19:26] [INFO ] Invariant cache hit.
[2024-05-31 22:19:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:19:26] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/102 places, 95/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 314 ms. Remains : 99/102 places, 95/96 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 83=1, 86=1, 91=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 83=1, 86=1, 91=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-31 22:19:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144303 resets) in 673 ms. (1483 steps per ms)
BEST_FIRST walk for 11000007 steps (1005942 resets) in 5180 ms. (2123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-31 22:19:40] [INFO ] Invariant cache hit.
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:41] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:19:41] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:19:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-31 22:19:41] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-05-31 22:19:41] [INFO ] Added : 93 causal constraints over 19 iterations in 530 ms. Result :sat
Minimization took 104 ms.
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:19:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:41] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:42] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:19:42] [INFO ] Added : 90 causal constraints over 19 iterations in 317 ms. Result :sat
Minimization took 92 ms.
[2024-05-31 22:19:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:42] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:19:42] [INFO ] Added : 92 causal constraints over 19 iterations in 284 ms. Result :sat
Minimization took 93 ms.
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-31 22:19:43] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:19:43] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:19:43] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 22:19:43] [INFO ] Added : 88 causal constraints over 18 iterations in 323 ms. Result :sat
Minimization took 97 ms.
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:19:43] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:19:43] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 22:19:43] [INFO ] Added : 79 causal constraints over 16 iterations in 263 ms. Result :sat
Minimization took 92 ms.
[2024-05-31 22:19:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:19:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:44] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:19:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 22:19:44] [INFO ] Added : 61 causal constraints over 13 iterations in 228 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 22:19:44] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:19:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:19:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 22:19:44] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 198 ms
[2024-05-31 22:19:45] [INFO ] Added : 89 causal constraints over 18 iterations in 436 ms. Result :sat
Minimization took 113 ms.
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:19:45] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2024-05-31 22:19:45] [INFO ] Added : 46 causal constraints over 10 iterations in 295 ms. Result :sat
Minimization took 65 ms.
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:19:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:19:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2024-05-31 22:19:46] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 22:19:46] [INFO ] Added : 74 causal constraints over 15 iterations in 221 ms. Result :sat
Minimization took 91 ms.
[2024-05-31 22:19:46] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:19:46] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:19:46] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:46] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:19:46] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:19:46] [INFO ] Added : 92 causal constraints over 20 iterations in 359 ms. Result :sat
Minimization took 96 ms.
[2024-05-31 22:19:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:19:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:19:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 22:19:47] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:19:47] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:19:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 22:19:47] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:19:47] [INFO ] Added : 32 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 99/99 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Applied a total of 0 rules in 13 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-31 22:19:47] [INFO ] Invariant cache hit.
[2024-05-31 22:19:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 22:19:47] [INFO ] Invariant cache hit.
[2024-05-31 22:19:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:19:48] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-31 22:19:48] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-31 22:19:48] [INFO ] Invariant cache hit.
[2024-05-31 22:19:48] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/97 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:19:49] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 95/194 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 131 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/97 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 95/194 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:54] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/194 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:55] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/194 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 18 (OVERLAPS) 0/194 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 228 constraints, problems are : Problem set: 0 solved, 94 unsolved in 9100 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 8/8 constraints]
After SMT, in 12657ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 12664ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12924 ms. Remains : 99/99 places, 95/95 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 83=1, 86=1, 91=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 83=1, 86=1, 91=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 40000 steps (5842 resets) in 1055 ms. (37 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (372 resets) in 105 ms. (37 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (350 resets) in 122 ms. (32 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (340 resets) in 96 ms. (41 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (350 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (363 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (374 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (359 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (372 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (366 resets) in 22 ms. (173 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (373 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (371 resets) in 45 ms. (86 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (372 resets) in 22 ms. (173 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (346 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (371 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (358 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (361 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (364 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (369 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (353 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (364 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 272971 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :6 out of 20
Probabilistic random walk after 272971 steps, saw 136537 distinct states, run finished after 3006 ms. (steps per millisecond=90 ) properties seen :6
[2024-05-31 22:20:13] [INFO ] Invariant cache hit.
[2024-05-31 22:20:13] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 64/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MAX3 is UNSAT
At refinement iteration 4 (OVERLAPS) 23/95 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 95/190 variables, 95/109 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 11/120 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 2/122 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 4/194 variables, 4/126 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 2/128 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/194 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 128 constraints, problems are : Problem set: 1 solved, 13 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 64/72 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 23/95 variables, 9/15 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:20:13] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 11/28 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 3/31 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 95/190 variables, 95/126 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 11/137 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 13/150 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-31 22:20:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 4/194 variables, 4/155 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/194 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 157 constraints, problems are : Problem set: 1 solved, 13 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 18/18 constraints]
After SMT, in 1620ms problems are : Problem set: 1 solved, 13 unsolved
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2697 ms.
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 93
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 97 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 91
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 95 transition count 91
Applied a total of 11 rules in 12 ms. Remains 95 /99 variables (removed 4) and now considering 91/95 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 95/99 places, 91/95 transitions.
RANDOM walk for 40000 steps (5789 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3597 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3675 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3612 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 176 ms. (225 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3627 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3633 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3717 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3649 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3670 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 294619 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 13
Probabilistic random walk after 294619 steps, saw 147356 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 91 rows 95 cols
[2024-05-31 22:20:21] [INFO ] Computed 16 invariants in 6 ms
[2024-05-31 22:20:21] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 60/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 23/91 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 91/182 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 13/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 4/186 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 126 constraints, problems are : Problem set: 0 solved, 13 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 60/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 23/91 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 91/182 variables, 91/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:20:22] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 7/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/186 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/186 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 161 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 24/24 constraints]
After SMT, in 1737ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3632 ms.
Support contains 8 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 95/95 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-31 22:20:26] [INFO ] Invariant cache hit.
[2024-05-31 22:20:26] [INFO ] Implicit Places using invariants in 55 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/95 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 90
Applied a total of 2 rules in 6 ms. Remains 93 /94 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 93 cols
[2024-05-31 22:20:26] [INFO ] Computed 15 invariants in 5 ms
[2024-05-31 22:20:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 22:20:26] [INFO ] Invariant cache hit.
[2024-05-31 22:20:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:20:27] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/95 places, 90/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 272 ms. Remains : 93/95 places, 90/91 transitions.
RANDOM walk for 40000 steps (5786 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3706 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3609 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3611 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3640 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3662 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3710 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3681 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3600 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3686 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3639 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (3665 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3693 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 294468 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 13
Probabilistic random walk after 294468 steps, saw 147264 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-31 22:20:30] [INFO ] Invariant cache hit.
[2024-05-31 22:20:30] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 18/89 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 90/179 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 13/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:20:30] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-31 22:20:30] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 4/183 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 124 constraints, problems are : Problem set: 0 solved, 13 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 18/89 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 90/179 variables, 89/109 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/183 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/183 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 144 constraints, problems are : Problem set: 0 solved, 13 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
After SMT, in 1229ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2786 ms.
Support contains 8 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 90/90 transitions.
Applied a total of 0 rules in 13 ms. Remains 93 /93 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 93/93 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-31 22:20:34] [INFO ] Invariant cache hit.
[2024-05-31 22:20:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 22:20:34] [INFO ] Invariant cache hit.
[2024-05-31 22:20:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:20:34] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-31 22:20:34] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-31 22:20:34] [INFO ] Invariant cache hit.
[2024-05-31 22:20:34] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 2/91 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 2/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 22:20:35] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/183 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 122 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 2/91 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 2/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/183 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 89/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 22:20:39] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/183 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (OVERLAPS) 0/183 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 212 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 6329ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 6330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6532 ms. Remains : 93/93 places, 90/90 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 92 transition count 89
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 92 transition count 82
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 85 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 82 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 82 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 82 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 81 transition count 78
Applied a total of 24 rules in 14 ms. Remains 81 /93 variables (removed 12) and now considering 78/90 (removed 12) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 78 rows 81 cols
[2024-05-31 22:20:41] [INFO ] Computed 15 invariants in 1 ms
[2024-05-31 22:20:41] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-31 22:20:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:20:41] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:41] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 276 ms
TRAPS : Iteration 1
[2024-05-31 22:20:41] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 2
[2024-05-31 22:20:41] [INFO ] After 586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-31 22:20:41] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 752 ms.
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, +inf, 1]
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 95 rows 99 cols
[2024-05-31 22:20:41] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1396 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (916 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:20:41] [INFO ] Invariant cache hit.
[2024-05-31 22:20:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:20:41] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:20:41] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:20:41] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:20:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:20:42] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:20:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-31 22:20:42] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-31 22:20:42] [INFO ] Added : 93 causal constraints over 19 iterations in 527 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 94
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 97 transition count 92
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 95 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 16 place count 90 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 90 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 87 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 87 transition count 84
Applied a total of 25 rules in 21 ms. Remains 87 /99 variables (removed 12) and now considering 84/95 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 87/99 places, 84/95 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 84 rows 87 cols
[2024-05-31 22:20:42] [INFO ] Computed 15 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144285 resets) in 609 ms. (1639 steps per ms)
BEST_FIRST walk for 1000000 steps (91547 resets) in 439 ms. (2272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:20:44] [INFO ] Invariant cache hit.
[2024-05-31 22:20:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:20:44] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:20:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:20:44] [INFO ] [Real]Added 14 Read/Feed constraints in 14 ms returned sat
[2024-05-31 22:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:20:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:20:44] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:44] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 22:20:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 22:20:44] [INFO ] Computed and/alt/rep : 80/447/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:20:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 481 ms
[2024-05-31 22:20:44] [INFO ] Added : 79 causal constraints over 17 iterations in 753 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-31 22:20:45] [INFO ] Invariant cache hit.
[2024-05-31 22:20:45] [INFO ] Implicit Places using invariants in 70 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 83
Applied a total of 2 rules in 4 ms. Remains 85 /86 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 85 cols
[2024-05-31 22:20:45] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:20:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 22:20:45] [INFO ] Invariant cache hit.
[2024-05-31 22:20:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:20:45] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 279 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 3 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-31 22:20:45] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 22:20:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 22:20:45] [INFO ] Invariant cache hit.
[2024-05-31 22:20:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:20:45] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/87 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 569 ms. Remains : 82/87 places, 81/84 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 11=1, 12=1, 15=1, 19=1, 28=1, 33=1, 38=1, 48=1, 50=1, 52=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:20:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144230 resets) in 605 ms. (1650 steps per ms)
BEST_FIRST walk for 1000000 steps (91280 resets) in 453 ms. (2202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:20:47] [INFO ] Invariant cache hit.
[2024-05-31 22:20:47] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-31 22:20:47] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 22:20:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:20:47] [INFO ] [Real]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:20:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:20:47] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:20:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:20:47] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-31 22:20:47] [INFO ] Computed and/alt/rep : 75/416/75 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 226 ms
[2024-05-31 22:20:47] [INFO ] Added : 61 causal constraints over 14 iterations in 374 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-31 22:20:47] [INFO ] Invariant cache hit.
[2024-05-31 22:20:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 22:20:47] [INFO ] Invariant cache hit.
[2024-05-31 22:20:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:20:48] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-31 22:20:48] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 22:20:48] [INFO ] Invariant cache hit.
[2024-05-31 22:20:48] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 194 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4495 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 6131ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6378 ms. Remains : 82/82 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 11=1, 12=1, 15=1, 19=1, 28=1, 33=1, 38=1, 48=1, 50=1, 52=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5765 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3622 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1381024 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1381024 steps, saw 690529 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :0
[2024-05-31 22:20:57] [INFO ] Invariant cache hit.
[2024-05-31 22:20:57] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
RANDOM walk for 40000 steps (5822 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1384934 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1384934 steps, saw 692477 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2024-05-31 22:21:01] [INFO ] Invariant cache hit.
[2024-05-31 22:21:01] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-31 22:21:01] [INFO ] Invariant cache hit.
[2024-05-31 22:21:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:21:01] [INFO ] Invariant cache hit.
[2024-05-31 22:21:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:21:01] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-31 22:21:01] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 22:21:01] [INFO ] Invariant cache hit.
[2024-05-31 22:21:01] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 194 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4430 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 6068ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6069ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6303 ms. Remains : 82/82 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 72 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 69
Applied a total of 24 rules in 12 ms. Remains 70 /82 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 70 cols
[2024-05-31 22:21:07] [INFO ] Computed 13 invariants in 3 ms
[2024-05-31 22:21:07] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:21:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:07] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:07] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 168 ms
TRAPS : Iteration 1
[2024-05-31 22:21:07] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:21:07] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 275 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-00 in 26106 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 95 rows 99 cols
[2024-05-31 22:21:08] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1450 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (907 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:21:08] [INFO ] Invariant cache hit.
[2024-05-31 22:21:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:08] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 22:21:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:21:08] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:08] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:21:08] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:21:08] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:21:08] [INFO ] Added : 90 causal constraints over 19 iterations in 310 ms. Result :sat
Minimization took 92 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 99 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p167) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Graph (complete) has 329 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 318 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 94 transition count 89
Reduce places removed 3 places and 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 91 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 90 transition count 86
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 20 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 29 place count 72 transition count 66
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 69 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 36 place count 67 transition count 64
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 38 place count 67 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 40 place count 65 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 43 place count 65 transition count 62
Applied a total of 43 rules in 11 ms. Remains 65 /99 variables (removed 34) and now considering 62/94 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 65/99 places, 62/94 transitions.
// Phase 1: matrix 62 rows 65 cols
[2024-05-31 22:21:08] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144047 resets) in 571 ms. (1748 steps per ms)
BEST_FIRST walk for 1000001 steps (91401 resets) in 413 ms. (2415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:21:09] [INFO ] Invariant cache hit.
[2024-05-31 22:21:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:09] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:21:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:21:09] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:09] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:21:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:21:09] [INFO ] Computed and/alt/rep : 60/322/60 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 22:21:09] [INFO ] Added : 59 causal constraints over 13 iterations in 156 ms. Result :sat
Minimization took 71 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 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 65/65 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-31 22:21:09] [INFO ] Invariant cache hit.
[2024-05-31 22:21:10] [INFO ] Implicit Places using invariants in 51 ms returned [13, 20]
[2024-05-31 22:21:10] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/65 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 61
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 63 cols
[2024-05-31 22:21:10] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 22:21:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 22:21:10] [INFO ] Invariant cache hit.
[2024-05-31 22:21:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:21:10] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/65 places, 61/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 207 ms. Remains : 63/65 places, 61/62 transitions.
[2024-05-31 22:21:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144344 resets) in 570 ms. (1751 steps per ms)
BEST_FIRST walk for 1000001 steps (91271 resets) in 421 ms. (2369 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:21:11] [INFO ] Invariant cache hit.
[2024-05-31 22:21:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:11] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:21:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:21:11] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:21:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:11] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:11] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:21:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:21:11] [INFO ] Computed and/alt/rep : 59/315/59 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-31 22:21:11] [INFO ] Added : 51 causal constraints over 12 iterations in 101 ms. Result :sat
Minimization took 45 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 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-31 22:21:11] [INFO ] Invariant cache hit.
[2024-05-31 22:21:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 22:21:11] [INFO ] Invariant cache hit.
[2024-05-31 22:21:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:21:11] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-31 22:21:11] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 22:21:11] [INFO ] Invariant cache hit.
[2024-05-31 22:21:11] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 3 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2760 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5798 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3626 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3619 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 776143 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 2
Probabilistic random walk after 776143 steps, saw 388253 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-05-31 22:21:17] [INFO ] Invariant cache hit.
[2024-05-31 22:21:17] [INFO ] State equation strengthened by 10 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) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:21:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5758 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3686 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3655 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 799993 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 799993 steps, saw 400180 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-31 22:21:20] [INFO ] Invariant cache hit.
[2024-05-31 22:21:20] [INFO ] State equation strengthened by 10 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) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-31 22:21:20] [INFO ] Invariant cache hit.
[2024-05-31 22:21:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 22:21:21] [INFO ] Invariant cache hit.
[2024-05-31 22:21:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:21:21] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-31 22:21:21] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 22:21:21] [INFO ] Invariant cache hit.
[2024-05-31 22:21:21] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints]
After SMT, in 2522ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2674 ms. Remains : 63/63 places, 61/61 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 63 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 58 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 56 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 56 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 55 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 55 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 52
Applied a total of 18 rules in 9 ms. Remains 54 /63 variables (removed 9) and now considering 52/61 (removed 9) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 54 cols
[2024-05-31 22:21:23] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 22:21:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:23] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:21:23] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:21:23] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:23] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:21:23] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:21:23] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:21:23] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 126 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-01 in 15757 ms.
Starting property specific reduction for DoubleExponent-PT-004-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 95 rows 99 cols
[2024-05-31 22:21:23] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1468 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (925 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:21:23] [INFO ] Invariant cache hit.
[2024-05-31 22:21:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 22:21:23] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:21:23] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:21:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:21:23] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:21:24] [INFO ] Added : 92 causal constraints over 19 iterations in 282 ms. Result :sat
Minimization took 95 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 99 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p197) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Graph (complete) has 330 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 95 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 93 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 93 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 92 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 88 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 88 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 85 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 85 transition count 81
Applied a total of 26 rules in 12 ms. Remains 85 /99 variables (removed 14) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 85/99 places, 81/94 transitions.
// Phase 1: matrix 81 rows 85 cols
[2024-05-31 22:21:24] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144358 resets) in 599 ms. (1666 steps per ms)
BEST_FIRST walk for 1000001 steps (91468 resets) in 434 ms. (2298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:21:25] [INFO ] Invariant cache hit.
[2024-05-31 22:21:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Real]Absence check using 7 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 22:21:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:21:25] [INFO ] [Real]Added 13 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:21:25] [INFO ] Computed and/alt/rep : 79/446/79 causal constraints (skipped 1 transitions) in 5 ms.
[2024-05-31 22:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Nat]Absence check using 7 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:21:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:21:25] [INFO ] Computed and/alt/rep : 79/446/79 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-31 22:21:25] [INFO ] Added : 78 causal constraints over 17 iterations in 241 ms. Result :sat
Minimization took 131 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-31 22:21:26] [INFO ] Invariant cache hit.
[2024-05-31 22:21:26] [INFO ] Implicit Places using invariants in 61 ms returned [20, 39, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/85 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 77
Applied a total of 8 rules in 3 ms. Remains 78 /82 variables (removed 4) and now considering 77/81 (removed 4) transitions.
// Phase 1: matrix 77 rows 78 cols
[2024-05-31 22:21:26] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 22:21:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 22:21:26] [INFO ] Invariant cache hit.
[2024-05-31 22:21:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:21:26] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 77/85 places, 77/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 280 ms. Remains : 77/85 places, 77/81 transitions.
// Phase 1: matrix 77 rows 77 cols
[2024-05-31 22:21:26] [INFO ] Computed 12 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143796 resets) in 602 ms. (1658 steps per ms)
BEST_FIRST walk for 1000001 steps (91426 resets) in 441 ms. (2262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:21:27] [INFO ] Invariant cache hit.
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 22:21:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:21:27] [INFO ] [Real]Added 13 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:21:27] [INFO ] Computed and/alt/rep : 75/432/75 causal constraints (skipped 1 transitions) in 6 ms.
[2024-05-31 22:21:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:21:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:21:27] [INFO ] Computed and/alt/rep : 75/432/75 causal constraints (skipped 1 transitions) in 5 ms.
[2024-05-31 22:21:27] [INFO ] Added : 69 causal constraints over 14 iterations in 172 ms. Result :sat
Minimization took 72 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 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 77/77 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 22:21:27] [INFO ] Invariant cache hit.
[2024-05-31 22:21:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:21:27] [INFO ] Invariant cache hit.
[2024-05-31 22:21:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:21:28] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 22:21:28] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 22:21:28] [INFO ] Invariant cache hit.
[2024-05-31 22:21:28] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 76/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:30] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:31] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/154 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:32] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:21:32] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:21:32] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:32] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/154 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 186 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5414 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 8/8 constraints]
After SMT, in 6606ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6820 ms. Remains : 77/77 places, 77/77 transitions.
RANDOM walk for 40000 steps (5739 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3700 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3666 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 627123 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 2
Probabilistic random walk after 627123 steps, saw 313634 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2024-05-31 22:21:37] [INFO ] Invariant cache hit.
[2024-05-31 22:21:37] [INFO ] State equation strengthened by 13 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) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/149 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/154 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:21:37] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:38] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/149 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/154 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 77/77 places, 77/77 transitions.
RANDOM walk for 40000 steps (5795 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3655 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 746819 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 2
Probabilistic random walk after 746819 steps, saw 373488 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
[2024-05-31 22:21:41] [INFO ] Invariant cache hit.
[2024-05-31 22:21:41] [INFO ] State equation strengthened by 13 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) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/149 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/154 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 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) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/149 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/154 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 77/77 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 22:21:41] [INFO ] Invariant cache hit.
[2024-05-31 22:21:41] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 22:21:41] [INFO ] Invariant cache hit.
[2024-05-31 22:21:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 22:21:42] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-31 22:21:42] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 22:21:42] [INFO ] Invariant cache hit.
[2024-05-31 22:21:42] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 76/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/154 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:21:46] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:46] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:47] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:21:47] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/154 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 186 constraints, problems are : Problem set: 0 solved, 76 unsolved in 5544 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 8/8 constraints]
After SMT, in 6702ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6703ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6904 ms. Remains : 77/77 places, 77/77 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 77 transition count 71
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 71 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 68 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 68 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 67 transition count 67
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 65 transition count 65
Applied a total of 24 rules in 5 ms. Remains 65 /77 variables (removed 12) and now considering 65/77 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 65 rows 65 cols
[2024-05-31 22:21:48] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 22:21:48] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:48] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:48] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:21:48] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:21:48] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:21:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:48] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:48] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:21:48] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:21:48] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2024-05-31 22:21:48] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:21:48] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-02 in 25211 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 95 rows 99 cols
[2024-05-31 22:21:48] [INFO ] Computed 16 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1444 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (887 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 22:21:48] [INFO ] Invariant cache hit.
[2024-05-31 22:21:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:49] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:21:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:21:49] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:21:49] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:21:49] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:21:49] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 22:21:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-31 22:21:49] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:21:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 22:21:49] [INFO ] Added : 88 causal constraints over 18 iterations in 315 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 94 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 94 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 93 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 88 transition count 87
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 88 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 86 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 86 transition count 85
Applied a total of 25 rules in 8 ms. Remains 86 /99 variables (removed 13) and now considering 85/95 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 86/99 places, 85/95 transitions.
// Phase 1: matrix 85 rows 86 cols
[2024-05-31 22:21:49] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (144043 resets) in 622 ms. (1605 steps per ms)
BEST_FIRST walk for 1000001 steps (91395 resets) in 439 ms. (2272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 22:21:50] [INFO ] Invariant cache hit.
[2024-05-31 22:21:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:50] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-31 22:21:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:21:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:21:50] [INFO ] [Real]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:21:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:50] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:21:50] [INFO ] [Nat]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:21:50] [INFO ] Computed and/alt/rep : 81/464/81 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-31 22:21:50] [INFO ] Added : 54 causal constraints over 11 iterations in 131 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 86/86 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-31 22:21:51] [INFO ] Invariant cache hit.
[2024-05-31 22:21:51] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:21:51] [INFO ] Invariant cache hit.
[2024-05-31 22:21:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:21:51] [INFO ] Implicit Places using invariants and state equation in 191 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 248 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 85/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Applied a total of 2 rules in 4 ms. Remains 84 /85 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-31 22:21:51] [INFO ] Computed 13 invariants in 3 ms
[2024-05-31 22:21:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 22:21:51] [INFO ] Invariant cache hit.
[2024-05-31 22:21:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:21:51] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 84/85 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 467 ms. Remains : 84/86 places, 84/85 transitions.
[2024-05-31 22:21:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (144256 resets) in 619 ms. (1612 steps per ms)
BEST_FIRST walk for 1000000 steps (91705 resets) in 444 ms. (2247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 22:21:52] [INFO ] Invariant cache hit.
[2024-05-31 22:21:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:52] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:21:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:21:52] [INFO ] [Real]Added 14 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:21:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 22:21:52] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-31 22:21:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:21:52] [INFO ] [Nat]Added 14 Read/Feed constraints in 15 ms returned sat
[2024-05-31 22:21:52] [INFO ] Computed and/alt/rep : 80/459/80 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-31 22:21:52] [INFO ] Added : 68 causal constraints over 15 iterations in 176 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-31 22:21:53] [INFO ] Invariant cache hit.
[2024-05-31 22:21:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 22:21:53] [INFO ] Invariant cache hit.
[2024-05-31 22:21:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:21:53] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-31 22:21:53] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-31 22:21:53] [INFO ] Invariant cache hit.
[2024-05-31 22:21:53] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5529ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5761 ms. Remains : 84/84 places, 84/84 transitions.
RANDOM walk for 40000 steps (5786 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3673 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3718 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 684581 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 2
Probabilistic random walk after 684581 steps, saw 342369 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2024-05-31 22:22:01] [INFO ] Invariant cache hit.
[2024-05-31 22:22:01] [INFO ] State equation strengthened by 14 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) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 1 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 1 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 225ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 84/84 transitions.
RANDOM walk for 40000 steps (5796 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1335706 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Probabilistic random walk after 1335706 steps, saw 667858 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2024-05-31 22:22:05] [INFO ] Invariant cache hit.
[2024-05-31 22:22:05] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-31 22:22:05] [INFO ] Invariant cache hit.
[2024-05-31 22:22:05] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:22:05] [INFO ] Invariant cache hit.
[2024-05-31 22:22:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:05] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-31 22:22:05] [INFO ] Redundant transitions in 5 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-31 22:22:05] [INFO ] Invariant cache hit.
[2024-05-31 22:22:05] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5335ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5566 ms. Remains : 84/84 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 11 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2024-05-31 22:22:11] [INFO ] Computed 13 invariants in 2 ms
[2024-05-31 22:22:11] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:22:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 22:22:11] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2024-05-31 22:22:11] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:22:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:22:11] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:22:11] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:22:11] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 104 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-04 in 22138 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-05
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 95 rows 99 cols
[2024-05-31 22:22:11] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1441 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (903 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:22:11] [INFO ] Invariant cache hit.
[2024-05-31 22:22:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:11] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:11] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:22:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:22:11] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-31 22:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:11] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:11] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:22:11] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:22:11] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 22:22:11] [INFO ] Added : 79 causal constraints over 16 iterations in 255 ms. Result :sat
Minimization took 92 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 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 95 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 94 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 89 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 89 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 86 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 86 transition count 84
Applied a total of 26 rules in 9 ms. Remains 86 /99 variables (removed 13) and now considering 84/95 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/99 places, 84/95 transitions.
// Phase 1: matrix 84 rows 86 cols
[2024-05-31 22:22:11] [INFO ] Computed 15 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144446 resets) in 612 ms. (1631 steps per ms)
BEST_FIRST walk for 1000001 steps (91634 resets) in 440 ms. (2267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:22:12] [INFO ] Invariant cache hit.
[2024-05-31 22:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:12] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 22:22:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:22:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:12] [INFO ] [Real]Added 14 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:22:12] [INFO ] Computed and/alt/rep : 80/463/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:12] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:12] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:22:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:22:12] [INFO ] Computed and/alt/rep : 80/463/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:22:13] [INFO ] Added : 75 causal constraints over 16 iterations in 234 ms. Result :sat
Minimization took 97 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 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 86/86 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-31 22:22:13] [INFO ] Invariant cache hit.
[2024-05-31 22:22:13] [INFO ] Implicit Places using invariants in 62 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 83
Applied a total of 2 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 84 cols
[2024-05-31 22:22:13] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:22:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:22:13] [INFO ] Invariant cache hit.
[2024-05-31 22:22:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:13] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 83/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 318 ms. Remains : 84/86 places, 83/84 transitions.
[2024-05-31 22:22:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144210 resets) in 589 ms. (1694 steps per ms)
BEST_FIRST walk for 1000000 steps (91495 resets) in 434 ms. (2298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:22:14] [INFO ] Invariant cache hit.
[2024-05-31 22:22:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 22:22:14] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:22:14] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:14] [INFO ] [Real]Added 14 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:22:14] [INFO ] Computed and/alt/rep : 79/458/79 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:22:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:14] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:22:14] [INFO ] [Nat]Added 14 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:22:14] [INFO ] Computed and/alt/rep : 79/458/79 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-31 22:22:15] [INFO ] Added : 71 causal constraints over 15 iterations in 293 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-31 22:22:15] [INFO ] Invariant cache hit.
[2024-05-31 22:22:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 22:22:15] [INFO ] Invariant cache hit.
[2024-05-31 22:22:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:15] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-31 22:22:15] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-31 22:22:15] [INFO ] Invariant cache hit.
[2024-05-31 22:22:15] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 116 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 82/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 202 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3521 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints]
After SMT, in 5294ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 5295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5560 ms. Remains : 84/84 places, 83/83 transitions.
RANDOM walk for 40000 steps (5811 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3673 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 740410 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 2
Probabilistic random walk after 740410 steps, saw 370291 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2024-05-31 22:22:23] [INFO ] Invariant cache hit.
[2024-05-31 22:22:23] [INFO ] State equation strengthened by 14 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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/163 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/163 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/167 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 83/83 transitions.
RANDOM walk for 40000 steps (5697 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3674 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3701 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 725296 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 725296 steps, saw 362732 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2024-05-31 22:22:27] [INFO ] Invariant cache hit.
[2024-05-31 22:22:27] [INFO ] State equation strengthened by 14 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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/163 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/163 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/167 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-31 22:22:28] [INFO ] Invariant cache hit.
[2024-05-31 22:22:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 22:22:28] [INFO ] Invariant cache hit.
[2024-05-31 22:22:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:28] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-31 22:22:28] [INFO ] Redundant transitions in 0 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-31 22:22:28] [INFO ] Invariant cache hit.
[2024-05-31 22:22:28] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 116 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1746 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/102 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 82/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 202 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints]
After SMT, in 5183ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 5184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5419 ms. Remains : 84/84 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 71
Applied a total of 24 rules in 9 ms. Remains 72 /84 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 71 rows 72 cols
[2024-05-31 22:22:33] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:22:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:33] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:22:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:22:33] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:22:33] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:22:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:33] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:22:33] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:22:33] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:22:33] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 137 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-05 in 22659 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-08
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 95 rows 99 cols
[2024-05-31 22:22:33] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1442 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10000 steps (897 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:22:33] [INFO ] Invariant cache hit.
[2024-05-31 22:22:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:22:33] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:22:33] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:22:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:22:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 22:22:33] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-05-31 22:22:34] [INFO ] Added : 89 causal constraints over 18 iterations in 406 ms. Result :sat
Minimization took 106 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 99 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p174) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 93/93 transitions.
Graph (complete) has 331 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 94 transition count 89
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 307 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 91 transition count 86
Reduce places removed 3 places and 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 88 transition count 83
Reduce places removed 3 places and 3 transitions.
Graph (complete) has 283 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 17 place count 84 transition count 79
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 275 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 21 place count 80 transition count 76
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 262 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 24 place count 77 transition count 74
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 25 place count 76 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 26 place count 75 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 27 place count 74 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 27 place count 74 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 32 place count 71 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 36 place count 69 transition count 65
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 39 place count 69 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 42 place count 66 transition count 62
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 45 place count 66 transition count 62
Applied a total of 45 rules in 12 ms. Remains 66 /99 variables (removed 33) and now considering 62/93 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 66/99 places, 62/93 transitions.
// Phase 1: matrix 62 rows 66 cols
[2024-05-31 22:22:34] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144395 resets) in 565 ms. (1766 steps per ms)
BEST_FIRST walk for 1000000 steps (91139 resets) in 415 ms. (2403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:22:35] [INFO ] Invariant cache hit.
[2024-05-31 22:22:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 22:22:35] [INFO ] [Real]Absence check using 3 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-31 22:22:35] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 22:22:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:22:35] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:22:35] [INFO ] Computed and/alt/rep : 60/324/60 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-31 22:22:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:22:35] [INFO ] [Nat]Absence check using 3 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:35] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:22:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:22:35] [INFO ] Computed and/alt/rep : 60/324/60 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-31 22:22:35] [INFO ] Added : 60 causal constraints over 12 iterations in 140 ms. Result :sat
Minimization took 51 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 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 66/66 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-31 22:22:35] [INFO ] Invariant cache hit.
[2024-05-31 22:22:35] [INFO ] Implicit Places using invariants in 49 ms returned [13, 20]
[2024-05-31 22:22:35] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/66 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 61
Applied a total of 2 rules in 2 ms. Remains 64 /65 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 64 cols
[2024-05-31 22:22:35] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 22:22:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 22:22:35] [INFO ] Invariant cache hit.
[2024-05-31 22:22:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:22:36] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/66 places, 61/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 196 ms. Remains : 63/66 places, 61/62 transitions.
// Phase 1: matrix 61 rows 63 cols
[2024-05-31 22:22:36] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144294 resets) in 566 ms. (1763 steps per ms)
BEST_FIRST walk for 1000000 steps (91313 resets) in 415 ms. (2403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:22:37] [INFO ] Invariant cache hit.
[2024-05-31 22:22:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:37] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:22:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:22:37] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:22:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:37] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:22:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-31 22:22:37] [INFO ] Computed and/alt/rep : 59/315/59 causal constraints (skipped 1 transitions) in 2 ms.
[2024-05-31 22:22:37] [INFO ] Added : 53 causal constraints over 11 iterations in 87 ms. Result :sat
Minimization took 44 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 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-31 22:22:37] [INFO ] Invariant cache hit.
[2024-05-31 22:22:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 22:22:37] [INFO ] Invariant cache hit.
[2024-05-31 22:22:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:22:37] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-31 22:22:37] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 22:22:37] [INFO ] Invariant cache hit.
[2024-05-31 22:22:37] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 147 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
After SMT, in 2471ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2638 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5819 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3661 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3593 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 822610 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 2
Probabilistic random walk after 822610 steps, saw 411490 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-31 22:22:42] [INFO ] Invariant cache hit.
[2024-05-31 22:22:42] [INFO ] State equation strengthened by 10 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) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:22:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 219ms 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 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 63/63 places, 61/61 transitions.
RANDOM walk for 40000 steps (5770 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3660 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3690 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 817346 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 2
Probabilistic random walk after 817346 steps, saw 408856 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-05-31 22:22:46] [INFO ] Invariant cache hit.
[2024-05-31 22:22:46] [INFO ] State equation strengthened by 10 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) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/124 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/124 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/59 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/124 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/124 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 63/63 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 61/61 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-31 22:22:46] [INFO ] Invariant cache hit.
[2024-05-31 22:22:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 22:22:46] [INFO ] Invariant cache hit.
[2024-05-31 22:22:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:22:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-31 22:22:46] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-31 22:22:46] [INFO ] Invariant cache hit.
[2024-05-31 22:22:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 84 constraints, problems are : Problem set: 0 solved, 60 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 2/63 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/124 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 60/144 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:22:48] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:22:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:22:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 147 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints]
After SMT, in 2453ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2607 ms. Remains : 63/63 places, 61/61 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 63 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 58 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 56 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 56 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 55 transition count 53
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 55 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 52
Applied a total of 18 rules in 7 ms. Remains 54 /63 variables (removed 9) and now considering 52/61 (removed 9) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 54 cols
[2024-05-31 22:22:49] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:49] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:22:49] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:22:49] [INFO ] After 16ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-31 22:22:49] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 82 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-08 in 15637 ms.
Starting property specific reduction for DoubleExponent-PT-004-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 95 rows 99 cols
[2024-05-31 22:22:49] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1450 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (887 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:22:49] [INFO ] Invariant cache hit.
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:22:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:22:49] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-31 22:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:22:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-31 22:22:49] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:22:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:22:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:22:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2024-05-31 22:22:49] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:22:49] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 22:22:49] [INFO ] Added : 74 causal constraints over 15 iterations in 225 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 96 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 96 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 95 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 90 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 90 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 87 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 87 transition count 84
Applied a total of 25 rules in 9 ms. Remains 87 /99 variables (removed 12) and now considering 84/95 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 87/99 places, 84/95 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 12=1, 22=1, 33=1, 39=1, 57=1, 60=1, 63=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 84 rows 87 cols
[2024-05-31 22:22:50] [INFO ] Computed 15 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (143677 resets) in 601 ms. (1661 steps per ms)
BEST_FIRST walk for 1000001 steps (91399 resets) in 430 ms. (2320 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:22:51] [INFO ] Invariant cache hit.
[2024-05-31 22:22:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 22:22:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:51] [INFO ] [Real]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-31 22:22:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 22:22:51] [INFO ] [Nat]Added 14 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-31 22:22:51] [INFO ] Computed and/alt/rep : 80/447/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:22:51] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:22:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 528 ms
[2024-05-31 22:22:52] [INFO ] Added : 79 causal constraints over 17 iterations in 782 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-31 22:22:52] [INFO ] Invariant cache hit.
[2024-05-31 22:22:52] [INFO ] Implicit Places using invariants in 58 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 83
Applied a total of 2 rules in 3 ms. Remains 85 /86 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 85 cols
[2024-05-31 22:22:52] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:22:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 22:22:52] [INFO ] Invariant cache hit.
[2024-05-31 22:22:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:52] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 282 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 3 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-31 22:22:52] [INFO ] Computed 13 invariants in 4 ms
[2024-05-31 22:22:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 22:22:52] [INFO ] Invariant cache hit.
[2024-05-31 22:22:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:52] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/87 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 568 ms. Remains : 82/87 places, 81/84 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 11=1, 12=1, 15=1, 19=1, 28=1, 33=1, 38=1, 48=1, 50=1, 52=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:22:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144293 resets) in 589 ms. (1694 steps per ms)
BEST_FIRST walk for 1000000 steps (91511 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 22:22:54] [INFO ] Invariant cache hit.
[2024-05-31 22:22:54] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:22:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:54] [INFO ] [Real]Added 14 Read/Feed constraints in 12 ms returned sat
[2024-05-31 22:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:22:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 22:22:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-31 22:22:54] [INFO ] Computed and/alt/rep : 75/416/75 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 234 ms
[2024-05-31 22:22:54] [INFO ] Added : 61 causal constraints over 14 iterations in 373 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-31 22:22:55] [INFO ] Invariant cache hit.
[2024-05-31 22:22:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:22:55] [INFO ] Invariant cache hit.
[2024-05-31 22:22:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:22:55] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-31 22:22:55] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 22:22:55] [INFO ] Invariant cache hit.
[2024-05-31 22:22:55] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 194 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 5976ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5977ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6205 ms. Remains : 82/82 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 11=1, 12=1, 15=1, 19=1, 28=1, 33=1, 38=1, 48=1, 50=1, 52=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 19=1, 30=1, 36=1, 52=1, 55=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5839 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3614 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1416152 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 1416152 steps, saw 708086 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
[2024-05-31 22:23:04] [INFO ] Invariant cache hit.
[2024-05-31 22:23:04] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:23:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 82/82 places, 81/81 transitions.
RANDOM walk for 40000 steps (5759 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1410567 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :0 out of 1
Probabilistic random walk after 1410567 steps, saw 705294 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
[2024-05-31 22:23:08] [INFO ] Invariant cache hit.
[2024-05-31 22:23:08] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/64 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/82 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/158 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/64 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/82 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/158 variables, 73/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-31 22:23:08] [INFO ] Invariant cache hit.
[2024-05-31 22:23:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 22:23:08] [INFO ] Invariant cache hit.
[2024-05-31 22:23:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-31 22:23:08] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-31 22:23:08] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 22:23:08] [INFO ] Invariant cache hit.
[2024-05-31 22:23:08] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:23:10] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 194 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 5955ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5957ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6188 ms. Remains : 82/82 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 72 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 69
Applied a total of 24 rules in 8 ms. Remains 70 /82 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 70 cols
[2024-05-31 22:23:14] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 22:23:14] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:23:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:23:14] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-31 22:23:14] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:23:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:23:14] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:23:14] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:23:14] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:23:14] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-31 22:23:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 160 ms
TRAPS : Iteration 1
[2024-05-31 22:23:14] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:23:14] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 257 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-12 in 25343 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-13
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 95 rows 99 cols
[2024-05-31 22:23:14] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1448 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (911 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:23:14] [INFO ] Invariant cache hit.
[2024-05-31 22:23:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:23:14] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-31 22:23:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 22:23:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 22:23:14] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-31 22:23:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:23:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:23:14] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-31 22:23:14] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 22:23:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-31 22:23:14] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 22:23:15] [INFO ] Added : 92 causal constraints over 20 iterations in 337 ms. Result :sat
Minimization took 96 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 99 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p204) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Graph (complete) has 331 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 95 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 93 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 93 transition count 89
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 14 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 18 place count 83 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 80 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 77 transition count 72
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 77 transition count 68
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 35 place count 73 transition count 68
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 73 transition count 68
Applied a total of 38 rules in 10 ms. Remains 73 /99 variables (removed 26) and now considering 68/94 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 73/99 places, 68/94 transitions.
// Phase 1: matrix 68 rows 73 cols
[2024-05-31 22:23:15] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144503 resets) in 591 ms. (1689 steps per ms)
BEST_FIRST walk for 1000001 steps (91367 resets) in 420 ms. (2375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:23:16] [INFO ] Invariant cache hit.
[2024-05-31 22:23:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:23:16] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2024-05-31 22:23:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 22:23:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:23:16] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:23:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:23:16] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-31 22:23:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 22:23:16] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:23:16] [INFO ] Computed and/alt/rep : 66/356/66 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-31 22:23:16] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-31 22:23:16] [INFO ] Added : 63 causal constraints over 14 iterations in 191 ms. Result :sat
Minimization took 53 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 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 73/73 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-31 22:23:16] [INFO ] Invariant cache hit.
[2024-05-31 22:23:16] [INFO ] Implicit Places using invariants in 51 ms returned [13, 20]
[2024-05-31 22:23:16] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/73 places, 68/68 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 67
Applied a total of 2 rules in 2 ms. Remains 71 /72 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 71 cols
[2024-05-31 22:23:16] [INFO ] Computed 12 invariants in 0 ms
[2024-05-31 22:23:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 22:23:16] [INFO ] Invariant cache hit.
[2024-05-31 22:23:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:23:17] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/73 places, 67/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 215 ms. Remains : 70/73 places, 67/68 transitions.
// Phase 1: matrix 67 rows 70 cols
[2024-05-31 22:23:17] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144366 resets) in 590 ms. (1692 steps per ms)
BEST_FIRST walk for 1000000 steps (91401 resets) in 420 ms. (2375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 22:23:18] [INFO ] Invariant cache hit.
[2024-05-31 22:23:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:23:18] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:23:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:23:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:23:18] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2024-05-31 22:23:18] [INFO ] Computed and/alt/rep : 65/347/65 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-31 22:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:23:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-31 22:23:18] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-31 22:23:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 22:23:18] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2024-05-31 22:23:18] [INFO ] Computed and/alt/rep : 65/347/65 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 22:23:18] [INFO ] Added : 59 causal constraints over 13 iterations in 187 ms. Result :sat
Minimization took 48 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 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 70/70 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-05-31 22:23:18] [INFO ] Invariant cache hit.
[2024-05-31 22:23:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 22:23:18] [INFO ] Invariant cache hit.
[2024-05-31 22:23:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:23:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-31 22:23:18] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-31 22:23:18] [INFO ] Invariant cache hit.
[2024-05-31 22:23:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 66/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 159 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2703ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2705ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2879 ms. Remains : 70/70 places, 67/67 transitions.
RANDOM walk for 40000 steps (5731 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3645 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 800644 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 800644 steps, saw 400499 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-31 22:23:24] [INFO ] Invariant cache hit.
[2024-05-31 22:23:24] [INFO ] State equation strengthened by 12 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) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/137 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 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) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/137 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 70/70 places, 67/67 transitions.
RANDOM walk for 40000 steps (5773 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3710 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 734393 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 2
Probabilistic random walk after 734393 steps, saw 367355 distinct states, run finished after 3002 ms. (steps per millisecond=244 ) properties seen :0
[2024-05-31 22:23:27] [INFO ] Invariant cache hit.
[2024-05-31 22:23:27] [INFO ] State equation strengthened by 12 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) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/137 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 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) 46/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/63 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 66/129 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/137 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 70/70 places, 67/67 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2024-05-31 22:23:27] [INFO ] Invariant cache hit.
[2024-05-31 22:23:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:23:28] [INFO ] Invariant cache hit.
[2024-05-31 22:23:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:23:28] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-31 22:23:28] [INFO ] Redundant transitions in 0 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-31 22:23:28] [INFO ] Invariant cache hit.
[2024-05-31 22:23:28] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 93 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/137 variables, 70/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 66/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 159 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1393 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2620ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2810 ms. Remains : 70/70 places, 67/67 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 70 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 63 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 63 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 61 transition count 58
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 57
Applied a total of 20 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 57/67 (removed 10) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 57 rows 60 cols
[2024-05-31 22:23:30] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 22:23:30] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:23:30] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:23:30] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-31 22:23:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:23:30] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:23:30] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 22:23:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:23:30] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-31 22:23:30] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 22:23:30] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 22:23:30] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 22:23:30] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 131 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-13 in 16149 ms.
[2024-05-31 22:23:31] [INFO ] Flatten gal took : 34 ms
[2024-05-31 22:23:31] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 22:23:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 95 transitions and 431 arcs took 4 ms.
Total runtime 293790 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 : DoubleExponent-PT-004-UpperBounds-00
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-01
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-02
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-04
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-05
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-08
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-12
Could not compute solution for formula : DoubleExponent-PT-004-UpperBounds-13

BK_STOP 1717194211410

--------------------
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 DoubleExponent-PT-004-UpperBounds-00
ub formula formula --maxsum=/tmp/2787/ub_0_
ub formula name DoubleExponent-PT-004-UpperBounds-01
ub formula formula --maxsum=/tmp/2787/ub_1_
ub formula name DoubleExponent-PT-004-UpperBounds-02
ub formula formula --maxsum=/tmp/2787/ub_2_
ub formula name DoubleExponent-PT-004-UpperBounds-04
ub formula formula --maxsum=/tmp/2787/ub_3_
ub formula name DoubleExponent-PT-004-UpperBounds-05
ub formula formula --maxsum=/tmp/2787/ub_4_
ub formula name DoubleExponent-PT-004-UpperBounds-08
ub formula formula --maxsum=/tmp/2787/ub_5_
ub formula name DoubleExponent-PT-004-UpperBounds-12
ub formula formula --maxsum=/tmp/2787/ub_6_
ub formula name DoubleExponent-PT-004-UpperBounds-13
ub formula formula --maxsum=/tmp/2787/ub_7_
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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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 r488-tall-171631132900549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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