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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 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 132K 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-11-UpperBounds-00
FORMULA_NAME CO4-PT-11-UpperBounds-01
FORMULA_NAME CO4-PT-11-UpperBounds-02
FORMULA_NAME CO4-PT-11-UpperBounds-03
FORMULA_NAME CO4-PT-11-UpperBounds-04
FORMULA_NAME CO4-PT-11-UpperBounds-05
FORMULA_NAME CO4-PT-11-UpperBounds-06
FORMULA_NAME CO4-PT-11-UpperBounds-07
FORMULA_NAME CO4-PT-11-UpperBounds-08
FORMULA_NAME CO4-PT-11-UpperBounds-09
FORMULA_NAME CO4-PT-11-UpperBounds-10
FORMULA_NAME CO4-PT-11-UpperBounds-11
FORMULA_NAME CO4-PT-11-UpperBounds-12
FORMULA_NAME CO4-PT-11-UpperBounds-13
FORMULA_NAME CO4-PT-11-UpperBounds-14
FORMULA_NAME CO4-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556903747

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:21:45] [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:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:21:45] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2026-05-23 17:21:45] [INFO ] Transformed 545 places.
[2026-05-23 17:21:45] [INFO ] Transformed 617 transitions.
[2026-05-23 17:21:45] [INFO ] Found NUPN structural information;
[2026-05-23 17:21:45] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-UpperBounds-15 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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 440 rows 388 cols
[2026-05-23 17:21:45] [INFO ] Computed 6 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 10000 steps (5 resets) in 35 ms. (277 steps per ms)
FORMULA CO4-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (164 resets) in 133 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-23 17:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:45] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2026-05-23 17:21:45] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2026-05-23 17:21:46] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 30 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 6 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:46] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:46] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 11 ms to minimize.
[2026-05-23 17:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2026-05-23 17:21:46] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 23 ms.
[2026-05-23 17:21:47] [INFO ] Added : 63 causal constraints over 13 iterations in 413 ms. Result :sat
Minimization took 143 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 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:47] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-23 17:21:47] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-23 17:21:47] [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:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:47] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:47] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 12 ms to minimize.
[2026-05-23 17:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2026-05-23 17:21:47] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 19 ms.
[2026-05-23 17:21:48] [INFO ] Added : 73 causal constraints over 16 iterations in 505 ms. Result :sat
Minimization took 157 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 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:48] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2026-05-23 17:21:48] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 32 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 6 positive place invariants in 13 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-23 17:21:49] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 26 ms.
[2026-05-23 17:21:49] [INFO ] Added : 64 causal constraints over 13 iterations in 403 ms. Result :sat
Minimization took 133 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:49] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-23 17:21:49] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 24 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 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:50] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-23 17:21:50] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:50] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 10 ms to minimize.
[2026-05-23 17:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-23 17:21:50] [INFO ] Added : 55 causal constraints over 12 iterations in 488 ms. Result :sat
Minimization took 116 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:50] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:50] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-23 17:21:50] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 26 ms.
[2026-05-23 17:21:51] [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:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:51] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:51] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 7 ms to minimize.
[2026-05-23 17:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2026-05-23 17:21:51] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 25 ms.
[2026-05-23 17:21:51] [INFO ] Added : 74 causal constraints over 15 iterations in 402 ms. Result :sat
Minimization took 125 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:51] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:52] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:52] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 6 ms to minimize.
[2026-05-23 17:21:52] [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:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:52] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:52] [INFO ] Deduced a trap composed of 250 places in 147 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:52] [INFO ] Deduced a trap composed of 21 places in 102 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:52] [INFO ] Deduced a trap composed of 257 places in 97 ms of which 6 ms to minimize.
[2026-05-23 17:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 406 ms
[2026-05-23 17:21:52] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-23 17:21:53] [INFO ] Added : 65 causal constraints over 13 iterations in 366 ms. Result :sat
Minimization took 140 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:53] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:53] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-23 17:21:53] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 22 ms.
[2026-05-23 17:21: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:21:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2026-05-23 17:21:53] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:53] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 5 ms to minimize.
[2026-05-23 17:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2026-05-23 17:21:53] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:54] [INFO ] Deduced a trap composed of 249 places in 147 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:54] [INFO ] Deduced a trap composed of 249 places in 147 ms of which 45 ms to minimize.
[2026-05-23 17:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2026-05-23 17:21:54] [INFO ] Added : 71 causal constraints over 15 iterations in 776 ms. Result :sat
Minimization took 128 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:54] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:55] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:55] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 6 ms to minimize.
[2026-05-23 17:21:55] [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:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-23 17:21:55] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-23 17:21:55] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 21 ms.
[2026-05-23 17:21:55] [INFO ] Added : 57 causal constraints over 12 iterations in 329 ms. Result :sat
Minimization took 123 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:21:55] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-23 17:21:56] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 20 ms.
[2026-05-23 17:21:56] [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:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2026-05-23 17:21:56] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:56] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 7 ms to minimize.
[2026-05-23 17:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2026-05-23 17:21:56] [INFO ] Computed and/alt/rep : 397/487/397 causal constraints (skipped 42 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:56] [INFO ] Deduced a trap composed of 249 places in 148 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:21:57] [INFO ] Deduced a trap composed of 249 places in 145 ms of which 50 ms to minimize.
[2026-05-23 17:21:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2026-05-23 17:21:57] [INFO ] Added : 71 causal constraints over 15 iterations in 768 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 388 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p324) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 439/439 transitions.
Graph (trivial) has 393 edges and 388 vertex of which 3 / 388 are part of one of the 1 SCC in 2 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 532 edges and 386 vertex of which 352 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 247 rules applied. Total rules applied 249 place count 351 transition count 170
Reduce places removed 227 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 236 rules applied. Total rules applied 485 place count 124 transition count 161
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 10 rules applied. Total rules applied 495 place count 120 transition count 155
Reduce places removed 2 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 3 with 4 rules applied. Total rules applied 499 place count 118 transition count 153
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 502 place count 117 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 504 place count 116 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 504 place count 116 transition count 148
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 508 place count 114 transition count 148
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 525 place count 97 transition count 131
Iterating global reduction 6 with 17 rules applied. Total rules applied 542 place count 97 transition count 131
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 542 place count 97 transition count 126
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 552 place count 92 transition count 126
Graph (complete) has 167 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 553 place count 90 transition count 125
Drop transitions (Empty/Sink Transition effects.) 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 7 with 3 rules applied. Total rules applied 556 place count 90 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 557 place count 89 transition count 122
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 567 place count 79 transition count 112
Iterating global reduction 9 with 10 rules applied. Total rules applied 577 place count 79 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 578 place count 79 transition count 111
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 579 place count 78 transition count 110
Iterating global reduction 10 with 1 rules applied. Total rules applied 580 place count 78 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 581 place count 78 transition count 109
Performed 32 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 11 with 64 rules applied. Total rules applied 645 place count 46 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 648 place count 46 transition count 70
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 651 place count 43 transition count 67
Iterating global reduction 12 with 3 rules applied. Total rules applied 654 place count 43 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 655 place count 43 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 659 place count 41 transition count 64
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 661 place count 41 transition count 62
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 663 place count 39 transition count 60
Iterating global reduction 14 with 2 rules applied. Total rules applied 665 place count 39 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 667 place count 39 transition count 58
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 687 place count 29 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 15 with 18 rules applied. Total rules applied 705 place count 29 transition count 41
Discarding 9 places :
Symmetric choice reduction at 16 with 9 rule applications. Total rules 714 place count 20 transition count 32
Iterating global reduction 16 with 9 rules applied. Total rules applied 723 place count 20 transition count 32
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 731 place count 20 transition count 24
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 733 place count 20 transition count 22
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 734 place count 19 transition count 21
Iterating global reduction 17 with 1 rules applied. Total rules applied 735 place count 19 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 736 place count 19 transition count 20
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 740 place count 19 transition count 16
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 745 place count 15 transition count 15
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 746 place count 15 transition count 15
Graph (complete) has 32 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 747 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 748 place count 14 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 749 place count 14 transition count 14
Graph (complete) has 29 edges and 14 vertex of which 13 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 750 place count 13 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 751 place count 13 transition count 13
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 752 place count 13 transition count 13
Graph (complete) has 26 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 23 with 1 rules applied. Total rules applied 753 place count 12 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 754 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 25 with 1 rules applied. Total rules applied 755 place count 11 transition count 11
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t131.t132.t559 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 757 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 8 edges and 7 vertex of which 5 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 2 rules applied. Total rules applied 759 place count 3 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 27 with 7 rules applied. Total rules applied 766 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 1 Pre rules applied. Total rules applied 766 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 768 place count 2 transition count 1
Applied a total of 768 rules in 72 ms. Remains 2 /388 variables (removed 386) and now considering 1/439 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2/388 places, 1/439 transitions.
// Phase 1: matrix 1 rows 2 cols
[2026-05-23 17:21:57] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 226 ms. (4405 steps per ms)
FORMULA CO4-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 125 ms. (7936 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:58] [INFO ] Flatten gal took : 108 ms
[2026-05-23 17:21:58] [INFO ] Flatten gal took : 0 ms
[2026-05-23 17:21:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8031827198827219564.gal : 2 ms
[2026-05-23 17:21:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2410926774764572526.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/ReachabilityCardinality8031827198827219564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2410926774764572526.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 13024 ms.

BK_STOP 1779556918164

--------------------
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-11"
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-11, 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-177946972200046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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