Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 6 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 91K Mar 3 18:30 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 DES-PT-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779527475953

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:11:18] [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]
[2026-05-23 09:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:11:18] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2026-05-23 09:11:18] [INFO ] Transformed 360 places.
[2026-05-23 09:11:18] [INFO ] Transformed 311 transitions.
[2026-05-23 09:11:18] [INFO ] Found NUPN structural information;
[2026-05-23 09:11:19] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 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]
// Phase 1: matrix 311 rows 360 cols
[2026-05-23 09:11:19] [INFO ] Computed 65 invariants in 51 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 (80 resets) in 122 ms. (81 steps per ms)
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (37 resets) in 88 ms. (337 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 09:11:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:11:20] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2026-05-23 09:11:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 50 ms returned sat
[2026-05-23 09:11:20] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2026-05-23 09:11:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:11:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 55 ms returned sat
[2026-05-23 09:11:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2026-05-23 09:11:21] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:21] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:22] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:22] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 15 ms to minimize.
[2026-05-23 09:11:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 834 ms
[2026-05-23 09:11:22] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 31 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:25] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:25] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 13 ms to minimize.
[2026-05-23 09:11:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 532 ms
[2026-05-23 09:11:25] [INFO ] Added : 260 causal constraints over 52 iterations in 3337 ms. Result :sat
Minimization took 77 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:11:25] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2026-05-23 09:11:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2026-05-23 09:11:26] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:26] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 42 ms to minimize.
[2026-05-23 09:11:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:11:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 32 ms returned sat
[2026-05-23 09:11:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2026-05-23 09:11:27] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:27] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:27] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:28] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:28] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 17 ms to minimize.
[2026-05-23 09:11:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1117 ms
[2026-05-23 09:11:28] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 45 ms.
[2026-05-23 09:11:31] [INFO ] Added : 215 causal constraints over 43 iterations in 3387 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:11:31] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2026-05-23 09:11:31] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2026-05-23 09:11:32] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2026-05-23 09:11:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:11:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 52 ms returned sat
[2026-05-23 09:11:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2026-05-23 09:11:32] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:33] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:33] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:33] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:33] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:33] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:34] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:34] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:34] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
[2026-05-23 09:11:34] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1466 ms
[2026-05-23 09:11:34] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 38 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 353 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 353 transition count 284
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 332 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 332 transition count 275
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 323 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 304 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 304 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 304 transition count 255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 303 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 288 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 288 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 288 transition count 225
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 286 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 286 transition count 221
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 283 transition count 221
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 206 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 204 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 204 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 203 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 202 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 201 transition count 144
Applied a total of 319 rules in 354 ms. Remains 201 /360 variables (removed 159) and now considering 144/311 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 201/360 places, 144/311 transitions.
// Phase 1: matrix 144 rows 201 cols
[2026-05-23 09:11:38] [INFO ] Computed 63 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (47880 resets) in 2599 ms. (384 steps per ms)
BEST_FIRST walk for 3000001 steps (27360 resets) in 3182 ms. (942 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 09:11:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:11:44] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2026-05-23 09:11:44] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 17 ms returned sat
[2026-05-23 09:11:44] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-23 09:11:44] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 19 ms.
[2026-05-23 09:11:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:11:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:11:44] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 21 ms returned sat
[2026-05-23 09:11:44] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2026-05-23 09:11:44] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 17 ms.
[2026-05-23 09:11:45] [INFO ] Added : 102 causal constraints over 21 iterations in 451 ms. Result :sat
Minimization took 85 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:11:45] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:11:45] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2026-05-23 09:11:45] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-23 09:11:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:11:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:11:45] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 26 ms returned sat
[2026-05-23 09:11:45] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2026-05-23 09:11:46] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 19 ms.
[2026-05-23 09:11:46] [INFO ] Added : 99 causal constraints over 20 iterations in 560 ms. Result :sat
Minimization took 140 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:11:46] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2026-05-23 09:11:46] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 23 ms returned sat
[2026-05-23 09:11:46] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2026-05-23 09:11:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:11:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:11:47] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 25 ms returned sat
[2026-05-23 09:11:47] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-23 09:11:47] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 18 ms.
[2026-05-23 09:11:47] [INFO ] Added : 106 causal constraints over 22 iterations in 612 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 144/144 transitions.
Applied a total of 0 rules in 18 ms. Remains 201 /201 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 201/201 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 144/144 transitions.
Applied a total of 0 rules in 12 ms. Remains 201 /201 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2026-05-23 09:11:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:11:49] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-23 09:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:11:49] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:11:49] [INFO ] Redundant transitions in 5 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-23 09:11:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/201 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 144/345 variables, 201/264 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:53] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:11:54] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 266 constraints, problems are : Problem set: 0 solved, 141 unsolved in 10258 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 3/201 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 144/345 variables, 201/266 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 141/407 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:12:12] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 408 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40409ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 40420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41343 ms. Remains : 201/201 places, 144/144 transitions.
RANDOM walk for 40000 steps (1936 resets) in 1465 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (359 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (371 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (363 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
[2026-05-23 09:12:30] [INFO ] Flatten gal took : 177 ms
BEST_FIRST walk for 40003 steps (378 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (357 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
[2026-05-23 09:12:31] [INFO ] Flatten gal took : 85 ms
BEST_FIRST walk for 40003 steps (350 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
[2026-05-23 09:12:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9521859896272120292.gal : 18 ms
[2026-05-23 09:12:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13351271699172820587.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9521859896272120292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13351271699172820587.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13351271699172820587.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 28
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :28 after 56
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :56 after 68
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :68 after 1376
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1376 after 1544
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1544 after 3552
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3552 after 77064
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :77064 after 237080
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.84298e+06 after 1.94674e+06
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.94674e+06 after 2.00129e+09
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.78051e+09 after 2.78056e+09
Finished probabilistic random walk after 359682 steps, run visited all 6 properties in 2388 ms. (steps per millisecond=150 )
Probabilistic random walk after 359682 steps, saw 91146 distinct states, run finished after 2393 ms. (steps per millisecond=150 ) properties seen :6
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 74957 ms.

BK_STOP 1779527553544

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="DES-PT-20b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is DES-PT-20b, 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 r095-smll-177946996300049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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