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

About the Execution of 2025-gold for HealthRecord-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
412.712 20677.00 31446.00 142.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r159-tall-177961079800079.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 HealthRecord-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-tall-177961079800079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:44 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 71K 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 HealthRecord-PT-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779707540940

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 11:12:22] [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-25 11:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:12:22] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2026-05-25 11:12:22] [INFO ] Transformed 160 places.
[2026-05-25 11:12:22] [INFO ] Transformed 340 transitions.
[2026-05-25 11:12:22] [INFO ] Found NUPN structural information;
[2026-05-25 11:12:22] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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]
[2026-05-25 11:12:22] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2026-05-25 11:12:22] [INFO ] Computed 18 invariants in 10 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 (720 resets) in 41 ms. (238 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (614 resets) in 63 ms. (1093 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-25 11:12:22] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
[2026-05-25 11:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:22] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2026-05-25 11:12:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-25 11:12:22] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-25 11:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:12:22] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2026-05-25 11:12:22] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 30 ms.
[2026-05-25 11:12: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-25 11:12:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:23] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 27 ms.
[2026-05-25 11:12:23] [INFO ] Added : 26 causal constraints over 6 iterations in 118 ms. Result :sat
Minimization took 138 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:23] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2026-05-25 11:12: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-25 11:12:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 11:12:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:23] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 23 ms.
[2026-05-25 11:12:23] [INFO ] Added : 18 causal constraints over 5 iterations in 93 ms. Result :sat
Minimization took 135 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:24] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2026-05-25 11:12:24] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 34 ms.
[2026-05-25 11:12:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:24] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2026-05-25 11:12:24] [INFO ] Added : 21 causal constraints over 5 iterations in 88 ms. Result :sat
Minimization took 136 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:24] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:12:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:25] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 15 ms.
[2026-05-25 11:12:25] [INFO ] Added : 14 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:25] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:25] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 17 ms to minimize.
[2026-05-25 11:12: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-25 11:12:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 11:12:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:25] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:25] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:25] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:25] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 5 ms to minimize.
[2026-05-25 11:12:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2026-05-25 11:12:25] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 25 ms.
[2026-05-25 11:12:26] [INFO ] Added : 14 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 152 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:26] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:12: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-25 11:12:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:12:26] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 16 ms.
[2026-05-25 11:12:26] [INFO ] Added : 22 causal constraints over 6 iterations in 110 ms. Result :sat
Minimization took 144 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:26] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 11:12:26] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:12:26] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 14 ms.
[2026-05-25 11:12:26] [INFO ] Added : 18 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 143 ms.
[2026-05-25 11:12: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-25 11:12:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:12:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2026-05-25 11:12:27] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 11:12:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:12:27] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 13 ms.
[2026-05-25 11:12:27] [INFO ] Added : 16 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 137 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 HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 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 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 241 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output 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 0 with 3 rules applied. Total rules applied 5 place count 147 transition count 288
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 144 transition count 283
Reduce places removed 2 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 4 rules applied. Total rules applied 17 place count 142 transition count 281
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 19 place count 141 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 141 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 140 transition count 279
Discarding 82 places :
Symmetric choice reduction at 4 with 82 rule applications. Total rules 103 place count 58 transition count 115
Iterating global reduction 4 with 82 rules applied. Total rules applied 185 place count 58 transition count 115
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 194 place count 49 transition count 97
Iterating global reduction 4 with 9 rules applied. Total rules applied 203 place count 49 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 212 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 214 place count 47 transition count 82
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 47 transition count 82
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 218 place count 45 transition count 78
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 45 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 226 place count 45 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 236 place count 40 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 40 transition count 107
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 241 place count 40 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 245 place count 36 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 36 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 36 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 250 place count 35 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 253 place count 35 transition count 213
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 254 place count 34 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 255 place count 34 transition count 172
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 256 place count 33 transition count 170
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 33 transition count 170
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 272 place count 33 transition count 155
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 284 place count 33 transition count 155
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 294 place count 33 transition count 155
Applied a total of 294 rules in 99 ms. Remains 33 /160 variables (removed 127) and now considering 155/312 (removed 157) transitions.
Running 139 sub problems to find dead transitions.
[2026-05-25 11:12:27] [INFO ] Flow matrix only has 113 transitions (discarded 42 similar events)
// Phase 1: matrix 113 rows 33 cols
[2026-05-25 11:12:27] [INFO ] Computed 9 invariants in 1 ms
[2026-05-25 11:12:27] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 2/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 4 (OVERLAPS) 113/146 variables, 33/42 constraints. Problems are: Problem set: 11 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 27/69 constraints. Problems are: Problem set: 11 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:28] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/71 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/71 constraints. Problems are: Problem set: 13 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 71 constraints, problems are : Problem set: 13 solved, 126 unsolved in 3611 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 126 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 3/32 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 2/3 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 8/11 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 13 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 113/146 variables, 33/44 constraints. Problems are: Problem set: 13 solved, 126 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 27/71 constraints. Problems are: Problem set: 15 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 124/195 constraints. Problems are: Problem set: 15 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/195 constraints. Problems are: Problem set: 15 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/146 variables, 0/195 constraints. Problems are: Problem set: 15 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 195 constraints, problems are : Problem set: 15 solved, 124 unsolved in 7705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 124/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11505ms problems are : Problem set: 15 solved, 124 unsolved
Search for dead transitions found 15 dead transitions in 11516ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/160 places, 140/312 transitions.
Graph (complete) has 133 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 31 /33 variables (removed 2) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11637 ms. Remains : 31/160 places, 140/312 transitions.
[2026-05-25 11:12:39] [INFO ] Flow matrix only has 98 transitions (discarded 42 similar events)
// Phase 1: matrix 98 rows 31 cols
[2026-05-25 11:12:39] [INFO ] Computed 9 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (97621 resets) in 1562 ms. (639 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (17947 resets) in 462 ms. (2159 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-25 11:12:41] [INFO ] Flatten gal took : 50 ms
[2026-05-25 11:12:41] [INFO ] Flatten gal took : 14 ms
[2026-05-25 11:12:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3740386778516427122.gal : 8 ms
[2026-05-25 11:12:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6602119027670992569.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/ReachabilityCardinality3740386778516427122.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6602119027670992569.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 19372 ms.

BK_STOP 1779707561617

--------------------
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="HealthRecord-PT-12"
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 HealthRecord-PT-12, 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 r159-tall-177961079800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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