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-174860079800098.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 EisenbergMcGuire-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079800098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 753K 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 EisenbergMcGuire-PT-06-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748734871138

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:41:12] [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 23:41:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:41:12] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-05-31 23:41:12] [INFO ] Transformed 414 places.
[2025-05-31 23:41:12] [INFO ] Transformed 1296 transitions.
[2025-05-31 23:41:12] [INFO ] Found NUPN structural information;
[2025-05-31 23:41:12] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:41:12] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2025-05-31 23:41:12] [INFO ] Computed 19 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 48 ms. (204 steps per ms)
FORMULA EisenbergMcGuire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 68 ms. (1159 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:41:12] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2025-05-31 23:41:12] [INFO ] Invariant cache hit.
[2025-05-31 23:41:13] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2025-05-31 23:41:13] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:13] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-31 23:41:13] [INFO ] State equation strengthened by 314 read => feed constraints.
[2025-05-31 23:41:13] [INFO ] [Real]Added 314 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:41:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:13] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2025-05-31 23:41:13] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 23:41:13] [INFO ] [Nat]Added 314 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:41:14] [INFO ] Deduced a trap composed of 60 places in 195 ms of which 29 ms to minimize.
[2025-05-31 23:41:14] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2025-05-31 23:41:14] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2025-05-31 23:41:14] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2025-05-31 23:41:14] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 3 ms to minimize.
[2025-05-31 23:41:14] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2025-05-31 23:41:15] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2025-05-31 23:41:15] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2025-05-31 23:41:15] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:41:15] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:41:15] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:41:15] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 3 ms to minimize.
[2025-05-31 23:41:16] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:41:16] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2025-05-31 23:41:16] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2025-05-31 23:41:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:41:16] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2593 ms
[2025-05-31 23:41:16] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 63 ms.
[2025-05-31 23:41:18] [INFO ] Added : 225 causal constraints over 45 iterations in 2125 ms. Result :unknown
[2025-05-31 23:41:18] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Real]Added 314 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:41:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2025-05-31 23:41:18] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:19] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-05-31 23:41:19] [INFO ] [Nat]Added 314 Read/Feed constraints in 29 ms returned sat
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:41:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 850 ms
[2025-05-31 23:41:19] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 52 ms.
[2025-05-31 23:41:22] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-05-31 23:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2025-05-31 23:41:22] [INFO ] Added : 240 causal constraints over 48 iterations in 2440 ms. Result :sat
Minimization took 240 ms.
[2025-05-31 23:41:22] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:22] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:22] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2025-05-31 23:41:22] [INFO ] [Real]Added 314 Read/Feed constraints in 34 ms returned sat
[2025-05-31 23:41:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2025-05-31 23:41:23] [INFO ] [Nat]Added 314 Read/Feed constraints in 37 ms returned sat
[2025-05-31 23:41:23] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 2 ms to minimize.
[2025-05-31 23:41:23] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 3 ms to minimize.
[2025-05-31 23:41:23] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2025-05-31 23:41:23] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 2 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 4 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:41:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2680 ms
[2025-05-31 23:41:25] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 47 ms.
[2025-05-31 23:41:27] [INFO ] Added : 220 causal constraints over 44 iterations in 2067 ms. Result :unknown
[2025-05-31 23:41:28] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Real]Added 314 Read/Feed constraints in 30 ms returned sat
[2025-05-31 23:41:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-05-31 23:41:28] [INFO ] [Nat]Added 314 Read/Feed constraints in 29 ms returned sat
[2025-05-31 23:41:28] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2025-05-31 23:41:28] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 3 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2025-05-31 23:41:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1913 ms
[2025-05-31 23:41:30] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 49 ms.
[2025-05-31 23:41:32] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 3 ms to minimize.
[2025-05-31 23:41:32] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 5 ms to minimize.
[2025-05-31 23:41:32] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2025-05-31 23:41:32] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2025-05-31 23:41:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 810 ms
[2025-05-31 23:41:32] [INFO ] Added : 156 causal constraints over 32 iterations in 2333 ms. Result :sat
Minimization took 147 ms.
[2025-05-31 23:41:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Real]Added 314 Read/Feed constraints in 32 ms returned sat
[2025-05-31 23:41:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-05-31 23:41:33] [INFO ] [Nat]Added 314 Read/Feed constraints in 35 ms returned sat
[2025-05-31 23:41:33] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:41:33] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2025-05-31 23:41:33] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:41:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 727 ms
[2025-05-31 23:41:34] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 43 ms.
[2025-05-31 23:41:37] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:41:37] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:41:37] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 2 ms to minimize.
[2025-05-31 23:41:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 514 ms
[2025-05-31 23:41:37] [INFO ] Added : 285 causal constraints over 58 iterations in 3286 ms. Result :sat
Minimization took 217 ms.
[2025-05-31 23:41:37] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-05-31 23:41:37] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:37] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-31 23:41:38] [INFO ] [Real]Added 314 Read/Feed constraints in 33 ms returned sat
[2025-05-31 23:41:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:38] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2025-05-31 23:41:38] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 23:41:38] [INFO ] [Nat]Added 314 Read/Feed constraints in 35 ms returned sat
[2025-05-31 23:41:38] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 2 ms to minimize.
[2025-05-31 23:41:38] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 2 ms to minimize.
[2025-05-31 23:41:38] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 2 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-05-31 23:41:39] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:41:40] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:41:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1813 ms
[2025-05-31 23:41:40] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 42 ms.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:41:41] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:41:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2025-05-31 23:41:42] [INFO ] Added : 197 causal constraints over 41 iterations in 2144 ms. Result :sat
Minimization took 166 ms.
[2025-05-31 23:41:42] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:42] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:42] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-05-31 23:41:42] [INFO ] [Real]Added 314 Read/Feed constraints in 34 ms returned sat
[2025-05-31 23:41:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:42] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:42] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 23:41:43] [INFO ] [Nat]Added 314 Read/Feed constraints in 28 ms returned sat
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2025-05-31 23:41:43] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:41:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1669 ms
[2025-05-31 23:41:44] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 48 ms.
[2025-05-31 23:41:46] [INFO ] Added : 231 causal constraints over 47 iterations in 2277 ms. Result :sat
Minimization took 175 ms.
[2025-05-31 23:41:47] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:47] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2025-05-31 23:41:47] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-31 23:41:47] [INFO ] [Real]Added 314 Read/Feed constraints in 40 ms returned sat
[2025-05-31 23:41:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2025-05-31 23:41:47] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:47] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-05-31 23:41:47] [INFO ] [Nat]Added 314 Read/Feed constraints in 31 ms returned sat
[2025-05-31 23:41:47] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2025-05-31 23:41:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 785 ms
[2025-05-31 23:41:48] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 46 ms.
[2025-05-31 23:41:50] [INFO ] Added : 175 causal constraints over 35 iterations in 1583 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 12 place count 408 transition count 1179
Deduced a syphon composed of 111 places in 3 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 234 place count 297 transition count 1179
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 264 place count 267 transition count 999
Iterating global reduction 2 with 30 rules applied. Total rules applied 294 place count 267 transition count 999
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 354 place count 237 transition count 969
Applied a total of 354 rules in 181 ms. Remains 237 /414 variables (removed 177) and now considering 969/1296 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 237/414 places, 969/1296 transitions.
[2025-05-31 23:41:51] [INFO ] Flow matrix only has 375 transitions (discarded 594 similar events)
// Phase 1: matrix 375 rows 237 cols
[2025-05-31 23:41:52] [INFO ] Computed 19 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1365 ms. (732 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1558 ms. (2565 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 23:41:54] [INFO ] Flow matrix only has 375 transitions (discarded 594 similar events)
[2025-05-31 23:41:54] [INFO ] Invariant cache hit.
[2025-05-31 23:41:54] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:41:54] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-05-31 23:41:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-05-31 23:41:55] [INFO ] [Real]Added 164 Read/Feed constraints in 21 ms returned sat
[2025-05-31 23:41:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Added 164 Read/Feed constraints in 15 ms returned sat
[2025-05-31 23:41:55] [INFO ] Computed and/alt/rep : 322/771/232 causal constraints (skipped 137 transitions) in 28 ms.
[2025-05-31 23:41:55] [INFO ] Added : 47 causal constraints over 10 iterations in 269 ms. Result :sat
Minimization took 92 ms.
[2025-05-31 23:41:55] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Real]Added 164 Read/Feed constraints in 17 ms returned sat
[2025-05-31 23:41:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-05-31 23:41:55] [INFO ] [Nat]Added 164 Read/Feed constraints in 16 ms returned sat
[2025-05-31 23:41:55] [INFO ] Computed and/alt/rep : 322/771/232 causal constraints (skipped 137 transitions) in 24 ms.
[2025-05-31 23:41:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:41:56] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2025-05-31 23:41:56] [INFO ] Added : 66 causal constraints over 14 iterations in 502 ms. Result :sat
Minimization took 100 ms.
[2025-05-31 23:41:56] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Real]Added 164 Read/Feed constraints in 19 ms returned sat
[2025-05-31 23:41:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-05-31 23:41:56] [INFO ] [Nat]Added 164 Read/Feed constraints in 17 ms returned sat
[2025-05-31 23:41:56] [INFO ] Computed and/alt/rep : 322/771/232 causal constraints (skipped 137 transitions) in 26 ms.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:41:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2025-05-31 23:41:57] [INFO ] Added : 35 causal constraints over 8 iterations in 420 ms. Result :sat
Minimization took 102 ms.
[2025-05-31 23:41:57] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:41:57] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:57] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-31 23:41:57] [INFO ] [Real]Added 164 Read/Feed constraints in 19 ms returned sat
[2025-05-31 23:41:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:41:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-05-31 23:41:57] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-05-31 23:41:57] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 23:41:57] [INFO ] [Nat]Added 164 Read/Feed constraints in 16 ms returned sat
[2025-05-31 23:41:57] [INFO ] Computed and/alt/rep : 322/771/232 causal constraints (skipped 137 transitions) in 31 ms.
[2025-05-31 23:41:58] [INFO ] Added : 57 causal constraints over 12 iterations in 323 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 969/969 transitions.
Applied a total of 0 rules in 26 ms. Remains 237 /237 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 237/237 places, 969/969 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 969/969 transitions.
Applied a total of 0 rules in 20 ms. Remains 237 /237 variables (removed 0) and now considering 969/969 (removed 0) transitions.
[2025-05-31 23:41:58] [INFO ] Flow matrix only has 375 transitions (discarded 594 similar events)
[2025-05-31 23:41:58] [INFO ] Invariant cache hit.
[2025-05-31 23:41:58] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 23:41:58] [INFO ] Flow matrix only has 375 transitions (discarded 594 similar events)
[2025-05-31 23:41:58] [INFO ] Invariant cache hit.
[2025-05-31 23:41:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-05-31 23:41:59] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2025-05-31 23:41:59] [INFO ] Redundant transitions in 53 ms returned []
Running 963 sub problems to find dead transitions.
[2025-05-31 23:41:59] [INFO ] Flow matrix only has 375 transitions (discarded 594 similar events)
[2025-05-31 23:41:59] [INFO ] Invariant cache hit.
[2025-05-31 23:41:59] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:03] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2025-05-31 23:42:03] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:42:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:42:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:42:03] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2025-05-31 23:42:04] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2025-05-31 23:42:04] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-05-31 23:42:04] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:42:04] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:42:04] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:42:04] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:42:05] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:06] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:42:06] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:42:07] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:42:08] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:14] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-05-31 23:42:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:42:17] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2025-05-31 23:42:18] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2025-05-31 23:42:19] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:23] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:42:24] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2025-05-31 23:42:25] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:42:26] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2025-05-31 23:42:27] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:42:27] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/612 variables, and 98 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/237 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 963/963 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 963 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 79/98 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:31] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:42:31] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:42:32] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:42:32] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2025-05-31 23:42:33] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2025-05-31 23:42:33] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:42:33] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2025-05-31 23:42:33] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:42:33] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2025-05-31 23:42:34] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2025-05-31 23:42:35] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:42:35] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2025-05-31 23:42:36] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 2 ms to minimize.
[2025-05-31 23:42:37] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 18/116 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 1 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2025-05-31 23:42:44] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 1 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:42:45] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2025-05-31 23:42:46] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2025-05-31 23:42:46] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2025-05-31 23:42:46] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:42:46] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2025-05-31 23:42:46] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2025-05-31 23:42:46] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2025-05-31 23:42:48] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2025-05-31 23:42:48] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 963 unsolved
[2025-05-31 23:42:54] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2025-05-31 23:42:54] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2025-05-31 23:42:54] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2025-05-31 23:42:54] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2025-05-31 23:42:54] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2025-05-31 23:42:55] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2025-05-31 23:42:55] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2025-05-31 23:42:56] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2025-05-31 23:42:56] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2025-05-31 23:42:56] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/612 variables, and 146 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/237 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/963 constraints, Known Traps: 127/127 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 963 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61328 ms. Remains : 237/237 places, 969/969 transitions.
RANDOM walk for 40000 steps (8 resets) in 1597 ms. (25 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
[2025-05-31 23:43:00] [INFO ] Flatten gal took : 203 ms
[2025-05-31 23:43:00] [INFO ] Flatten gal took : 109 ms
[2025-05-31 23:43:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8608668783880854956.gal : 26 ms
[2025-05-31 23:43:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14922864864980444310.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/ReachabilityCardinality8608668783880854956.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14922864864980444310.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/ReachabilityCardinality14922864864980444310.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 26
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :26 after 51
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :51 after 201
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :201 after 386
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :386 after 859
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :859 after 2411
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2411 after 3691
Interrupted probabilistic random walk after 509152 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :6 out of 8
Probabilistic random walk after 509152 steps, saw 127777 distinct states, run finished after 3003 ms. (steps per millisecond=169 ) properties seen :6
[2025-05-31 23:43:03] [INFO ] Flow matrix only has 375 transitions (discarded 594 similar events)
[2025-05-31 23:43:03] [INFO ] Invariant cache hit.
[2025-05-31 23:43:03] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 63/102 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/158 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/248 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 142/390 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/400 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3691 after 14344
At refinement iteration 20 (OVERLAPS) 212/612 variables, 152/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/612 variables, 137/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/612 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/612 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 421 constraints, problems are : Problem set: 0 solved, 2 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 63/102 variables, 39/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/158 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 90/248 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 142/390 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/400 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/400 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 23:43:04] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2025-05-31 23:43:04] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:43:04] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/400 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/400 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 212/612 variables, 152/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/612 variables, 137/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/612 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/612 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 426 constraints, problems are : Problem set: 0 solved, 2 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1081ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 969/969 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 237 transition count 966
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 234 transition count 966
Applied a total of 6 rules in 30 ms. Remains 234 /237 variables (removed 3) and now considering 966/969 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 234/237 places, 966/969 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :14344 after 24606
Finished probabilistic random walk after 479148 steps, run visited all 2 properties in 2749 ms. (steps per millisecond=174 )
Probabilistic random walk after 479148 steps, saw 127376 distinct states, run finished after 2752 ms. (steps per millisecond=174 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-06-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-06-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-06-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-06-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 115309 ms.

BK_STOP 1748734987706

--------------------
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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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-174860079800098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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