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

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
994.243 19989.00 59327.00 135.90 F 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.r160-tall-177961080100413.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 StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-tall-177961080100413
=====================================================================

--------------------
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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1779703049615

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-05-25 09:57:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-25 09:57:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:57:31] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-25 09:57:31] [INFO ] Transformed 453 places.
[2026-05-25 09:57:31] [INFO ] Transformed 594 transitions.
[2026-05-25 09:57:31] [INFO ] Found NUPN structural information;
[2026-05-25 09:57:31] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 180 ms.
Graph (trivial) has 535 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 3 ms
Free SCC test removed 32 places
Structural test allowed to assert that 201 places are NOT stable. Took 21 ms.
Ensure Unique test removed 35 transitions
Reduce redundant transitions removed 35 transitions.
[2026-05-25 09:57:31] [INFO ] Flatten gal took : 156 ms
[2026-05-25 09:57:31] [INFO ] Flatten gal took : 76 ms
[2026-05-25 09:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16444896881713446052.gal : 42 ms
[2026-05-25 09:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16435723025418915426.prop : 3 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/ReachabilityCardinality16444896881713446052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16435723025418915426.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (398 resets) in 2276 ms. (17 steps per ms) remains 207/252 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 207/207 properties
Loading property file /tmp/ReachabilityCardinality16435723025418915426.prop.
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 207/207 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 207/207 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 207/207 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 207/207 properties
SDD proceeding with computation,252 properties remain. new max is 4
SDD size :1 after 5
[2026-05-25 09:57:32] [INFO ] Flow matrix only has 543 transitions (discarded 16 similar events)
// Phase 1: matrix 543 rows 421 cols
[2026-05-25 09:57:32] [INFO ] Computed 14 invariants in 17 ms
SDD proceeding with computation,252 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,252 properties remain. new max is 16
SDD size :11 after 24
[2026-05-25 09:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,252 properties remain. new max is 32
SDD size :24 after 48
SDD proceeding with computation,252 properties remain. new max is 64
SDD size :48 after 138
SDD proceeding with computation,252 properties remain. new max is 128
SDD size :138 after 2442
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,252 properties remain. new max is 256
SDD size :2442 after 1.40863e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 59/266 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 59/274 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s8 1.0)
(s9 (/ 1.0 2.0))
(s12 (/ 1.0 242.0))
(s14 (/ 1.0 242.0))
(s16 (/ 1.0 242.0))
(s18 (/ 1.0 242.0))
(s19 (/ 1.0 242.0))
(s20 (/ 1.0 242.0))
(s21 (/ 1.0 242.0))
(s22 (/ 1.0 242.0))
(s23 (/ 1.0 242.0))
(s24 (/ 1.0 242.0))
(s25 (/ 1.0 242.0))
(s26 (/ 1.0 242.0))
(s27 (/ 1.0 242.0))
(s28 (/ 1.0 242.0))
(s29 (/ 1.0 242.0))
(s30 (/ 1.0 242.0))
(s31 (/ 1.0 242.0))
(s32 (/ 1.0 242.0))
(s33 (/ 1.0 242.0))
(s34 (/ 1.0 242.0))
(s35 (/ 1.0 242.0))
(s36 (/ 1.0 242.0))
(s37 (/ 1.0 242.0))
(s38 (/ 1.0 242.0))
(s39 (/ 1.0 242.0))
(s40 (/ 1.0 242.0))
(s41 (/ 1.0 242.0))
(s42 (/ 1.0 242.0))
(s43 (/ 1.0 242.0))
(s44 (/ 1.0 242.0))
(s45 (/ 1.0 242.0))
(s46 (/ 1.0 242.0))
(s47 (/ 1.0 242.0))
(s50 (/ 1.0 242.0))
(s51 (/ 1.0 242.0))
(s55 (/ 1.0 242.0))
(s56 (/ 1.0 242.0))
(s57 (/ 1.0 242.0))
(s58 (/ 1.0 242.0))
(s89 1.0)
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 242.0))
(s95 (/ 1.0 242.0))
(s96 (/ 1.0 242.0))
(s97 (/ 1.0 242.0))
(s98 (/ 1.0 242.0))
(s99 (/ 1.0 242.0))
(s100 (/ 1.0 242.0))
(s101 (/ 1.0 242.0))
(s104 (/ 1.0 242.0))
(s105 (/ 1.0 242.0))
(s123 1.0)
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 242.0))
(s129 (/ 1.0 242.0))
(s130 (/ 1.0 242.0))
(s131 (/ 1.0 242.0))
(s132 (/ 1.0 242.0))
(s133 (/ 1.0 242.0))
(s134 (/ 1.0 242.0))
(s135 (/ 1.0 242.0))
(s138 (/ 1.0 242.0))
(s139 (/ 1.0 242.0))
(s157 1.0)
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 242.0))
(s163 (/ 1.0 242.0))
(s164 (/ 1.0 242.0))
(s165 (/ 1.0 242.0))
(s166 (/ 1.0 242.0))
(s167 (/ 1.0 242.0))
(s168 (/ 1.0 242.0))
(s169 (/ 1.0 242.0))
(s172 (/ 1.0 242.0))
(s173 (/ 1.0 242.0))
(s191 (/ 1.0 2.0))
(s192 1.0)
(s193 (/ 1.0 242.0))
(s201 (/ 1.0 242.0))
(s202 (/ 1.0 242.0))
(s206 (/ 1.0 242.0))
(s207 (/ 1.0 242.0))
(s223 (/ 1.0 2.0))
(s224 1.0)
(s225 (/ 1.0 242.0))
(s233 (/ 1.0 242.0))
(s234 (/ 1.0 242.0))
(s238 (/ 1.0 242.0))
(s239 (/ 1.0 242.0))
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 (/ 95.0 121.0))
(s255 (/ 1.0 242.0))
(s256 (/ 1.0 242.0))
(s257 (/ 1.0 242.0))
(s258 (/ 1.0 242.0))
(s259 (/ 1.0 242.0))
(s260 (/ 1.0 242.0))
(s261 (/ 1.0 242.0))
(s262 (/ 1.0 242.0))
(s263 (/ 1.0 242.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/964 variables, and 274 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5042 ms.
Refiners :[Domain max(s): 266/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 59/266 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 59/274 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:39] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:39] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:40] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:41] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:42] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:42] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 09:57:42] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/964 variables, and 294 constraints, problems are : Problem set: 0 solved, 207 unsolved in 5013 ms.
Refiners :[Domain max(s): 266/421 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/207 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10171ms problems are : Problem set: 0 solved, 207 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 207 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 559/559 transitions.
Graph (complete) has 820 edges and 421 vertex of which 414 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 414 transition count 421
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 135 rules applied. Total rules applied 267 place count 293 transition count 407
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 274 place count 286 transition count 407
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 274 place count 286 transition count 398
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 292 place count 277 transition count 398
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 324 place count 261 transition count 382
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 336 place count 255 transition count 438
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 350 place count 255 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 357 place count 255 transition count 417
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 367 place count 255 transition count 407
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 377 place count 245 transition count 407
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 378 place count 245 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 379 place count 244 transition count 406
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 380 place count 244 transition count 405
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 399 place count 244 transition count 405
Applied a total of 399 rules in 96 ms. Remains 244 /421 variables (removed 177) and now considering 405/559 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 244/421 places, 405/559 transitions.
RANDOM walk for 4000000 steps (291757 resets) in 25996 ms. (153 steps per ms) remains 0/207 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 254 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 18578 ms.

BK_STOP 1779703069604

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="StableMarking"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r160-tall-177961080100413"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;