fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r192-oct2-177969025800163
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for MedleyA-PT-21

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 11450.00 0.00 0.00 F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r192-oct2-177969025800163.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2025
Input is MedleyA-PT-21, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r192-oct2-177969025800163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 70K 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 1780576875734

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-06-04 12:41:17] [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-06-04 12:41:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-04 12:41:17] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2026-06-04 12:41:17] [INFO ] Transformed 306 places.
[2026-06-04 12:41:17] [INFO ] Transformed 298 transitions.
[2026-06-04 12:41:17] [INFO ] Found NUPN structural information;
[2026-06-04 12:41:17] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 283 ms.
Graph (trivial) has 235 edges and 306 vertex of which 6 / 306 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Structural test allowed to assert that 171 places are NOT stable. Took 33 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
RANDOM walk for 40000 steps (8 resets) in 2053 ms. (19 steps per ms) remains 57/135 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
[2026-06-04 12:41:18] [INFO ] Flatten gal took : 88 ms
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
[2026-06-04 12:41:18] [INFO ] Flatten gal took : 33 ms
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
[2026-06-04 12:41:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality606431197015529196.gal : 23 ms
[2026-06-04 12:41:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4537496900080153853.prop : 1 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/ReachabilityCardinality606431197015529196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4537496900080153853.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 ...327
// Phase 1: matrix 293 rows 301 cols
[2026-06-04 12:41:18] [INFO ] Computed 20 invariants in 11 ms
Loading property file /tmp/ReachabilityCardinality4537496900080153853.prop.
[2026-06-04 12:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,57 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,57 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,57 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,57 properties remain. new max is 32
SDD size :14 after 88
SDD proceeding with computation,57 properties remain. new max is 64
SDD size :88 after 836
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Invariant property smplace_65 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_26 does not hold.
SDD proceeding with computation,54 properties remain. new max is 64
SDD size :836 after 10622
Invariant property smplace_75 does not hold.
Invariant property smplace_74 does not hold.
Invariant property smplace_73 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_54 does not hold.
Invariant property smplace_53 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_44 does not hold.
SDD proceeding with computation,46 properties remain. new max is 64
SDD size :10622 after 13342
Invariant property smplace_71 does not hold.
Invariant property smplace_70 does not hold.
Invariant property smplace_21 does not hold.
SDD proceeding with computation,43 properties remain. new max is 64
SDD size :13342 after 596470
SDD proceeding with computation,43 properties remain. new max is 128
SDD size :596470 after 1.12515e+07
Invariant property smplace_155 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
SDD proceeding with computation,37 properties remain. new max is 128
SDD size :1.12515e+07 after 1.71565e+08
Invariant property smplace_154 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_152 does not hold.
Invariant property smplace_103 does not hold.
SDD proceeding with computation,33 properties remain. new max is 128
SDD size :1.71565e+08 after 1.52525e+11
Invariant property smplace_237 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_208 does not hold.
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :1.52525e+11 after 2.32573e+12
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 177/234 variables, 14/71 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 177/248 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/248 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 67/301 variables, 6/254 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 67/321 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/321 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 292/593 variables, 301/622 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 0/622 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/594 variables, 1/623 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 0/623 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/594 variables, 0/623 constraints. Problems are: Problem set: 27 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 623 constraints, problems are : Problem set: 27 solved, 30 unsolved in 2795 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 301/301 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 30 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 127/157 variables, 10/40 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 127/167 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:22] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:22] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:22] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/174 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/174 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 144/301 variables, 10/184 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 144/328 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:23] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:24] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 7/335 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:24] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:24] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:24] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:24] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:24] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 5/340 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/340 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 292/593 variables, 301/641 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 30/671 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:25] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 1/672 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:26] [INFO ] Deduced a trap along path composed of 15 places in 25 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:26] [INFO ] Deduced a trap along path composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 2/674 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/594 variables, and 674 constraints, problems are : Problem set: 27 solved, 30 unsolved in 5008 ms.
Refiners :[Domain max(s): 301/301 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 301/301 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 30/57 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7870ms problems are : Problem set: 27 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 301 transition count 207
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 216 transition count 207
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 171 place count 216 transition count 183
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 219 place count 192 transition count 183
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 248 place count 163 transition count 154
Iterating global reduction 2 with 29 rules applied. Total rules applied 277 place count 163 transition count 154
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 277 place count 163 transition count 145
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 295 place count 154 transition count 145
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 363 place count 120 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 369 place count 117 transition count 134
Free-agglomeration rule applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 396 place count 117 transition count 107
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 425 place count 90 transition count 105
Applied a total of 425 rules in 100 ms. Remains 90 /301 variables (removed 211) and now considering 105/293 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 90/301 places, 105/293 transitions.
RANDOM walk for 23212 steps (679 resets) in 261 ms. (88 steps per ms) remains 0/30 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 137 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 9809 ms.

BK_STOP 1780576887184

--------------------
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//
++ 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 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="MedleyA-PT-21"
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-5348"
echo " Executing tool gold2025"
echo " Input is MedleyA-PT-21, 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 r192-oct2-177969025800163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;