Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604100766.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is HealthRecord-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100766
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717201285029

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:21:26] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-01 00:21:26] [INFO ] Transformed 157 places.
[2024-06-01 00:21:26] [INFO ] Transformed 327 transitions.
[2024-06-01 00:21:26] [INFO ] Found NUPN structural information;
[2024-06-01 00:21:26] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2350 resets) in 2181 ms. (18 steps per ms) remains 11/15 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (354 resets) in 769 ms. (51 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (347 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (353 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (355 resets) in 840 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (360 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (352 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (355 resets) in 44 ms. (888 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (360 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (15 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (360 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
[2024-06-01 00:21:27] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2024-06-01 00:21:28] [INFO ] Computed 18 invariants in 11 ms
[2024-06-01 00:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 16/148 variables, 10/142 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 16/158 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 3/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-13 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-09-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 9/157 variables, 5/166 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 9/175 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 288/445 variables, 157/332 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/446 variables, 1/333 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/333 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/446 variables, 0/333 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 333 constraints, problems are : Problem set: 4 solved, 6 unsolved in 803 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 35/118 variables, 10/93 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 35/128 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 10 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 5/133 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/136 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/138 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 2/140 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:29] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 2/142 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/143 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 39/157 variables, 8/151 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 39/190 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:21:30] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 17/207 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/208 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 4 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 3/211 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2024-06-01 00:21:31] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 5/216 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/157 variables, 4/220 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/157 variables, 5/225 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:32] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/157 variables, 5/230 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/157 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 288/445 variables, 157/387 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 6/393 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/445 variables, 0/393 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 1/446 variables, 1/394 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/446 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/446 variables, 0/394 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 394 constraints, problems are : Problem set: 4 solved, 6 unsolved in 4901 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 55/55 constraints]
After SMT, in 5948ms problems are : Problem set: 4 solved, 6 unsolved
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 695 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 224 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 653 edges and 151 vertex of which 142 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 142 transition count 270
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 136 transition count 264
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 136 transition count 261
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 131 transition count 261
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 106 place count 53 transition count 106
Iterating global reduction 2 with 78 rules applied. Total rules applied 184 place count 53 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 53 transition count 105
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 195 place count 43 transition count 85
Iterating global reduction 3 with 10 rules applied. Total rules applied 205 place count 43 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 214 place count 43 transition count 76
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 217 place count 40 transition count 67
Iterating global reduction 4 with 3 rules applied. Total rules applied 220 place count 40 transition count 67
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 223 place count 37 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 226 place count 37 transition count 61
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 235 place count 37 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 239 place count 35 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 251 place count 29 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 29 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 29 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 255 place count 28 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 258 place count 28 transition count 81
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 266 place count 28 transition count 81
Applied a total of 266 rules in 80 ms. Remains 28 /157 variables (removed 129) and now considering 81/301 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 28/157 places, 81/301 transitions.
RANDOM walk for 26683 steps (8671 resets) in 797 ms. (33 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8771 ms.
ITS solved all properties within timeout

BK_STOP 1717201294928

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-09, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604100766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-09.tgz
mv HealthRecord-PT-09 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;