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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 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 336K 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-20-UpperBounds-00
FORMULA_NAME CO4-PT-20-UpperBounds-01
FORMULA_NAME CO4-PT-20-UpperBounds-02
FORMULA_NAME CO4-PT-20-UpperBounds-03
FORMULA_NAME CO4-PT-20-UpperBounds-04
FORMULA_NAME CO4-PT-20-UpperBounds-05
FORMULA_NAME CO4-PT-20-UpperBounds-06
FORMULA_NAME CO4-PT-20-UpperBounds-07
FORMULA_NAME CO4-PT-20-UpperBounds-08
FORMULA_NAME CO4-PT-20-UpperBounds-09
FORMULA_NAME CO4-PT-20-UpperBounds-10
FORMULA_NAME CO4-PT-20-UpperBounds-11
FORMULA_NAME CO4-PT-20-UpperBounds-12
FORMULA_NAME CO4-PT-20-UpperBounds-13
FORMULA_NAME CO4-PT-20-UpperBounds-14
FORMULA_NAME CO4-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556946079

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:22:27] [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:22:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:22:27] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-23 17:22:27] [INFO ] Transformed 1178 places.
[2026-05-23 17:22:27] [INFO ] Transformed 1463 transitions.
[2026-05-23 17:22:27] [INFO ] Found NUPN structural information;
[2026-05-23 17:22:27] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 187 places in 15 ms
Reduce places removed 187 places and 251 transitions.
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 1212 rows 991 cols
[2026-05-23 17:22:27] [INFO ] Computed 12 invariants in 31 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 (207 resets) in 54 ms. (181 steps per ms)
FORMULA CO4-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (279 resets) in 82 ms. (963 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:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:28] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2026-05-23 17:22:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 17:22:28] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:29] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 22 ms to minimize.
[2026-05-23 17:22:29] [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:22:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:30] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:30] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 14 ms to minimize.
[2026-05-23 17:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2026-05-23 17:22:30] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 60 ms.
[2026-05-23 17:22:32] [INFO ] Added : 168 causal constraints over 34 iterations in 2375 ms. Result :sat
Minimization took 691 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:33] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:33] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:33] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2026-05-23 17:22:34] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 65 ms.
[2026-05-23 17:22:34] [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:22:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2026-05-23 17:22:34] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:34] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2026-05-23 17:22:34] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 64 ms.
[2026-05-23 17:22:37] [INFO ] Added : 164 causal constraints over 33 iterations in 2261 ms. Result :sat
Minimization took 711 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:37] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:37] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 17:22:38] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:38] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 8 ms to minimize.
[2026-05-23 17:22:38] [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:22:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2026-05-23 17:22:38] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-23 17:22:38] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:39] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 8 ms to minimize.
[2026-05-23 17:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2026-05-23 17:22:39] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 54 ms.
[2026-05-23 17:22:40] [INFO ] Added : 121 causal constraints over 25 iterations in 1614 ms. Result :sat
Minimization took 801 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:41] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:41] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:42] [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 17:22:42] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 29 ms to minimize.
[2026-05-23 17:22: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:22:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2026-05-23 17:22:42] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-23 17:22:43] [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 17:22:43] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:43] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 15 ms to minimize.
[2026-05-23 17:22:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2026-05-23 17:22:43] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 68 ms.
[2026-05-23 17:22:44] [INFO ] Added : 78 causal constraints over 16 iterations in 1108 ms. Result :sat
Minimization took 676 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:45] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:45] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:45] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:46] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 8 ms to minimize.
[2026-05-23 17:22: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:22:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2026-05-23 17:22:46] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 6 ms returned sat
[2026-05-23 17:22:46] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:46] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 8 ms to minimize.
[2026-05-23 17:22:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2026-05-23 17:22:46] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 55 ms.
[2026-05-23 17:22:48] [INFO ] Added : 110 causal constraints over 22 iterations in 1423 ms. Result :sat
Minimization took 683 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:49] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 17:22:49] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2026-05-23 17:22:49] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 59 ms.
[2026-05-23 17:22: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:22:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2026-05-23 17:22:49] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:50] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2026-05-23 17:22:50] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 61 ms.
[2026-05-23 17:22:52] [INFO ] Added : 138 causal constraints over 28 iterations in 1868 ms. Result :sat
Minimization took 668 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:53] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-23 17:22:53] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:53] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 7 ms to minimize.
[2026-05-23 17:22:53] [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:22:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 23 ms returned sat
[2026-05-23 17:22:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 11 ms returned sat
[2026-05-23 17:22:54] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:54] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 7 ms to minimize.
[2026-05-23 17:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2026-05-23 17:22:54] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 58 ms.
[2026-05-23 17:22:55] [INFO ] Added : 117 causal constraints over 24 iterations in 1607 ms. Result :sat
Minimization took 639 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2026-05-23 17:22:57] [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:22:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 17:22:57] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2026-05-23 17:22:57] [INFO ] Computed and/alt/rep : 1011/1378/1011 causal constraints (skipped 200 transitions) in 59 ms.
[2026-05-23 17:22:59] [INFO ] Added : 118 causal constraints over 24 iterations in 1672 ms. Result :sat
Minimization took 828 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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Graph (trivial) has 1001 edges and 991 vertex of which 3 / 991 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1661 edges and 989 vertex of which 933 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.4 ms
Discarding 56 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 629 rules applied. Total rules applied 631 place count 933 transition count 554
Reduce places removed 593 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 621 rules applied. Total rules applied 1252 place count 340 transition count 526
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 31 rules applied. Total rules applied 1283 place count 327 transition count 508
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 1292 place count 321 transition count 505
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1295 place count 320 transition count 503
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 9 rules applied. Total rules applied 1304 place count 319 transition count 495
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1313 place count 312 transition count 493
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1313 place count 312 transition count 491
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 1317 place count 310 transition count 491
Discarding 48 places :
Symmetric choice reduction at 7 with 48 rule applications. Total rules 1365 place count 262 transition count 443
Iterating global reduction 7 with 48 rules applied. Total rules applied 1413 place count 262 transition count 443
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1413 place count 262 transition count 431
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1437 place count 250 transition count 431
Discarding 30 places :
Symmetric choice reduction at 7 with 30 rule applications. Total rules 1467 place count 220 transition count 376
Iterating global reduction 7 with 30 rules applied. Total rules applied 1497 place count 220 transition count 376
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1502 place count 220 transition count 371
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1506 place count 216 transition count 366
Iterating global reduction 8 with 4 rules applied. Total rules applied 1510 place count 216 transition count 366
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1514 place count 216 transition count 362
Performed 77 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 9 with 154 rules applied. Total rules applied 1668 place count 139 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 139 transition count 271
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 1750 place count 100 transition count 313
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 1792 place count 100 transition count 271
Discarding 25 places :
Symmetric choice reduction at 11 with 25 rule applications. Total rules 1817 place count 75 transition count 186
Iterating global reduction 11 with 25 rules applied. Total rules applied 1842 place count 75 transition count 186
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1859 place count 75 transition count 169
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1865 place count 69 transition count 139
Iterating global reduction 12 with 6 rules applied. Total rules applied 1871 place count 69 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1875 place count 69 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1879 place count 67 transition count 160
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1885 place count 67 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 14 with 15 rules applied. Total rules applied 1900 place count 67 transition count 139
Free-agglomeration rule applied 13 times.
Iterating global reduction 14 with 13 rules applied. Total rules applied 1913 place count 67 transition count 126
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 15 rules applied. Total rules applied 1928 place count 54 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1929 place count 54 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1930 place count 53 transition count 123
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 5 / 50 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 4 rules applied. Total rules applied 1934 place count 47 transition count 123
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 1941 place count 47 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 1941 place count 47 transition count 115
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1943 place count 46 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 17 with 22 rules applied. Total rules applied 1965 place count 46 transition count 93
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 1968 place count 43 transition count 86
Iterating global reduction 17 with 3 rules applied. Total rules applied 1971 place count 43 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1974 place count 43 transition count 83
Free-agglomeration rule applied 6 times.
Iterating global reduction 18 with 6 rules applied. Total rules applied 1980 place count 43 transition count 77
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 1986 place count 37 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 19 with 6 rules applied. Total rules applied 1992 place count 37 transition count 71
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1993 place count 37 transition count 71
Applied a total of 1993 rules in 194 ms. Remains 37 /991 variables (removed 954) and now considering 71/1212 (removed 1141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 37/991 places, 71/1212 transitions.
[2026-05-23 17:23:00] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 37 cols
[2026-05-23 17:23:00] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1085 ms. (920 steps per ms)
FORMULA CO4-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 328 ms. (3039 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:23:01] [INFO ] Flatten gal took : 29 ms
[2026-05-23 17:23:01] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:23:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7603793042962769261.gal : 5 ms
[2026-05-23 17:23:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17360665193186183436.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/ReachabilityCardinality7603793042962769261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17360665193186183436.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 34557 ms.

BK_STOP 1779556982061

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-20"
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-20, 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-177946972200055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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