fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r105-smll-174867012800393
Last Updated
June 24, 2025

About the Execution of ITS-Tools for HealthRecord-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 15731.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/mcc2025-input.r105-smll-174867012800393.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is HealthRecord-PT-12, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-smll-174867012800393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 71K May 29 14:32 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 1748739719814

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-01 01:02:02] [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]
[2025-06-01 01:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:02:02] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2025-06-01 01:02:02] [INFO ] Transformed 160 places.
[2025-06-01 01:02:02] [INFO ] Transformed 340 transitions.
[2025-06-01 01:02:02] [INFO ] Found NUPN structural information;
[2025-06-01 01:02:02] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 380 ms.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 6 ms
Free SCC test removed 4 places
Structural test allowed to assert that 31 places are NOT stable. Took 40 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
[2025-06-01 01:02:03] [INFO ] Flatten gal took : 154 ms
[2025-06-01 01:02:03] [INFO ] Flatten gal took : 68 ms
RANDOM walk for 40000 steps (3234 resets) in 3123 ms. (12 steps per ms) remains 58/129 properties
BEST_FIRST walk for 4004 steps (36 resets) in 42 ms. (93 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (37 resets) in 37 ms. (105 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (38 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (35 resets) in 44 ms. (88 steps per ms) remains 58/58 properties
[2025-06-01 01:02:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10513047352184645118.gal : 53 ms
BEST_FIRST walk for 4002 steps (35 resets) in 53 ms. (74 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (35 resets) in 51 ms. (76 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (38 resets) in 52 ms. (75 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (35 resets) in 36 ms. (108 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 40 ms. (97 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (35 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
[2025-06-01 01:02:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17136444406342571681.prop : 4 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/ReachabilityCardinality10513047352184645118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17136444406342571681.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (36 resets) in 40 ms. (97 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (37 resets) in 81 ms. (48 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (36 resets) in 37 ms. (105 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (37 resets) in 29 ms. (133 steps per ms) remains 57/57 properties

its-reach command run as :

BEST_FIRST walk for 4003 steps (36 resets) in 40 ms. (97 steps per ms) remains 56/57 properties
/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
BEST_FIRST walk for 4003 steps (40 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 27 ms. (143 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (36 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
Loading property file /tmp/ReachabilityCardinality17136444406342571681.prop.
BEST_FIRST walk for 4004 steps (34 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 81 ms. (48 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (35 resets) in 27 ms. (143 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (36 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
SDD proceeding with computation,57 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4003 steps (34 resets) in 26 ms. (148 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (38 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
SDD proceeding with computation,57 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,57 properties remain. new max is 16
SDD size :4 after 19
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
SDD proceeding with computation,57 properties remain. new max is 32
BEST_FIRST walk for 4003 steps (38 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
SDD size :19 after 487
SDD proceeding with computation,57 properties remain. new max is 64
SDD size :487 after 4375
BEST_FIRST walk for 4004 steps (37 resets) in 36 ms. (108 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (35 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (36 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (39 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (34 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (37 resets) in 35 ms. (111 steps per ms) remains 44/55 properties
BEST_FIRST walk for 4003 steps (38 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (34 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
[2025-06-01 01:02:04] [INFO ] Flow matrix only has 292 transitions (discarded 16 similar events)
// Phase 1: matrix 292 rows 156 cols
[2025-06-01 01:02:04] [INFO ] Computed 18 invariants in 20 ms
[2025-06-01 01:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,57 properties remain. new max is 128
SDD size :4375 after 11665
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,57 properties remain. new max is 256
SDD size :11665 after 13123
SDD proceeding with computation,57 properties remain. new max is 512
SDD size :13123 after 16039
SDD proceeding with computation,57 properties remain. new max is 1024
SDD size :16039 after 20413
SDD proceeding with computation,57 properties remain. new max is 2048
SDD size :20413 after 48601
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
SDD proceeding with computation,57 properties remain. new max is 4096
SDD size :48601 after 111205
At refinement iteration 2 (OVERLAPS) 54/96 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 60/156 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 60/174 constraints. Problems are: Problem set: 0 solved, 42 unsolved
SDD proceeding with computation,57 properties remain. new max is 8192
SDD size :111205 after 239815
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 291/447 variables, 156/330 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Invariant property smplace_53 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_34 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_22 does not hold.
SDD proceeding with computation,51 properties remain. new max is 8192
SDD size :239815 after 968023
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 1/448 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 40 unsolved
SDD proceeding with computation,51 properties remain. new max is 16384
SDD size :968023 after 1.68617e+06
At refinement iteration 12 (OVERLAPS) 0/448 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 331 constraints, problems are : Problem set: 2 solved, 40 unsolved in 2679 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 40 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 54/94 variables, 10/50 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 54/104 constraints. Problems are: Problem set: 2 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:08] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:08] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:08] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:08] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:08] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:08] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,51 properties remain. new max is 32768
SDD size :1.68617e+06 after 4.91444e+06
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:09] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 16/120 constraints. Problems are: Problem set: 2 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 4/124 constraints. Problems are: Problem set: 2 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:10] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/126 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/126 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 62/156 variables, 8/134 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 62/196 constraints. Problems are: Problem set: 2 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:11] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 10 ms to minimize.
Invariant property smplace_143 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_122 does not hold.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:12] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property smplace_52 does not hold.
Invariant property smplace_47 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_44 does not hold.
Invariant property smplace_43 does not hold.
Invariant property smplace_33 does not hold.
[2025-06-01 01:02:12] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 13 ms to minimize.
Invariant property smplace_28 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_25 does not hold.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property smplace_24 does not hold.
Invariant property smplace_14 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
Invariant property smplace_6 does not hold.
[2025-06-01 01:02:12] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:12] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property smplace_5 does not hold.
SDD proceeding with computation,27 properties remain. new max is 32768
SDD size :4.91444e+06 after 2.33382e+07
[2025-06-01 01:02:12] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:02:12] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 11 ms to minimize.
SMT process timed out in 7833ms, After SMT, problems are : Problem set: 26 solved, 16 unsolved
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 308/308 transitions.
Graph (complete) has 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 147 transition count 289
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 145 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 144 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 144 transition count 285
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 143 transition count 285
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 92 place count 70 transition count 139
Iterating global reduction 3 with 73 rules applied. Total rules applied 165 place count 70 transition count 139
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 65 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 65 transition count 129
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 184 place count 65 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 192 place count 61 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 195 place count 61 transition count 145
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 201 place count 61 transition count 139
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 207 place count 55 transition count 139
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 227 place count 55 transition count 139
Applied a total of 227 rules in 137 ms. Remains 55 /156 variables (removed 101) and now considering 139/308 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 55/156 places, 139/308 transitions.
RANDOM walk for 461634 steps (33772 resets) in 4689 ms. (98 steps per ms) remains 0/16 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
Total runtime 12885 ms.

BK_STOP 1748739735545

--------------------
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="HealthRecord-PT-12"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-12, 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 r105-smll-174867012800393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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