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.r179-tall-171640602300766.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 greatspnxred
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 r179-tall-171640602300766
=====================================================================

--------------------
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 1716490807145

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:00:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:00:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:00:08] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-23 19:00:08] [INFO ] Transformed 157 places.
[2024-05-23 19:00:08] [INFO ] Transformed 327 transitions.
[2024-05-23 19:00:08] [INFO ] Found NUPN structural information;
[2024-05-23 19:00:08] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 180 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 (2356 resets) in 2622 ms. (15 steps per ms) remains 12/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-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (351 resets) in 471 ms. (84 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (356 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (353 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (358 resets) in 723 ms. (55 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (357 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (353 resets) in 120 ms. (330 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (350 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (358 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (38 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (368 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
[2024-05-23 19:00:10] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2024-05-23 19:00:10] [INFO ] Computed 18 invariants in 8 ms
[2024-05-23 19:00:10] [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 1096 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-05-23 19:00:11] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 11 ms to minimize.
[2024-05-23 19:00:11] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:00:11] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:00:11] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:00:11] [INFO ] Deduced a trap composed of 47 places in 38 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-05-23 19:00:11] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:00:11] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 38 places in 55 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-05-23 19:00:12] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 47 places in 36 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-05-23 19:00:12] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 26 places in 27 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-05-23 19:00:12] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 38 places in 37 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-05-23 19:00:12] [INFO ] Deduced a trap composed of 22 places in 35 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-05-23 19:00:12] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:00:12] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 2 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 30 places in 42 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-05-23 19:00:13] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/208 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:13] [INFO ] Deduced a trap composed of 38 places in 49 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-05-23 19:00:14] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 46 places in 49 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-05-23 19:00:14] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 30 places in 33 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-05-23 19:00:14] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:00:14] [INFO ] Deduced a trap composed of 39 places in 44 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-05-23 19:00:14] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:00:15] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:00:15] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:00:15] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:00:15] [INFO ] Deduced a trap composed of 31 places in 37 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 4739 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 6109ms 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-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 788 ms.
Support contains 61 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 102 edges and 157 vertex of which 6 / 157 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 659 edges and 154 vertex of which 150 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output 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 2 rules applied. Total rules applied 4 place count 150 transition count 280
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 148 transition count 278
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 148 transition count 276
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 145 transition count 276
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 64 place count 94 transition count 174
Iterating global reduction 2 with 51 rules applied. Total rules applied 115 place count 94 transition count 174
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 2 with 2 rules applied. Total rules applied 117 place count 93 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 91 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 91 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 122 place count 91 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 90 transition count 183
Applied a total of 124 rules in 111 ms. Remains 90 /157 variables (removed 67) and now considering 183/301 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 90/157 places, 183/301 transitions.
RANDOM walk for 40000 steps (4591 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (866 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (861 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 937033 steps, run visited all 2 properties in 1541 ms. (steps per millisecond=608 )
Probabilistic random walk after 937033 steps, saw 123914 distinct states, run finished after 1550 ms. (steps per millisecond=604 ) properties seen :2
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 10551 ms.
ITS solved all properties within timeout

BK_STOP 1716490818899

--------------------
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="greatspnxred"
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 greatspnxred"
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 r179-tall-171640602300766"
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 ;