Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r083-tall-174860079700061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 67K May 29 14:32 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

echo here is the order used to build the result vector(from xml 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 1748730997078

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:36:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 22:36:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:36:38] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2025-05-31 22:36:38] [INFO ] Transformed 216 places.
[2025-05-31 22:36:38] [INFO ] Transformed 198 transitions.
[2025-05-31 22:36:38] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 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, +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, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 198 rows 216 cols
[2025-05-31 22:36:38] [INFO ] Computed 24 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 3, 1, 4, 1, +inf, 1, 4, +inf, 1, 3, 1]
RANDOM walk for 10000 steps (326 resets) in 42 ms. (232 steps per ms)
FORMULA DoubleExponent-PT-004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130000 steps (3682 resets) in 191 ms. (677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, +inf, 3, 1, 4, 1, +inf, 1, 4, +inf, 1, 3, 1]
[2025-05-31 22:36:38] [INFO ] Invariant cache hit.
[2025-05-31 22:36:39] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-05-31 22:36:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2025-05-31 22:36:39] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 10 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 22:36:39] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:39] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 2 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:36:39] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 2 ms to minimize.
[2025-05-31 22:36:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 966 ms
[2025-05-31 22:36:40] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2025-05-31 22:36:41] [INFO ] Added : 190 causal constraints over 39 iterations in 931 ms. Result :sat
Minimization took 227 ms.
[2025-05-31 22:36:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:41] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-05-31 22:36:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 22:36:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:41] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-31 22:36:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 21 ms.
[2025-05-31 22:36:42] [INFO ] Added : 115 causal constraints over 24 iterations in 467 ms. Result :sat
Minimization took 181 ms.
[2025-05-31 22:36:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:42] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 3 ms returned unsat
[2025-05-31 22:36:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 22:36:42] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:42] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-31 22:36:42] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:36:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:42] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:42] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-31 22:36:42] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 2 ms to minimize.
[2025-05-31 22:36:43] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2025-05-31 22:36:43] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:36:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2025-05-31 22:36:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2025-05-31 22:36:43] [INFO ] Added : 105 causal constraints over 21 iterations in 370 ms. Result :sat
Minimization took 173 ms.
[2025-05-31 22:36:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:43] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned unsat
[2025-05-31 22:36:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:43] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:43] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-31 22:36:43] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2025-05-31 22:36:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:44] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:44] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-31 22:36:44] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 2 ms to minimize.
[2025-05-31 22:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-05-31 22:36:44] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 18 ms.
[2025-05-31 22:36:44] [INFO ] Added : 150 causal constraints over 30 iterations in 578 ms. Result :sat
Minimization took 191 ms.
[2025-05-31 22:36:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:45] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:45] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-05-31 22:36:45] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:36:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:45] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:45] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-31 22:36:45] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 22:36:45] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2025-05-31 22:36:45] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:36:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2025-05-31 22:36:46] [INFO ] Added : 138 causal constraints over 28 iterations in 910 ms. Result :sat
Minimization took 193 ms.
[2025-05-31 22:36:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:46] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:46] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-31 22:36:46] [INFO ] Deduced a trap composed of 109 places in 70 ms of which 1 ms to minimize.
[2025-05-31 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:46] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:46] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-31 22:36:46] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2025-05-31 22:36:46] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:36:46] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:36:47] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:36:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 307 ms
[2025-05-31 22:36:47] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:36:47] [INFO ] Added : 191 causal constraints over 39 iterations in 733 ms. Result :sat
Minimization took 202 ms.
[2025-05-31 22:36:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned unsat
[2025-05-31 22:36:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:48] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 2 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:48] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:48] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 9 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 4 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2025-05-31 22:36:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 526 ms
[2025-05-31 22:36:48] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 13 ms.
[2025-05-31 22:36:49] [INFO ] Added : 194 causal constraints over 40 iterations in 819 ms. Result :sat
Minimization took 218 ms.
[2025-05-31 22:36:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:50] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-31 22:36:50] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:50] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-31 22:36:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2025-05-31 22:36:51] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:36:51] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:36:51] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:36:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 202 ms
[2025-05-31 22:36:51] [INFO ] Added : 192 causal constraints over 40 iterations in 1017 ms. Result :sat
Minimization took 219 ms.
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 3 ms returned unsat
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-31 22:36:51] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 2 ms to minimize.
[2025-05-31 22:36:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-05-31 22:36:51] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2025-05-31 22:36:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-05-31 22:36:51] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2025-05-31 22:36:52] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2025-05-31 22:36:52] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:36:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2025-05-31 22:36:52] [INFO ] Added : 183 causal constraints over 37 iterations in 830 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0] Max Struct:[+inf, +inf, 1, 1, 1, 1, +inf, 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
FORMULA DoubleExponent-PT-004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Support contains 9 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 211 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 210 transition count 157
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 171 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 169 transition count 155
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 86 place count 169 transition count 147
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 102 place count 161 transition count 147
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 178 place count 123 transition count 109
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 118 transition count 109
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 206 place count 118 transition count 91
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 224 place count 100 transition count 91
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 239 place count 100 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 99 transition count 90
Applied a total of 240 rules in 100 ms. Remains 99 /216 variables (removed 117) and now considering 90/198 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 99/216 places, 90/198 transitions.
Found an invariant !
This invariant on transitions {13=1, 14=1, 15=1, 35=1, 36=1, 49=1, 60=1, 77=1, 86=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1, 14=1, 15=1, 35=1, 36=1, 49=1, 60=1, 77=1, 86=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :[0, 0, 0, 0, 4, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
// Phase 1: matrix 90 rows 99 cols
[2025-05-31 22:36:55] [INFO ] Computed 20 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (128180 resets) in 774 ms. (1290 steps per ms)
BEST_FIRST walk for 9000007 steps (762958 resets) in 4351 ms. (2068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
[2025-05-31 22:37:00] [INFO ] Invariant cache hit.
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-05-31 22:37:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:00] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2025-05-31 22:37:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:37:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2025-05-31 22:37:00] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 9 ms.
[2025-05-31 22:37:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:37:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2025-05-31 22:37:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:37:00] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 445 ms
[2025-05-31 22:37:01] [INFO ] Added : 85 causal constraints over 18 iterations in 700 ms. Result :sat
Minimization took 122 ms.
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 20 ms returned sat
[2025-05-31 22:37:01] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 9 ms.
[2025-05-31 22:37:01] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-05-31 22:37:01] [INFO ] Added : 59 causal constraints over 12 iterations in 214 ms. Result :sat
Minimization took 103 ms.
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:01] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-05-31 22:37:02] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 8 ms.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-05-31 22:37:02] [INFO ] Added : 40 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 68 ms.
[2025-05-31 22:37:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:02] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:02] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 4 ms.
[2025-05-31 22:37:02] [INFO ] Added : 42 causal constraints over 9 iterations in 101 ms. Result :sat
Minimization took 68 ms.
[2025-05-31 22:37:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Real]Added 11 Read/Feed constraints in 20 ms returned sat
[2025-05-31 22:37:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:02] [INFO ] [Nat]Added 11 Read/Feed constraints in 20 ms returned sat
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:37:02] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 327 ms
[2025-05-31 22:37:03] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:03] [INFO ] Added : 26 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 73 ms.
[2025-05-31 22:37:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2025-05-31 22:37:03] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 8 ms.
[2025-05-31 22:37:03] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:37:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-05-31 22:37:03] [INFO ] Added : 78 causal constraints over 16 iterations in 275 ms. Result :sat
Minimization took 123 ms.
[2025-05-31 22:37:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:03] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 4 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2025-05-31 22:37:04] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 9 ms.
[2025-05-31 22:37:04] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2025-05-31 22:37:04] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:37:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2025-05-31 22:37:04] [INFO ] Added : 85 causal constraints over 18 iterations in 401 ms. Result :sat
Minimization took 146 ms.
[2025-05-31 22:37:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 3 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:37:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2025-05-31 22:37:04] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 8 ms.
[2025-05-31 22:37:05] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:37:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-05-31 22:37:05] [INFO ] Added : 86 causal constraints over 18 iterations in 343 ms. Result :sat
Minimization took 104 ms.
[2025-05-31 22:37:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:05] [INFO ] [Real]Absence check using 4 positive and 16 generalized place invariants in 8 ms returned sat
[2025-05-31 22:37:05] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:37:05] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2025-05-31 22:37:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-31 22:37:05] [INFO ] [Nat]Absence check using 4 positive and 16 generalized place invariants in 6 ms returned sat
[2025-05-31 22:37:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2025-05-31 22:37:05] [INFO ] Computed and/alt/rep : 86/411/86 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:05] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:37:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-31 22:37:05] [INFO ] Added : 60 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 99/99 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-05-31 22:37:06] [INFO ] Invariant cache hit.
[2025-05-31 22:37:06] [INFO ] Implicit Places using invariants in 87 ms returned [20, 27, 43, 48, 63, 68, 87, 96]
[2025-05-31 22:37:06] [INFO ] Actually due to overlaps returned [68, 63]
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 : 97/99 places, 90/90 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 89
Applied a total of 2 rules in 9 ms. Remains 96 /97 variables (removed 1) and now considering 89/90 (removed 1) transitions.
// Phase 1: matrix 89 rows 96 cols
[2025-05-31 22:37:06] [INFO ] Computed 18 invariants in 2 ms
[2025-05-31 22:37:06] [INFO ] Implicit Places using invariants in 71 ms returned [20, 27, 43, 48, 84, 93]
[2025-05-31 22:37:06] [INFO ] Actually due to overlaps returned [93, 84]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 94/99 places, 89/90 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 94 transition count 89
Applied a total of 1 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 94 cols
[2025-05-31 22:37:06] [INFO ] Computed 16 invariants in 2 ms
[2025-05-31 22:37:06] [INFO ] Implicit Places using invariants in 67 ms returned [20, 27, 43, 48]
[2025-05-31 22:37:06] [INFO ] Actually due to overlaps returned [20, 27]
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 3 : 92/99 places, 89/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 259 ms. Remains : 92/99 places, 89/90 transitions.
Found an invariant !
This invariant on transitions {13=1, 14=1, 34=1, 45=1, 56=1, 73=1, 82=1, 86=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1, 14=1, 34=1, 45=1, 56=1, 73=1, 82=1, 86=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :[0, 0, 0, 0, 3, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
// Phase 1: matrix 89 rows 92 cols
[2025-05-31 22:37:07] [INFO ] Computed 14 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144354 resets) in 636 ms. (1569 steps per ms)
BEST_FIRST walk for 9000002 steps (823419 resets) in 3931 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
[2025-05-31 22:37:11] [INFO ] Invariant cache hit.
[2025-05-31 22:37:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:11] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:37:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:11] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:11] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:11] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:11] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:11] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:11] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:37:12] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:37:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2025-05-31 22:37:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2025-05-31 22:37:12] [INFO ] Added : 56 causal constraints over 12 iterations in 274 ms. Result :sat
Minimization took 68 ms.
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Added 11 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:37:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:12] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 6 ms.
[2025-05-31 22:37:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-05-31 22:37:12] [INFO ] Added : 83 causal constraints over 17 iterations in 320 ms. Result :sat
Minimization took 68 ms.
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:12] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 5 ms.
[2025-05-31 22:37:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:12] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:13] [INFO ] Added : 83 causal constraints over 17 iterations in 243 ms. Result :sat
Minimization took 80 ms.
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2025-05-31 22:37:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:37:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2025-05-31 22:37:13] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:13] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:37:13] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:37:13] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:37:13] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:37:13] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:37:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 256 ms
[2025-05-31 22:37:13] [INFO ] Added : 74 causal constraints over 15 iterations in 446 ms. Result :sat
Minimization took 91 ms.
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:37:13] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 19 ms returned sat
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:37:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 335 ms
[2025-05-31 22:37:14] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:14] [INFO ] Added : 33 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 77 ms.
[2025-05-31 22:37:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:14] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 6 ms.
[2025-05-31 22:37:14] [INFO ] Added : 84 causal constraints over 18 iterations in 292 ms. Result :sat
Minimization took 114 ms.
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Nat]Added 11 Read/Feed constraints in 25 ms returned sat
[2025-05-31 22:37:15] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 6 ms.
[2025-05-31 22:37:15] [INFO ] Added : 57 causal constraints over 12 iterations in 119 ms. Result :sat
Minimization took 99 ms.
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2025-05-31 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 22:37:15] [INFO ] [Nat]Added 11 Read/Feed constraints in 16 ms returned sat
[2025-05-31 22:37:15] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 6 ms.
[2025-05-31 22:37:15] [INFO ] Added : 85 causal constraints over 19 iterations in 325 ms. Result :sat
Minimization took 100 ms.
[2025-05-31 22:37:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Real]Added 11 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:37:16] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:16] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2025-05-31 22:37:16] [INFO ] Computed and/alt/rep : 85/393/85 causal constraints (skipped 3 transitions) in 7 ms.
[2025-05-31 22:37:16] [INFO ] Added : 59 causal constraints over 12 iterations in 130 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Support contains 9 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 89/89 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2025-05-31 22:37:16] [INFO ] Invariant cache hit.
[2025-05-31 22:37:16] [INFO ] Implicit Places using invariants in 103 ms returned [41, 46]
[2025-05-31 22:37:16] [INFO ] Actually due to overlaps returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/92 places, 89/89 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 88
Applied a total of 2 rules in 5 ms. Remains 90 /91 variables (removed 1) and now considering 88/89 (removed 1) transitions.
// Phase 1: matrix 88 rows 90 cols
[2025-05-31 22:37:16] [INFO ] Computed 13 invariants in 2 ms
[2025-05-31 22:37:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 22:37:17] [INFO ] Invariant cache hit.
[2025-05-31 22:37:17] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:17] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/92 places, 88/89 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 351 ms. Remains : 90/92 places, 88/89 transitions.
Found an invariant !
This invariant on transitions {13=1, 14=1, 34=1, 45=1, 56=1, 73=1, 81=1, 85=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1, 14=1, 34=1, 45=1, 56=1, 73=1, 81=1, 85=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1469 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
[2025-05-31 22:37:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144131 resets) in 644 ms. (1550 steps per ms)
BEST_FIRST walk for 9000003 steps (823234 resets) in 4045 ms. (2224 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
[2025-05-31 22:37:22] [INFO ] Invariant cache hit.
[2025-05-31 22:37:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:22] [INFO ] [Real]Added 11 Read/Feed constraints in 15 ms returned sat
[2025-05-31 22:37:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2025-05-31 22:37:22] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 7 ms.
[2025-05-31 22:37:22] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:37:22] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:37:22] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:37:22] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:37:22] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:37:22] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2025-05-31 22:37:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 321 ms
[2025-05-31 22:37:22] [INFO ] Added : 77 causal constraints over 16 iterations in 521 ms. Result :sat
Minimization took 74 ms.
[2025-05-31 22:37:22] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:22] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2025-05-31 22:37:23] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 7 ms.
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:37:23] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:37:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 345 ms
[2025-05-31 22:37:23] [INFO ] Added : 82 causal constraints over 17 iterations in 609 ms. Result :sat
Minimization took 84 ms.
[2025-05-31 22:37:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:23] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 6 ms.
[2025-05-31 22:37:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:23] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 6 ms.
[2025-05-31 22:37:24] [INFO ] Added : 61 causal constraints over 13 iterations in 145 ms. Result :sat
Minimization took 64 ms.
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2025-05-31 22:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-05-31 22:37:24] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 5 ms.
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 192 ms
[2025-05-31 22:37:24] [INFO ] Added : 65 causal constraints over 13 iterations in 358 ms. Result :sat
Minimization took 65 ms.
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:24] [INFO ] [Nat]Added 11 Read/Feed constraints in 16 ms returned sat
[2025-05-31 22:37:24] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 277 ms
[2025-05-31 22:37:25] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 8 ms.
[2025-05-31 22:37:25] [INFO ] Added : 36 causal constraints over 9 iterations in 106 ms. Result :sat
Minimization took 48 ms.
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:25] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 5 ms.
[2025-05-31 22:37:25] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-05-31 22:37:25] [INFO ] Added : 85 causal constraints over 18 iterations in 301 ms. Result :sat
Minimization took 80 ms.
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:25] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2025-05-31 22:37:26] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 5 ms.
[2025-05-31 22:37:26] [INFO ] Added : 84 causal constraints over 18 iterations in 266 ms. Result :sat
Minimization took 82 ms.
[2025-05-31 22:37:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2025-05-31 22:37:26] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 6 ms.
[2025-05-31 22:37:26] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2025-05-31 22:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-05-31 22:37:26] [INFO ] Added : 68 causal constraints over 14 iterations in 217 ms. Result :sat
Minimization took 64 ms.
[2025-05-31 22:37:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Real]Added 11 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:37:26] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:26] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2025-05-31 22:37:27] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:37:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-31 22:37:27] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 4 ms.
[2025-05-31 22:37:27] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:37:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-05-31 22:37:27] [INFO ] Added : 61 causal constraints over 13 iterations in 196 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-05-31 22:37:27] [INFO ] Invariant cache hit.
[2025-05-31 22:37:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-31 22:37:27] [INFO ] Invariant cache hit.
[2025-05-31 22:37:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:27] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2025-05-31 22:37:27] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2025-05-31 22:37:27] [INFO ] Invariant cache hit.
[2025-05-31 22:37:27] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-05-31 22:37:28] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 88/177 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/178 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 115 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 90/90 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 88/177 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 83/197 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2025-05-31 22:37:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:37:31] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 1/178 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/178 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 15 (OVERLAPS) 0/178 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 204 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4690 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 90/90 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
After SMT, in 7293ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7546 ms. Remains : 90/90 places, 88/88 transitions.
Found an invariant !
This invariant on transitions {13=1, 14=1, 34=1, 45=1, 56=1, 73=1, 81=1, 85=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1, 14=1, 34=1, 45=1, 56=1, 73=1, 81=1, 85=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :[0, 0, 0, 0, 1, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, +inf, 1, 1]
[2025-05-31 22:37:35] [INFO ] Flatten gal took : 62 ms
[2025-05-31 22:37:35] [INFO ] Flatten gal took : 16 ms
[2025-05-31 22:37:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14231756136843344926.gal : 7 ms
[2025-05-31 22:37:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1651291603527623229.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14231756136843344926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1651291603527623229.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1651291603527623229.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :42 after 91
Invariant property MIN8 does not hold.
Reachability property MAX8 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :91 after 269
Invariant property MIN4 does not hold.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :269 after 494
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :494 after 673
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :673 after 1190
RANDOM walk for 40000 steps (5792 resets) in 1413 ms. (28 steps per ms) remains 14/14 properties
Invariant property MIN1 does not hold.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1190 after 12131
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :12131 after 45259
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :45259 after 106234
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :106234 after 183742
BEST_FIRST walk for 40003 steps (3627 resets) in 524 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3726 resets) in 233 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3691 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3685 resets) in 199 ms. (200 steps per ms) remains 14/14 properties
SDD proceeding with computation,4 properties remain. new max is 8192
BEST_FIRST walk for 40001 steps (3672 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
SDD size :183742 after 328497
BEST_FIRST walk for 40000 steps (3671 resets) in 202 ms. (197 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3654 resets) in 233 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (3677 resets) in 190 ms. (209 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3651 resets) in 209 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3703 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :328497 after 642486
BEST_FIRST walk for 40002 steps (3635 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3696 resets) in 124 ms. (320 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3656 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN6 does not hold.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.88675e+07,1.46695,46688,2,49806,32,174719,6,0,447,125825,0
Total reachable state count : 58867492

Verifying 14 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,1.47019,46688,2,91,32,174719,7,0,450,125825,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,3,1.4723,46688,2,95,32,174719,8,0,452,125825,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,1.47262,46688,2,91,32,174719,9,0,454,125825,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1,1.47286,46688,2,91,32,174719,10,0,455,125825,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1,1.47318,46688,2,91,32,174719,11,0,457,125825,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1,1.47344,46688,2,91,32,174719,12,0,458,125825,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,12,1.47367,46688,2,173,32,174719,13,0,460,125825,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,1,1.4744,46688,2,91,32,174719,14,0,462,125825,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,1,1.47513,46688,2,91,32,174719,15,0,463,125825,0
Invariant property MIN6 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,31,1.47542,46688,2,391,32,174719,16,0,465,125825,0
Reachability property MAX7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,1,1.4764,46688,2,91,32,174719,17,0,467,125825,0
Invariant property MIN7 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,1,1.47737,46688,2,91,32,174719,18,0,468,125825,0
Reachability property MAX8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,1,1.47785,46688,2,91,32,174719,19,0,470,125825,0
Invariant property MIN8 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,1,1.47818,46688,2,91,32,174719,20,0,471,125825,0
Interrupted probabilistic random walk after 355253 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :10 out of 14
Probabilistic random walk after 355253 steps, saw 177722 distinct states, run finished after 3004 ms. (steps per millisecond=118 ) properties seen :10
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[0, 0, 4, 0] Max Struct:[+inf, +inf, +inf, +inf]
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]
[2025-05-31 22:37:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1442 resets) in 7 ms. (1250 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:[+inf]
[2025-05-31 22:37:40] [INFO ] Invariant cache hit.
[2025-05-31 22:37:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:37:40] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:40] [INFO ] [Real]Added 11 Read/Feed constraints in 22 ms returned sat
[2025-05-31 22:37:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:37:40] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:40] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 7 ms.
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:37:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 316 ms
[2025-05-31 22:37:40] [INFO ] Added : 77 causal constraints over 16 iterations in 531 ms. Result :sat
Minimization took 73 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 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 88/88 transitions.
Graph (complete) has 330 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 10 rules applied. Total rules applied 11 place count 84 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 15 place count 82 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 82 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 80 transition count 81
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 22 place count 80 transition count 81
Applied a total of 22 rules in 11 ms. Remains 80 /90 variables (removed 10) and now considering 81/88 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 80/90 places, 81/88 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1426 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 81 rows 80 cols
[2025-05-31 22:37:42] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144630 resets) in 595 ms. (1677 steps per ms)
BEST_FIRST walk for 1000000 steps (91365 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:37:43] [INFO ] Invariant cache hit.
[2025-05-31 22:37:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:43] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 22:37:43] [INFO ] [Real]Added 16 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:37:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:43] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:37:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2025-05-31 22:37:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 363 ms
[2025-05-31 22:37:43] [INFO ] Computed and/alt/rep : 69/400/69 causal constraints (skipped 11 transitions) in 5 ms.
[2025-05-31 22:37:44] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:37:44] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2025-05-31 22:37:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 157 ms
[2025-05-31 22:37:44] [INFO ] Added : 68 causal constraints over 15 iterations in 391 ms. Result :sat
Minimization took 62 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 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 80/80 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-05-31 22:37:44] [INFO ] Invariant cache hit.
[2025-05-31 22:37:44] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-31 22:37:44] [INFO ] Invariant cache hit.
[2025-05-31 22:37:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 22:37:44] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2025-05-31 22:37:44] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-05-31 22:37:44] [INFO ] Invariant cache hit.
[2025-05-31 22:37:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 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/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 80/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 189 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3582ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3793 ms. Remains : 80/80 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 (5850 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2025-05-31 22:37:49] [INFO ] Flatten gal took : 20 ms
BEST_FIRST walk for 40001 steps (3601 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2025-05-31 22:37:49] [INFO ] Flatten gal took : 10 ms
[2025-05-31 22:37:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality566845992223487159.gal : 2 ms
[2025-05-31 22:37:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11920864428316097636.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality566845992223487159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11920864428316097636.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality11920864428316097636.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 47
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :47 after 116
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :116 after 314
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :314 after 896
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :896 after 6145
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6145 after 36429
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :36429 after 169055
Finished probabilistic random walk after 211999 steps, run visited all 1 properties in 425 ms. (steps per millisecond=498 )
Probabilistic random walk after 211999 steps, saw 106417 distinct states, run finished after 430 ms. (steps per millisecond=493 ) properties seen :1
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-00 in 10085 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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 88 rows 90 cols
[2025-05-31 22:37:50] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1441 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (951 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:37:50] [INFO ] Invariant cache hit.
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 22:37:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:50] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:37:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:37:50] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2025-05-31 22:37:50] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 6 ms.
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:37:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 311 ms
[2025-05-31 22:37:50] [INFO ] Added : 82 causal constraints over 17 iterations in 558 ms. Result :sat
Minimization took 75 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 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 88/88 transitions.
Graph (complete) has 330 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 10 rules applied. Total rules applied 11 place count 84 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 15 place count 82 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 82 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 19 place count 80 transition count 81
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 22 place count 80 transition count 81
Applied a total of 22 rules in 12 ms. Remains 80 /90 variables (removed 10) and now considering 81/88 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 80/90 places, 81/88 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 81 rows 80 cols
[2025-05-31 22:37:52] [INFO ] Computed 13 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144048 resets) in 594 ms. (1680 steps per ms)
BEST_FIRST walk for 1000001 steps (91659 resets) in 427 ms. (2336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:37:53] [INFO ] Invariant cache hit.
[2025-05-31 22:37:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 22:37:53] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:37:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:37:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 22:37:53] [INFO ] [Real]Added 16 Read/Feed constraints in 14 ms returned sat
[2025-05-31 22:37:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:53] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 0 ms returned sat
[2025-05-31 22:37:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:37:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2025-05-31 22:37:53] [INFO ] Computed and/alt/rep : 69/400/69 causal constraints (skipped 11 transitions) in 4 ms.
[2025-05-31 22:37:53] [INFO ] Added : 33 causal constraints over 7 iterations in 66 ms. Result :sat
Minimization took 46 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 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 80/80 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-05-31 22:37:53] [INFO ] Invariant cache hit.
[2025-05-31 22:37:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-31 22:37:53] [INFO ] Invariant cache hit.
[2025-05-31 22:37:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 22:37:53] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2025-05-31 22:37:53] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2025-05-31 22:37:53] [INFO ] Invariant cache hit.
[2025-05-31 22:37:53] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 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/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 80/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 189 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3599ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3815 ms. Remains : 80/80 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 8=1, 16=1, 24=1, 33=1, 48=1, 53=1, 57=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:37:59] [INFO ] Flatten gal took : 21 ms
RANDOM walk for 40000 steps (5810 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
[2025-05-31 22:37:59] [INFO ] Flatten gal took : 9 ms
[2025-05-31 22:37:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15501345299743691370.gal : 3 ms
[2025-05-31 22:37:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14879401470134399348.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15501345299743691370.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14879401470134399348.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (3679 resets) in 70 ms. (563 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Finished probabilistic random walk after 2124 steps, run visited all 1 properties in 7 ms. (steps per millisecond=303 )
Probabilistic random walk after 2124 steps, saw 1077 distinct states, run finished after 8 ms. (steps per millisecond=265 ) properties seen :1
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality14879401470134399348.prop.
ITS tools runner thread asked to quit. Dying gracefully.
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-02 in 9025 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 88 rows 90 cols
[2025-05-31 22:37:59] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1428 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10000 steps (908 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:37:59] [INFO ] Invariant cache hit.
[2025-05-31 22:37:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:37:59] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-05-31 22:37:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:37:59] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2025-05-31 22:37:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:37:59] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:37:59] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 22:37:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2025-05-31 22:37:59] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:37:59] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:37:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:37:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:37:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-05-31 22:37:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:37:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 272 ms
[2025-05-31 22:37:59] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 4 ms.
[2025-05-31 22:37:59] [INFO ] Added : 36 causal constraints over 9 iterations in 101 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 88/88 transitions.
Graph (complete) has 330 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 10 rules applied. Total rules applied 11 place count 84 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 13 place count 83 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 82 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 82 transition count 82
Applied a total of 16 rules in 10 ms. Remains 82 /90 variables (removed 8) and now considering 82/88 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/90 places, 82/88 transitions.
Found an invariant !
This invariant on transitions {8=1, 9=1, 21=1, 30=1, 41=1, 56=1, 62=1, 66=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 9=1, 21=1, 30=1, 41=1, 56=1, 62=1, 66=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
// Phase 1: matrix 82 rows 82 cols
[2025-05-31 22:38:00] [INFO ] Computed 13 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144194 resets) in 581 ms. (1718 steps per ms)
BEST_FIRST walk for 1000000 steps (91111 resets) in 423 ms. (2358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:38:01] [INFO ] Invariant cache hit.
[2025-05-31 22:38:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:01] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:38:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:38:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-31 22:38:01] [INFO ] [Real]Added 12 Read/Feed constraints in 8 ms returned sat
[2025-05-31 22:38:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:01] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:38:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:38:01] [INFO ] [Nat]Added 12 Read/Feed constraints in 15 ms returned sat
[2025-05-31 22:38:01] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2025-05-31 22:38:01] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:38:01] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:38:01] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:38:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:38:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 243 ms
[2025-05-31 22:38:01] [INFO ] Computed and/alt/rep : 78/416/78 causal constraints (skipped 3 transitions) in 6 ms.
[2025-05-31 22:38:02] [INFO ] Added : 28 causal constraints over 7 iterations in 74 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-05-31 22:38:02] [INFO ] Invariant cache hit.
[2025-05-31 22:38:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 22:38:02] [INFO ] Invariant cache hit.
[2025-05-31 22:38:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-05-31 22:38:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2025-05-31 22:38:02] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2025-05-31 22:38:02] [INFO ] Invariant cache hit.
[2025-05-31 22:38:02] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 107 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 81/188 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-05-31 22:38:04] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:38:04] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:38:04] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:38:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2025-05-31 22:38:04] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:38:05] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-05-31 22:38:05] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:38:05] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-05-31 22:38:07] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/164 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 197 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints]
After SMT, in 6503ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6754 ms. Remains : 82/82 places, 82/82 transitions.
Found an invariant !
This invariant on transitions {8=1, 9=1, 21=1, 30=1, 41=1, 56=1, 62=1, 66=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 9=1, 21=1, 30=1, 41=1, 56=1, 62=1, 66=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1479 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40000 steps (5736 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2025-05-31 22:38:09] [INFO ] Flatten gal took : 13 ms
BEST_FIRST walk for 40002 steps (3674 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2025-05-31 22:38:09] [INFO ] Flatten gal took : 6 ms
Finished probabilistic random walk after 545 steps, run visited all 1 properties in 4 ms. (steps per millisecond=136 )
Probabilistic random walk after 545 steps, saw 278 distinct states, run finished after 5 ms. (steps per millisecond=109 ) properties seen :1
[2025-05-31 22:38:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13461726418248812102.gal : 2 ms
[2025-05-31 22:38:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7424541401551046317.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13461726418248812102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7424541401551046317.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-09 in 10507 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 88 rows 90 cols
[2025-05-31 22:38:09] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1390 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (932 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:38:09] [INFO ] Invariant cache hit.
[2025-05-31 22:38:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:09] [INFO ] [Real]Absence check using 4 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:38:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:38:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:38:09] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:38:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:38:09] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-05-31 22:38:09] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2025-05-31 22:38:09] [INFO ] Computed and/alt/rep : 85/392/85 causal constraints (skipped 2 transitions) in 7 ms.
[2025-05-31 22:38:10] [INFO ] Added : 84 causal constraints over 18 iterations in 260 ms. Result :sat
Minimization took 83 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 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 88/88 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 12 place count 84 transition count 84
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 82 transition count 82
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 19 place count 82 transition count 82
Applied a total of 19 rules in 13 ms. Remains 82 /90 variables (removed 8) and now considering 82/88 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/90 places, 82/88 transitions.
Found an invariant !
This invariant on transitions {8=1, 9=1, 19=1, 27=1, 36=1, 51=1, 56=1, 60=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 9=1, 19=1, 27=1, 36=1, 51=1, 56=1, 60=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1429 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]
// Phase 1: matrix 82 rows 82 cols
[2025-05-31 22:38:10] [INFO ] Computed 13 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144577 resets) in 600 ms. (1663 steps per ms)
BEST_FIRST walk for 1000000 steps (91369 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:38:11] [INFO ] Invariant cache hit.
[2025-05-31 22:38:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 22:38:11] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:38:11] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:38:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 22:38:11] [INFO ] [Real]Added 16 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:38:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:38:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-05-31 22:38:11] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 22:38:11] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:38:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 12 ms returned sat
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-05-31 22:38:12] [INFO ] Computed and/alt/rep : 70/393/70 causal constraints (skipped 11 transitions) in 6 ms.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2025-05-31 22:38:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 651 ms
[2025-05-31 22:38:12] [INFO ] Added : 65 causal constraints over 16 iterations in 850 ms. Result :sat
Minimization took 118 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, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-05-31 22:38:13] [INFO ] Invariant cache hit.
[2025-05-31 22:38:13] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 22:38:13] [INFO ] Invariant cache hit.
[2025-05-31 22:38:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-31 22:38:13] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2025-05-31 22:38:13] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2025-05-31 22:38:13] [INFO ] Invariant cache hit.
[2025-05-31 22:38:13] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/163 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 111 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/163 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 77/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-05-31 22:38:16] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2025-05-31 22:38:16] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-05-31 22:38:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 1/164 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (OVERLAPS) 0/164 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 195 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
After SMT, in 6858ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6864ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7101 ms. Remains : 82/82 places, 82/82 transitions.
Found an invariant !
This invariant on transitions {8=1, 9=1, 19=1, 27=1, 36=1, 51=1, 56=1, 60=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 9=1, 19=1, 27=1, 36=1, 51=1, 56=1, 60=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:38:20] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 40000 steps (5807 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2025-05-31 22:38:20] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:38:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18051273413896159319.gal : 1 ms
[2025-05-31 22:38:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13777588096851854179.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18051273413896159319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13777588096851854179.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3654 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13777588096851854179.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 47
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :47 after 116
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :116 after 314
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :314 after 896
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :896 after 6145
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6145 after 36429
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :36429 after 169055
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :169055 after 468883
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.63431e+07,1.22638,40636,2,39271,20,156084,6,0,409,114333,0
Total reachable state count : 36343062

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,28,1.2287,40636,2,327,20,156084,7,0,412,114333,0
Probably explored full state space saw : 731704 states, properties seen :0
Probabilistic random walk after 1463474 steps, saw 731704 distinct states, run finished after 2985 ms. (steps per millisecond=490 ) properties seen :0
Finished exhaustive random walk after 212006 steps, run visited all 1 properties in 430 ms. (steps per millisecond=493 )
Exhaustive walk after 212006 steps, saw 106421 distinct states, run finished after 431 ms. (steps per millisecond=491 ) properties seen :1
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 14573 ms.
[2025-05-31 22:38:24] [INFO ] Flatten gal took : 9 ms
[2025-05-31 22:38:24] [INFO ] Applying decomposition
[2025-05-31 22:38:24] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2486103704304915033.txt' '-o' '/tmp/graph2486103704304915033.bin' '-w' '/tmp/graph2486103704304915033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2486103704304915033.bin' '-l' '-1' '-v' '-w' '/tmp/graph2486103704304915033.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:38:24] [INFO ] Decomposing Gal with order
[2025-05-31 22:38:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:38:24] [INFO ] Removed a total of 34 redundant transitions.
[2025-05-31 22:38:24] [INFO ] Flatten gal took : 35 ms
[2025-05-31 22:38:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2025-05-31 22:38:24] [INFO ] Time to serialize gal into /tmp/UpperBounds8080786554697331776.gal : 2 ms
[2025-05-31 22:38:24] [INFO ] Time to serialize properties into /tmp/UpperBounds15653804277783091840.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8080786554697331776.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15653804277783091840.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds15653804277783091840.prop.
Detected timeout of ITS tools.
[2025-05-31 22:58:59] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:58:59] [INFO ] Time to serialize gal into /tmp/UpperBounds9252291716196775655.gal : 1 ms
[2025-05-31 22:58:59] [INFO ] Time to serialize properties into /tmp/UpperBounds8899482029789892006.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9252291716196775655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8899482029789892006.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds8899482029789892006.prop.
Detected timeout of ITS tools.
[2025-05-31 23:19:34] [INFO ] Flatten gal took : 9 ms
[2025-05-31 23:19:34] [INFO ] Input system was already deterministic with 88 transitions.
[2025-05-31 23:19:34] [INFO ] Transformed 90 places.
[2025-05-31 23:19:34] [INFO ] Transformed 88 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-31 23:19:34] [INFO ] Time to serialize gal into /tmp/UpperBounds11920977262970465783.gal : 2 ms
[2025-05-31 23:19:34] [INFO ] Time to serialize properties into /tmp/UpperBounds14889022682928199003.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11920977262970465783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14889022682928199003.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14889022682928199003.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r083-tall-174860079700061"
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.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 ;