About the Execution of 2025-gold for HealthRecord-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 659.207 | 44198.00 | 60654.00 | 368.60 | 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-177961079800083.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-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-tall-177961079800083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:45 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 125K 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-16-UpperBounds-00
FORMULA_NAME HealthRecord-PT-16-UpperBounds-01
FORMULA_NAME HealthRecord-PT-16-UpperBounds-02
FORMULA_NAME HealthRecord-PT-16-UpperBounds-03
FORMULA_NAME HealthRecord-PT-16-UpperBounds-04
FORMULA_NAME HealthRecord-PT-16-UpperBounds-05
FORMULA_NAME HealthRecord-PT-16-UpperBounds-06
FORMULA_NAME HealthRecord-PT-16-UpperBounds-07
FORMULA_NAME HealthRecord-PT-16-UpperBounds-08
FORMULA_NAME HealthRecord-PT-16-UpperBounds-09
FORMULA_NAME HealthRecord-PT-16-UpperBounds-10
FORMULA_NAME HealthRecord-PT-16-UpperBounds-11
FORMULA_NAME HealthRecord-PT-16-UpperBounds-12
FORMULA_NAME HealthRecord-PT-16-UpperBounds-13
FORMULA_NAME HealthRecord-PT-16-UpperBounds-14
FORMULA_NAME HealthRecord-PT-16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779707569260
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 11:12:50] [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:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:12:50] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2026-05-25 11:12:50] [INFO ] Transformed 453 places.
[2026-05-25 11:12:50] [INFO ] Transformed 594 transitions.
[2026-05-25 11:12:50] [INFO ] Found NUPN structural information;
[2026-05-25 11:12:50] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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 594 rows 453 cols
[2026-05-25 11:12:50] [INFO ] Computed 14 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 (35 resets) in 64 ms. (153 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (189 resets) in 96 ms. (1134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 11:12:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:51] [INFO ] [Real]Absence check using 8 positive place invariants in 32 ms returned sat
[2026-05-25 11:12:51] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 23 ms returned sat
[2026-05-25 11:12:51] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2026-05-25 11:12:51] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 41 ms.
[2026-05-25 11:12:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 22 ms returned sat
[2026-05-25 11:12:52] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:12:52] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2026-05-25 11:12:52] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 38 ms.
[2026-05-25 11:12:54] [INFO ] Added : 230 causal constraints over 46 iterations in 1700 ms. Result :sat
Minimization took 500 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:55] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2026-05-25 11:12:55] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 13 ms returned sat
[2026-05-25 11:12:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2026-05-25 11:12:55] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 37 ms.
[2026-05-25 11:12: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-25 11:12:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:12:55] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2026-05-25 11:12:56] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-25 11:12:56] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 31 ms.
[2026-05-25 11:12:56] [INFO ] Added : 46 causal constraints over 10 iterations in 351 ms. Result :sat
Minimization took 452 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:12:57] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-25 11:12:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:12:57] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:57] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 42 ms to minimize.
[2026-05-25 11:12:57] [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:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:12:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:12:57] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:58] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:12:58] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 43 ms to minimize.
[2026-05-25 11:12:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2026-05-25 11:12:58] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 11:12:59] [INFO ] Added : 232 causal constraints over 47 iterations in 1500 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:00] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2026-05-25 11:13:00] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2026-05-25 11:13:00] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-25 11:13:00] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 45 ms.
[2026-05-25 11:13:01] [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:13:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:13:01] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2026-05-25 11:13:01] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-25 11:13:01] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2026-05-25 11:13:01] [INFO ] Added : 41 causal constraints over 9 iterations in 309 ms. Result :sat
Minimization took 461 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:02] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-25 11:13:02] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 18 ms returned sat
[2026-05-25 11:13:02] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:02] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 39 ms to minimize.
[2026-05-25 11:13:02] [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:13:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:13:02] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:02] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:03] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 47 ms to minimize.
[2026-05-25 11:13:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2026-05-25 11:13:03] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 33 ms.
[2026-05-25 11:13:04] [INFO ] Added : 225 causal constraints over 45 iterations in 1364 ms. Result :sat
Minimization took 505 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:05] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-25 11:13:05] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 18 ms returned sat
[2026-05-25 11:13:05] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:05] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 34 ms to minimize.
[2026-05-25 11:13:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-25 11:13:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:05] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:06] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 36 ms to minimize.
[2026-05-25 11:13:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2026-05-25 11:13:06] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 26 ms.
[2026-05-25 11:13:06] [INFO ] Added : 104 causal constraints over 21 iterations in 701 ms. Result :sat
Minimization took 482 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:07] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2026-05-25 11:13:07] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2026-05-25 11:13:07] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2026-05-25 11:13:07] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 29 ms.
[2026-05-25 11:13:07] [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:13:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:13:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2026-05-25 11:13:08] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2026-05-25 11:13:08] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 27 ms.
[2026-05-25 11:13:09] [INFO ] Added : 232 causal constraints over 47 iterations in 1440 ms. Result :sat
Minimization took 504 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:10] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2026-05-25 11:13:10] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:10] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:10] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 10 ms to minimize.
[2026-05-25 11:13:10] [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:13:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-25 11:13:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 16 ms returned sat
[2026-05-25 11:13:10] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2026-05-25 11:13:11] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 11:13:11] [INFO ] Added : 92 causal constraints over 19 iterations in 661 ms. Result :sat
Minimization took 487 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:12] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2026-05-25 11:13:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 16 ms returned sat
[2026-05-25 11:13:12] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-25 11:13:12] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 11:13:12] [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:13:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-25 11:13:12] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2026-05-25 11:13:12] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-25 11:13:12] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 26 ms.
[2026-05-25 11:13:14] [INFO ] Added : 196 causal constraints over 40 iterations in 1237 ms. Result :sat
Minimization took 475 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:14] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2026-05-25 11:13:14] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:14] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2026-05-25 11:13:14] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 30 ms.
[2026-05-25 11:13:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:13:15] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:15] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2026-05-25 11:13:15] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 29 ms.
[2026-05-25 11:13:18] [INFO ] Added : 269 causal constraints over 55 iterations in 2473 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:13:18] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2026-05-25 11:13:18] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:18] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2026-05-25 11:13:19] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 31 ms.
[2026-05-25 11:13:19] [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:13:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2026-05-25 11:13:19] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 17 ms returned sat
[2026-05-25 11:13:19] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2026-05-25 11:13:19] [INFO ] Computed and/alt/rep : 551/663/551 causal constraints (skipped 42 transitions) in 28 ms.
[2026-05-25 11:13:21] [INFO ] Added : 235 causal constraints over 47 iterations in 1643 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 522 edges and 453 vertex of which 47 / 453 are part of one of the 16 SCC in 3 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 822 edges and 422 vertex of which 408 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 408 transition count 320
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 249 rules applied. Total rules applied 469 place count 190 transition count 289
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 485 place count 177 transition count 286
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 488 place count 174 transition count 286
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 488 place count 174 transition count 277
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 506 place count 165 transition count 277
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 561 place count 110 transition count 168
Iterating global reduction 4 with 55 rules applied. Total rules applied 616 place count 110 transition count 168
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 623 place count 103 transition count 154
Iterating global reduction 4 with 7 rules applied. Total rules applied 630 place count 103 transition count 154
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 635 place count 98 transition count 149
Iterating global reduction 4 with 5 rules applied. Total rules applied 640 place count 98 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 641 place count 98 transition count 148
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 643 place count 96 transition count 144
Iterating global reduction 5 with 2 rules applied. Total rules applied 645 place count 96 transition count 144
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 647 place count 94 transition count 140
Iterating global reduction 5 with 2 rules applied. Total rules applied 649 place count 94 transition count 140
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 650 place count 93 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 651 place count 93 transition count 138
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 699 place count 69 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 704 place count 69 transition count 109
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 718 place count 62 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 723 place count 62 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 726 place count 62 transition count 152
Free-agglomeration rule applied 17 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 743 place count 62 transition count 133
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 760 place count 45 transition count 133
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 763 place count 45 transition count 130
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 776 place count 45 transition count 130
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 787 place count 45 transition count 130
Applied a total of 787 rules in 97 ms. Remains 45 /453 variables (removed 408) and now considering 130/594 (removed 464) transitions.
Running 114 sub problems to find dead transitions.
[2026-05-25 11:13:22] [INFO ] Flow matrix only has 117 transitions (discarded 13 similar events)
// Phase 1: matrix 117 rows 45 cols
[2026-05-25 11:13:22] [INFO ] Computed 6 invariants in 1 ms
[2026-05-25 11:13:22] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 3 (OVERLAPS) 117/162 variables, 45/51 constraints. Problems are: Problem set: 12 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 15/66 constraints. Problems are: Problem set: 12 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:23] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Problem TDEAD114 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/67 constraints. Problems are: Problem set: 13 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:13:24] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/68 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/68 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/68 constraints. Problems are: Problem set: 13 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 68 constraints, problems are : Problem set: 13 solved, 101 unsolved in 4235 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 13 solved, 101 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 4/45 variables, 6/6 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 117/162 variables, 45/52 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 15/67 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 101/168 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/169 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/169 constraints. Problems are: Problem set: 13 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/169 constraints. Problems are: Problem set: 13 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 169 constraints, problems are : Problem set: 13 solved, 101 unsolved in 5356 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 101/114 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9717ms problems are : Problem set: 13 solved, 101 unsolved
Search for dead transitions found 13 dead transitions in 9728ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/453 places, 117/594 transitions.
Graph (complete) has 157 edges and 45 vertex of which 42 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 42 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 41 transition count 114
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 41 transition count 114
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 41 transition count 114
Applied a total of 11 rules in 17 ms. Remains 41 /45 variables (removed 4) and now considering 114/117 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9853 ms. Remains : 41/453 places, 114/594 transitions.
[2026-05-25 11:13:31] [INFO ] Flow matrix only has 101 transitions (discarded 13 similar events)
// Phase 1: matrix 101 rows 41 cols
[2026-05-25 11:13:31] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (28716 resets) in 640 ms. (1560 steps per ms)
FORMULA HealthRecord-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (20933 resets) in 436 ms. (2288 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:13:33] [INFO ] Flatten gal took : 39 ms
[2026-05-25 11:13:33] [INFO ] Flatten gal took : 12 ms
[2026-05-25 11:13:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11829749404613880688.gal : 8 ms
[2026-05-25 11:13:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3257590819559416403.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/ReachabilityCardinality11829749404613880688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3257590819559416403.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 42747 ms.
BK_STOP 1779707613458
--------------------
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="HealthRecord-PT-16"
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-16, 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-177961079800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 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 '
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 ;
