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.r079-tall-177946972200044.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 CO4-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-177946972200044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 4.9K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 152K 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 CO4-PT-09-UpperBounds-00
FORMULA_NAME CO4-PT-09-UpperBounds-01
FORMULA_NAME CO4-PT-09-UpperBounds-02
FORMULA_NAME CO4-PT-09-UpperBounds-03
FORMULA_NAME CO4-PT-09-UpperBounds-04
FORMULA_NAME CO4-PT-09-UpperBounds-05
FORMULA_NAME CO4-PT-09-UpperBounds-06
FORMULA_NAME CO4-PT-09-UpperBounds-07
FORMULA_NAME CO4-PT-09-UpperBounds-08
FORMULA_NAME CO4-PT-09-UpperBounds-09
FORMULA_NAME CO4-PT-09-UpperBounds-10
FORMULA_NAME CO4-PT-09-UpperBounds-11
FORMULA_NAME CO4-PT-09-UpperBounds-12
FORMULA_NAME CO4-PT-09-UpperBounds-13
FORMULA_NAME CO4-PT-09-UpperBounds-14
FORMULA_NAME CO4-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556897085

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:21:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 17:21:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:21:38] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-23 17:21:38] [INFO ] Transformed 467 places.
[2026-05-23 17:21:38] [INFO ] Transformed 634 transitions.
[2026-05-23 17:21:38] [INFO ] Found NUPN structural information;
[2026-05-23 17:21:38] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 471 rows 359 cols
[2026-05-23 17:21:38] [INFO ] Computed 9 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (66 resets) in 42 ms. (232 steps per ms)
FORMULA CO4-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (296 resets) in 114 ms. (695 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]
[2026-05-23 17:21:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:39] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:39] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 17:21:39] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-23 17:21:39] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 39 ms.
[2026-05-23 17:21:39] [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 17:21:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:39] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:39] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-23 17:21:39] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:40] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:40] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 28 ms to minimize.
[2026-05-23 17:21:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 376 ms
[2026-05-23 17:21:40] [INFO ] Added : 83 causal constraints over 18 iterations in 1010 ms. Result :sat
Minimization took 190 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:41] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:41] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 17:21:41] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-23 17:21:41] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 30 ms.
[2026-05-23 17:21:41] [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 17:21:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:41] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:41] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-23 17:21:41] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 27 ms.
[2026-05-23 17:21:42] [INFO ] Added : 73 causal constraints over 15 iterations in 456 ms. Result :sat
Minimization took 205 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:42] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:42] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:42] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:42] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 12 ms to minimize.
[2026-05-23 17:21:42] [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 17:21:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:42] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:42] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:42] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 13 ms to minimize.
[2026-05-23 17:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2026-05-23 17:21:42] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:43] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:43] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:43] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:43] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:43] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 3 ms to minimize.
[2026-05-23 17:21:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 513 ms
[2026-05-23 17:21:43] [INFO ] Added : 71 causal constraints over 15 iterations in 978 ms. Result :sat
Minimization took 268 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:44] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:44] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:44] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-23 17:21:44] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 33 ms.
[2026-05-23 17:21:44] [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 17:21:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:44] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:21:44] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-23 17:21:44] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:45] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 5 ms to minimize.
[2026-05-23 17:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2026-05-23 17:21:45] [INFO ] Added : 34 causal constraints over 8 iterations in 377 ms. Result :sat
Minimization took 179 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:45] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:45] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 17:21:45] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-23 17:21:45] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 24 ms.
[2026-05-23 17:21:45] [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 17:21:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:45] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:45] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-23 17:21:45] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 26 ms.
[2026-05-23 17:21:46] [INFO ] Added : 29 causal constraints over 6 iterations in 201 ms. Result :sat
Minimization took 189 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-23 17:21:46] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 21 ms.
[2026-05-23 17:21:46] [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 17:21:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-23 17:21:46] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 32 ms.
[2026-05-23 17:21:47] [INFO ] Added : 72 causal constraints over 16 iterations in 470 ms. Result :sat
Minimization took 306 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:47] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:47] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:21:47] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-23 17:21:47] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 20 ms.
[2026-05-23 17:21:48] [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 17:21:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-23 17:21:48] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 20 ms.
[2026-05-23 17:21:48] [INFO ] Added : 64 causal constraints over 13 iterations in 351 ms. Result :sat
Minimization took 308 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-23 17:21:49] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 26 ms.
[2026-05-23 17:21:49] [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 17:21:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-23 17:21:49] [INFO ] Computed and/alt/rep : 366/633/366 causal constraints (skipped 104 transitions) in 21 ms.
[2026-05-23 17:21:49] [INFO ] Added : 65 causal constraints over 13 iterations in 460 ms. Result :sat
Minimization took 377 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 CO4-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 471/471 transitions.
Graph (trivial) has 359 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 757 edges and 358 vertex of which 323 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 323 transition count 268
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 180 rules applied. Total rules applied 366 place count 161 transition count 250
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 18 rules applied. Total rules applied 384 place count 153 transition count 240
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 6 rules applied. Total rules applied 390 place count 151 transition count 236
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 6 rules applied. Total rules applied 396 place count 149 transition count 232
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 402 place count 147 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 404 place count 145 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 404 place count 145 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 408 place count 143 transition count 226
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 433 place count 118 transition count 201
Iterating global reduction 7 with 25 rules applied. Total rules applied 458 place count 118 transition count 201
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 458 place count 118 transition count 195
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 470 place count 112 transition count 195
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 485 place count 97 transition count 157
Iterating global reduction 7 with 15 rules applied. Total rules applied 500 place count 97 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 502 place count 97 transition count 155
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 504 place count 95 transition count 153
Iterating global reduction 8 with 2 rules applied. Total rules applied 506 place count 95 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 508 place count 95 transition count 151
Performed 33 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 574 place count 62 transition count 114
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 211 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 3 rules applied. Total rules applied 577 place count 61 transition count 112
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 607 place count 46 transition count 128
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 10 with 38 rules applied. Total rules applied 645 place count 46 transition count 90
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 657 place count 34 transition count 66
Iterating global reduction 11 with 12 rules applied. Total rules applied 669 place count 34 transition count 66
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 678 place count 34 transition count 57
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 680 place count 32 transition count 49
Iterating global reduction 12 with 2 rules applied. Total rules applied 682 place count 32 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 683 place count 32 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 685 place count 32 transition count 46
Free-agglomeration rule applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 692 place count 32 transition count 39
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 700 place count 25 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 701 place count 24 transition count 37
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 704 place count 22 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 705 place count 22 transition count 35
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 708 place count 22 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 711 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 713 place count 19 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 714 place count 19 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 715 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 717 place count 18 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 718 place count 18 transition count 26
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 721 place count 17 transition count 24
Applied a total of 721 rules in 118 ms. Remains 17 /359 variables (removed 342) and now considering 24/471 (removed 447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 17/359 places, 24/471 transitions.
[2026-05-23 17:21:50] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 17 cols
[2026-05-23 17:21:50] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 1]
FORMULA CO4-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 738 ms. (1353 steps per ms)
FORMULA CO4-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 280 ms. (3558 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-23 17:21:51] [INFO ] Flatten gal took : 20 ms
[2026-05-23 17:21:51] [INFO ] Flatten gal took : 5 ms
[2026-05-23 17:21:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16695687554278103856.gal : 4 ms
[2026-05-23 17:21:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality23257258248576566.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16695687554278103856.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality23257258248576566.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13386 ms.

BK_STOP 1779556911842

--------------------
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="CO4-PT-09"
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 CO4-PT-09, 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 r079-tall-177946972200044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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