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-177969025500004.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 Medical-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025500004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.4K Mar 7 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 7 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:22 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 3.1M 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 Medical-PT-08-UpperBounds-00
FORMULA_NAME Medical-PT-08-UpperBounds-01
FORMULA_NAME Medical-PT-08-UpperBounds-02
FORMULA_NAME Medical-PT-08-UpperBounds-03
FORMULA_NAME Medical-PT-08-UpperBounds-04
FORMULA_NAME Medical-PT-08-UpperBounds-05
FORMULA_NAME Medical-PT-08-UpperBounds-06
FORMULA_NAME Medical-PT-08-UpperBounds-07
FORMULA_NAME Medical-PT-08-UpperBounds-08
FORMULA_NAME Medical-PT-08-UpperBounds-09
FORMULA_NAME Medical-PT-08-UpperBounds-10
FORMULA_NAME Medical-PT-08-UpperBounds-11
FORMULA_NAME Medical-PT-08-UpperBounds-12
FORMULA_NAME Medical-PT-08-UpperBounds-13
FORMULA_NAME Medical-PT-08-UpperBounds-14
FORMULA_NAME Medical-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942832603

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:33:54] [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:33:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:33:54] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2026-05-28 04:33:54] [INFO ] Transformed 312 places.
[2026-05-28 04:33:54] [INFO ] Transformed 5431 transitions.
[2026-05-28 04:33:54] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 591 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 242 places in 43 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2026-05-28 04:33:55] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2026-05-28 04:33:55] [INFO ] Computed 10 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0] Max Struct:[1, 1, 1, 1]
FORMULA Medical-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10006 steps (55 resets) in 46 ms. (212 steps per ms)
FORMULA Medical-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (11 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:33:55] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2026-05-28 04:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-28 04:33: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-28 04:33:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-28 04:33:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-28 04:33:55] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:55] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:55] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:55] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
[2026-05-28 04:33:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 18 ms.
[2026-05-28 04:33:56] [INFO ] Added : 13 causal constraints over 4 iterations in 154 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 69 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place x0_AA_q5) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 221/221 transitions.
Graph (complete) has 339 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 209
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 65 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 65 transition count 201
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 62 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 61 transition count 201
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 61 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 59 transition count 199
Applied a total of 15 rules in 68 ms. Remains 59 /69 variables (removed 10) and now considering 199/221 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 59/69 places, 199/221 transitions.
[2026-05-28 04:33:56] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
// Phase 1: matrix 155 rows 59 cols
[2026-05-28 04:33:56] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000006 steps (2 resets) in 651 ms. (1533 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 590 ms. (1692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:33:57] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-28 04:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:33:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-28 04:33:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:33:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-28 04:33:57] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-28 04:33:57] [INFO ] [Nat]Added 53 Read/Feed constraints in 41 ms returned sat
[2026-05-28 04:33:57] [INFO ] Computed and/alt/rep : 110/536/109 causal constraints (skipped 45 transitions) in 14 ms.
[2026-05-28 04:33:57] [INFO ] Added : 6 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 199/199 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-05-28 04:33:57] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-28 04:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:33:58] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-28 04:33:58] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-28 04:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:33:58] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-28 04:33:58] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:33:58] [INFO ] Redundant transitions in 5 ms returned []
Running 198 sub problems to find dead transitions.
[2026-05-28 04:33:58] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-28 04:33:58] [INFO ] Invariant cache hit.
[2026-05-28 04:33:58] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:59] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/214 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 198 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 121 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/214 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 198/319 constraints. Problems are: Problem set: 42 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:13] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:13] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:13] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:13] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 5/324 constraints. Problems are: Problem set: 42 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:17] [INFO ] Deduced a trap along path composed of 4 places in 44 ms of which 12 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:17] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/326 constraints. Problems are: Problem set: 43 solved, 155 unsolved
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 10 places in 64 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/327 constraints. Problems are: Problem set: 43 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:23] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/328 constraints. Problems are: Problem set: 43 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:26] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
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 10 places in 35 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 2/330 constraints. Problems are: Problem set: 43 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:30] [INFO ] Deduced a trap along path composed of 6 places in 66 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 1/331 constraints. Problems are: Problem set: 48 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:34] [INFO ] Deduced a trap composed of 2 places in 106 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:34] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/214 variables, and 333 constraints, problems are : Problem set: 48 solved, 150 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 37293ms problems are : Problem set: 48 solved, 150 unsolved
Search for dead transitions found 48 dead transitions in 37328ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/59 places, 151/199 transitions.
Reduce places removed 11 places and 58 transitions.
Graph (complete) has 167 edges and 48 vertex of which 1 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 93 output transitions
Drop transitions (Output transitions of discarded places.) removed 93 transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 12 rules in 2 ms. Remains 1 /59 variables (removed 58) and now considering 0/151 (removed 151) transitions.
[2026-05-28 04:34:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-28 04:34:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:34:35] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/59 places, 0/199 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37807 ms. Remains : 1/59 places, 0/199 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 41438 ms.

BK_STOP 1779942875799

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Medical-PT-08"
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 Medical-PT-08, 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-177969025500004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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