fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r079-tall-177946972200050
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for CO4-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
774.628 30293.00 43527.00 241.00 1 1 0 1 1 0 1 1 1 1 1 1 1 1 0 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.9K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 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 255K 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-15-UpperBounds-00
FORMULA_NAME CO4-PT-15-UpperBounds-01
FORMULA_NAME CO4-PT-15-UpperBounds-02
FORMULA_NAME CO4-PT-15-UpperBounds-03
FORMULA_NAME CO4-PT-15-UpperBounds-04
FORMULA_NAME CO4-PT-15-UpperBounds-05
FORMULA_NAME CO4-PT-15-UpperBounds-06
FORMULA_NAME CO4-PT-15-UpperBounds-07
FORMULA_NAME CO4-PT-15-UpperBounds-08
FORMULA_NAME CO4-PT-15-UpperBounds-09
FORMULA_NAME CO4-PT-15-UpperBounds-10
FORMULA_NAME CO4-PT-15-UpperBounds-11
FORMULA_NAME CO4-PT-15-UpperBounds-12
FORMULA_NAME CO4-PT-15-UpperBounds-13
FORMULA_NAME CO4-PT-15-UpperBounds-14
FORMULA_NAME CO4-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779556923080

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:22:04] [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:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:22:04] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-05-23 17:22:04] [INFO ] Transformed 833 places.
[2026-05-23 17:22:04] [INFO ] Transformed 1106 transitions.
[2026-05-23 17:22:04] [INFO ] Found NUPN structural information;
[2026-05-23 17:22:04] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-UpperBounds-14 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 909 rows 709 cols
[2026-05-23 17:22:04] [INFO ] Computed 12 invariants in 29 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 (222 resets) in 41 ms. (238 steps per ms)
FORMULA CO4-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (288 resets) in 107 ms. (740 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:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:05] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2026-05-23 17:22:05] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-23 17:22:05] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2026-05-23 17:22:05] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 122 ms.
[2026-05-23 17:22:05] [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:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2026-05-23 17:22:06] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:06] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2026-05-23 17:22:06] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 55 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:08] [INFO ] Deduced a trap composed of 219 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:08] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:08] [INFO ] Deduced a trap composed of 330 places in 153 ms of which 7 ms to minimize.
[2026-05-23 17:22:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 742 ms
[2026-05-23 17:22:08] [INFO ] Added : 121 causal constraints over 25 iterations in 2120 ms. Result :sat
Minimization took 755 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:09] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:09] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:09] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2026-05-23 17:22:09] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 50 ms.
[2026-05-23 17:22:09] [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:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2026-05-23 17:22:10] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:10] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2026-05-23 17:22:10] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 49 ms.
[2026-05-23 17:22:12] [INFO ] Added : 128 causal constraints over 26 iterations in 1603 ms. Result :sat
Minimization took 724 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:12] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 17:22:12] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:13] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2026-05-23 17:22:13] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 45 ms.
[2026-05-23 17:22:13] [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:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:13] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:13] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2026-05-23 17:22:13] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 43 ms.
[2026-05-23 17:22:14] [INFO ] Added : 110 causal constraints over 22 iterations in 1034 ms. Result :sat
Minimization took 725 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:15] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 17:22:15] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:15] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2026-05-23 17:22:15] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 43 ms.
[2026-05-23 17:22:15] [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:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:16] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:16] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2026-05-23 17:22:16] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 41 ms.
[2026-05-23 17:22:17] [INFO ] Added : 137 causal constraints over 28 iterations in 1361 ms. Result :sat
Minimization took 713 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:18] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2026-05-23 17:22:18] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:18] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2026-05-23 17:22:18] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 49 ms.
[2026-05-23 17:22:18] [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:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2026-05-23 17:22:19] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:19] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2026-05-23 17:22:19] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 41 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:20] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:20] [INFO ] Deduced a trap composed of 128 places in 99 ms of which 18 ms to minimize.
[2026-05-23 17:22:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2026-05-23 17:22:21] [INFO ] Added : 136 causal constraints over 28 iterations in 1795 ms. Result :sat
Minimization took 726 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:21] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 17:22:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:22] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2026-05-23 17:22:22] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 38 ms.
[2026-05-23 17:22:22] [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:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2026-05-23 17:22:22] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:22] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2026-05-23 17:22:22] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 43 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:24] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 7 ms to minimize.
[2026-05-23 17:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2026-05-23 17:22:24] [INFO ] Added : 114 causal constraints over 24 iterations in 1491 ms. Result :sat
Minimization took 729 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:25] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 17:22:25] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:25] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2026-05-23 17:22:25] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 43 ms.
[2026-05-23 17:22:25] [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:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:25] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:25] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2026-05-23 17:22:25] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 39 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:27] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:27] [INFO ] Deduced a trap composed of 208 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:27] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:27] [INFO ] Deduced a trap composed of 128 places in 192 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:28] [INFO ] Deduced a trap composed of 319 places in 153 ms of which 23 ms to minimize.
[2026-05-23 17:22:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1073 ms
[2026-05-23 17:22:28] [INFO ] Added : 131 causal constraints over 27 iterations in 2413 ms. Result :sat
Minimization took 737 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:29] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2026-05-23 17:22:29] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 42 ms.
[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 11 positive place invariants in 20 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 17:22:29] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2026-05-23 17:22:29] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 42 ms.
[2026-05-23 17:22:30] [INFO ] Added : 101 causal constraints over 21 iterations in 1062 ms. Result :sat
Minimization took 727 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 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 909/909 transitions.
Graph (trivial) has 716 edges and 709 vertex of which 2 / 709 are part of one of the 1 SCC in 3 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 1304 edges and 708 vertex of which 657 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 363 rules applied. Total rules applied 365 place count 657 transition count 521
Reduce places removed 334 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 362 rules applied. Total rules applied 727 place count 323 transition count 493
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 26 rules applied. Total rules applied 753 place count 310 transition count 480
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 762 place count 307 transition count 474
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 771 place count 304 transition count 468
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 5 with 18 rules applied. Total rules applied 789 place count 301 transition count 453
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 807 place count 288 transition count 448
Discarding 48 places :
Symmetric choice reduction at 7 with 48 rule applications. Total rules 855 place count 240 transition count 400
Iterating global reduction 7 with 48 rules applied. Total rules applied 903 place count 240 transition count 400
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 903 place count 240 transition count 386
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 931 place count 226 transition count 386
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 959 place count 198 transition count 342
Iterating global reduction 7 with 28 rules applied. Total rules applied 987 place count 198 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 994 place count 198 transition count 335
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 995 place count 197 transition count 335
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 999 place count 193 transition count 330
Iterating global reduction 9 with 4 rules applied. Total rules applied 1003 place count 193 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1007 place count 193 transition count 326
Performed 70 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 10 with 140 rules applied. Total rules applied 1147 place count 123 transition count 247
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1150 place count 123 transition count 244
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 11 with 72 rules applied. Total rules applied 1222 place count 87 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 11 with 57 rules applied. Total rules applied 1279 place count 87 transition count 223
Discarding 25 places :
Symmetric choice reduction at 12 with 25 rule applications. Total rules 1304 place count 62 transition count 155
Iterating global reduction 12 with 25 rules applied. Total rules applied 1329 place count 62 transition count 155
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 1346 place count 62 transition count 138
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1351 place count 57 transition count 116
Iterating global reduction 13 with 5 rules applied. Total rules applied 1356 place count 57 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1360 place count 57 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 1363 place count 57 transition count 109
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1364 place count 56 transition count 107
Iterating global reduction 14 with 1 rules applied. Total rules applied 1365 place count 56 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1366 place count 56 transition count 106
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 1375 place count 56 transition count 97
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 1386 place count 47 transition count 95
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 1388 place count 47 transition count 93
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1390 place count 47 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1391 place count 46 transition count 92
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 t511.t836.t439.t440 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.
Graph (trivial) has 20 edges and 42 vertex of which 3 / 42 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 3 rules applied. Total rules applied 1394 place count 40 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 1399 place count 40 transition count 85
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1400 place count 39 transition count 83
Iterating global reduction 18 with 1 rules applied. Total rules applied 1401 place count 39 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1402 place count 39 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 19 with 9 rules applied. Total rules applied 1411 place count 39 transition count 73
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 1413 place count 37 transition count 69
Iterating global reduction 19 with 2 rules applied. Total rules applied 1415 place count 37 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 1417 place count 37 transition count 67
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1418 place count 36 transition count 65
Iterating global reduction 20 with 1 rules applied. Total rules applied 1419 place count 36 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1420 place count 36 transition count 64
Free-agglomeration rule applied 4 times.
Iterating global reduction 21 with 4 rules applied. Total rules applied 1424 place count 36 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 1428 place count 32 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 1430 place count 32 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1431 place count 32 transition count 57
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 22 with 3 rules applied. Total rules applied 1434 place count 31 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 1436 place count 31 transition count 55
Applied a total of 1436 rules in 174 ms. Remains 31 /709 variables (removed 678) and now considering 55/909 (removed 854) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 31/709 places, 55/909 transitions.
[2026-05-23 17:22:31] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 31 cols
[2026-05-23 17:22:31] [INFO ] Computed 6 invariants in 1 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 870 ms. (1148 steps per ms)
FORMULA CO4-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 291 ms. (3424 steps per ms)
FORMULA CO4-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:22:33] [INFO ] Flatten gal took : 24 ms
[2026-05-23 17:22:33] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:22:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9272823197716265559.gal : 6 ms
[2026-05-23 17:22:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15385189398953046019.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9272823197716265559.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15385189398953046019.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 28901 ms.

BK_STOP 1779556953373

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

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