Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600021.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:27 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 99K 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 MedleyA-PT-09-UpperBounds-00
FORMULA_NAME MedleyA-PT-09-UpperBounds-01
FORMULA_NAME MedleyA-PT-09-UpperBounds-02
FORMULA_NAME MedleyA-PT-09-UpperBounds-03
FORMULA_NAME MedleyA-PT-09-UpperBounds-04
FORMULA_NAME MedleyA-PT-09-UpperBounds-05
FORMULA_NAME MedleyA-PT-09-UpperBounds-06
FORMULA_NAME MedleyA-PT-09-UpperBounds-07
FORMULA_NAME MedleyA-PT-09-UpperBounds-08
FORMULA_NAME MedleyA-PT-09-UpperBounds-09
FORMULA_NAME MedleyA-PT-09-UpperBounds-10
FORMULA_NAME MedleyA-PT-09-UpperBounds-11
FORMULA_NAME MedleyA-PT-09-UpperBounds-12
FORMULA_NAME MedleyA-PT-09-UpperBounds-13
FORMULA_NAME MedleyA-PT-09-UpperBounds-14
FORMULA_NAME MedleyA-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942857281

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:19] [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-28 04:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:19] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2026-05-28 04:34:19] [INFO ] Transformed 147 places.
[2026-05-28 04:34:19] [INFO ] Transformed 315 transitions.
[2026-05-28 04:34:19] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:19] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 49 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 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 313 rows 145 cols
[2026-05-28 04:34:19] [INFO ] Computed 12 invariants in 18 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 (330 resets) in 62 ms. (158 steps per ms)
FORMULA MedleyA-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (508 resets) in 112 ms. (619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-28 04:34:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:20] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-28 04:34:20] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 30 ms.
[2026-05-28 04:34:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:20] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2026-05-28 04:34:21] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:21] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 34 ms to minimize.
[2026-05-28 04:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2026-05-28 04:34:21] [INFO ] Added : 68 causal constraints over 15 iterations in 705 ms. Result :sat
Minimization took 124 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:21] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-28 04:34:21] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 13 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-28 04:34:22] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 43 ms.
[2026-05-28 04:34: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-28 04:34:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:22] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2026-05-28 04:34:22] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 50 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:22] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 8 ms to minimize.
[2026-05-28 04:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2026-05-28 04:34:23] [INFO ] Added : 68 causal constraints over 15 iterations in 593 ms. Result :sat
Minimization took 195 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:23] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 35 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-28 04:34:23] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 33 ms.
[2026-05-28 04:34:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:23] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-28 04:34:23] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:25] [INFO ] Deduced a trap composed of 21 places in 949 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:25] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:25] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 16 ms to minimize.
[2026-05-28 04:34:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1504 ms
[2026-05-28 04:34:25] [INFO ] Added : 76 causal constraints over 16 iterations in 1963 ms. Result :sat
Minimization took 126 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:26] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-28 04:34:26] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 26 ms.
[2026-05-28 04:34:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-28 04:34:26] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 17 ms.
[2026-05-28 04:34:26] [INFO ] Added : 80 causal constraints over 16 iterations in 450 ms. Result :sat
Minimization took 154 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-28 04:34:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:27] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-28 04:34:27] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 39 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 8 ms to minimize.
[2026-05-28 04:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2026-05-28 04:34:28] [INFO ] Added : 76 causal constraints over 16 iterations in 541 ms. Result :sat
Minimization took 137 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:28] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-28 04:34:28] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:28] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2026-05-28 04:34:28] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 42 ms.
[2026-05-28 04:34:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:28] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-28 04:34:28] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-28 04:34:28] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:29] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 31 ms to minimize.
[2026-05-28 04:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2026-05-28 04:34:29] [INFO ] Added : 73 causal constraints over 16 iterations in 854 ms. Result :sat
Minimization took 172 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:29] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-28 04:34:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-28 04:34:30] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:30] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:30] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 9 ms to minimize.
[2026-05-28 04:34:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2026-05-28 04:34:30] [INFO ] Computed and/alt/rep : 104/256/104 causal constraints (skipped 208 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 11 ms to minimize.
[2026-05-28 04:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2026-05-28 04:34:31] [INFO ] Added : 78 causal constraints over 17 iterations in 638 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 313/313 transitions.
Graph (complete) has 480 edges and 145 vertex of which 140 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 140 transition count 282
Reduce places removed 27 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 1 with 29 rules applied. Total rules applied 58 place count 113 transition count 280
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 112 transition count 278
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 111 transition count 277
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 63 place count 111 transition count 272
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 73 place count 106 transition count 272
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 103 place count 76 transition count 234
Iterating global reduction 4 with 30 rules applied. Total rules applied 133 place count 76 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 133 place count 76 transition count 232
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 74 transition count 232
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 177 place count 54 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 179 place count 54 transition count 209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 187 place count 50 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 197 place count 50 transition count 207
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 201 place count 48 transition count 230
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 206 place count 48 transition count 225
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 211 place count 43 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 43 transition count 223
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 43 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 217 place count 41 transition count 221
Applied a total of 217 rules in 95 ms. Remains 41 /145 variables (removed 104) and now considering 221/313 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 41/145 places, 221/313 transitions.
[2026-05-28 04:34:32] [INFO ] Flow matrix only has 186 transitions (discarded 35 similar events)
// Phase 1: matrix 186 rows 41 cols
[2026-05-28 04:34:32] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (224651 resets) in 3528 ms. (283 steps per ms)
FORMULA MedleyA-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (41557 resets) in 922 ms. (1083 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-28 04:34:36] [INFO ] Flatten gal took : 68 ms
[2026-05-28 04:34:36] [INFO ] Flatten gal took : 21 ms
[2026-05-28 04:34:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16316434766176144085.gal : 14 ms
[2026-05-28 04:34:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17424064339983805195.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/ReachabilityCardinality16316434766176144085.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17424064339983805195.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 17688 ms.

BK_STOP 1779942876905

--------------------
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="MedleyA-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is MedleyA-PT-09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r191-oct2-177969025600021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-09.tgz
mv MedleyA-PT-09 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;