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

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200615.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K 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 69K 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-00
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-01
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-02
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-03
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-04
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-05
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-06
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-07
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-08
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-09
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-10
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-11
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-12
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-13
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-14
FORMULA_NAME HealthRecord-PT-10-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749001981015

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 01:53:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 01:53:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:53:04] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2025-06-04 01:53:04] [INFO ] Transformed 158 places.
[2025-06-04 01:53:04] [INFO ] Transformed 333 transitions.
[2025-06-04 01:53:04] [INFO ] Found NUPN structural information;
[2025-06-04 01:53:04] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
[2025-06-04 01:53:05] [INFO ] Flatten gal took : 171 ms
RANDOM walk for 40000 steps (2528 resets) in 3546 ms. (11 steps per ms) remains 8/16 properties
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 01:53:05] [INFO ] Flatten gal took : 126 ms
[2025-06-04 01:53:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7861386297317777554.gal : 73 ms
BEST_FIRST walk for 40004 steps (230 resets) in 576 ms. (69 steps per ms) remains 8/8 properties
[2025-06-04 01:53:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10880167800145706631.prop : 8 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/ReachabilityCardinality7861386297317777554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10880167800145706631.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 ...329
Loading property file /tmp/ReachabilityCardinality10880167800145706631.prop.
BEST_FIRST walk for 40004 steps (323 resets) in 808 ms. (49 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :13 after 49
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :49 after 3889
BEST_FIRST walk for 40004 steps (349 resets) in 404 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (325 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (314 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (323 resets) in 737 ms. (54 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (321 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :3889 after 20737
BEST_FIRST walk for 40003 steps (236 resets) in 286 ms. (139 steps per ms) remains 8/8 properties
[2025-06-04 01:53:06] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2025-06-04 01:53:06] [INFO ] Computed 18 invariants in 26 ms
[2025-06-04 01:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :20737 after 23329
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :23329 after 28513
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :28513 after 38881
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :38881 after 145153
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HealthRecord-PT-10-ReachabilityFireability-2025-01 is UNSAT
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 18/135 variables, 10/127 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 18/145 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem HealthRecord-PT-10-ReachabilityFireability-2025-04 is UNSAT
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 23/158 variables, 8/153 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 23/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :145153 after 352705
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 293/451 variables, 158/334 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/452 variables, 1/335 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/335 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/452 variables, 0/335 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 335 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2519 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 28/131 variables, 10/113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 28/141 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:09] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:10] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:10] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:10] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:10] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 5/146 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/146 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 27/158 variables, 8/154 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 27/181 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:11] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:11] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:11] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 3/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:11] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/185 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:11] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:12] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:12] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 3/188 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:12] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:12] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:12] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:12] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:13] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:13] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 6/194 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :352705 after 1.63205e+06
At refinement iteration 13 (OVERLAPS) 293/451 variables, 158/352 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 2/354 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/452 variables, and 354 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5012 ms.
Refiners :[Domain max(s): 158/158 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 158/158 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7774ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 45 edges and 158 vertex of which 4 / 158 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 670 edges and 156 vertex of which 151 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 151 transition count 287
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 149 transition count 285
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 25 place count 132 transition count 251
Iterating global reduction 2 with 17 rules applied. Total rules applied 42 place count 132 transition count 251
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 132 transition count 251
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 132 transition count 251
Applied a total of 46 rules in 117 ms. Remains 132 /158 variables (removed 26) and now considering 251/306 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 132/158 places, 251/306 transitions.
RANDOM walk for 40000 steps (2850 resets) in 1314 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (397 resets) in 452 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (394 resets) in 114 ms. (347 steps per ms) remains 5/6 properties
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (388 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (390 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (405 resets) in 312 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (276 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
// Phase 1: matrix 251 rows 132 cols
[2025-06-04 01:53:15] [INFO ] Computed 13 invariants in 6 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 251/383 variables, 132/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 145 constraints, problems are : Problem set: 0 solved, 5 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:16] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:16] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:16] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:16] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 15/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:17] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:18] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:19] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:53:19] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 251/383 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 167 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5270ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 478 ms.
Support contains 38 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 251/251 transitions.
Graph (trivial) has 77 edges and 132 vertex of which 4 / 132 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 555 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 245
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 124 transition count 243
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 50 place count 82 transition count 159
Iterating global reduction 2 with 42 rules applied. Total rules applied 92 place count 82 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 79 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 79 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 79 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 78 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 77 transition count 150
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 77 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 76 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 76 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 75 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 75 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 74 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 74 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 114 place count 74 transition count 142
Applied a total of 114 rules in 39 ms. Remains 74 /132 variables (removed 58) and now considering 142/251 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 74/132 places, 142/251 transitions.
RANDOM walk for 40000 steps (3659 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (603 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1039468 steps, run visited all 1 properties in 1465 ms. (steps per millisecond=709 )
Probabilistic random walk after 1039468 steps, saw 136458 distinct states, run finished after 1471 ms. (steps per millisecond=706 ) properties seen :1
FORMULA HealthRecord-PT-10-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 19278 ms.

BK_STOP 1749002003063

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867008200615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;