fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r179-tall-171640602300758
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for HealthRecord-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
362.476 8328.00 20016.00 48.00 TTFTFFFFTTFTTFFT normal

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-171640602300758.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-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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-08-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716490708175

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:58:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 18:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:58:29] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-23 18:58:29] [INFO ] Transformed 156 places.
[2024-05-23 18:58:29] [INFO ] Transformed 326 transitions.
[2024-05-23 18:58:29] [INFO ] Found NUPN structural information;
[2024-05-23 18:58:29] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2240 resets) in 1358 ms. (29 steps per ms) remains 8/11 properties
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 339 ms. (117 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (288 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (296 resets) in 854 ms. (46 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (292 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (301 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (276 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (292 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (287 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
[2024-05-23 18:58:30] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2024-05-23 18:58:30] [INFO ] Computed 18 invariants in 10 ms
[2024-05-23 18:58:30] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HealthRecord-PT-08-ReachabilityCardinality-2024-10 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 28/131 variables, 10/113 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 28/141 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/156 variables, 8/149 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 25/174 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 287/443 variables, 156/330 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/331 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/444 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 331 constraints, problems are : Problem set: 1 solved, 7 unsolved in 756 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 33/127 variables, 10/104 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 33/137 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 18:58:31] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 15 ms to minimize.
[2024-05-23 18:58:31] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 3 ms to minimize.
[2024-05-23 18:58:31] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:58:31] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:31] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 7/144 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/147 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem HealthRecord-PT-08-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 29/156 variables, 8/156 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 29/185 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 12 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 18:58:32] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
Problem HealthRecord-PT-08-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 16/201 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 18:58:33] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 7/208 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 1/209 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 3/212 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 287/443 variables, 156/368 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/443 variables, 5/373 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/443 variables, 1/374 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-23 18:58:34] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/443 variables, 2/376 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 0/376 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1/444 variables, 1/377 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/444 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/444 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 377 constraints, problems are : Problem set: 3 solved, 5 unsolved in 3928 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 41/41 constraints]
After SMT, in 4835ms problems are : Problem set: 3 solved, 5 unsolved
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 342 ms.
Support contains 30 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 146 edges and 156 vertex of which 6 / 156 are part of one of the 3 SCC in 3 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 656 edges and 153 vertex of which 146 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 146 transition count 280
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 145 transition count 278
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 144 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 144 transition count 276
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 10 place count 143 transition count 276
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 76 place count 77 transition count 144
Iterating global reduction 3 with 66 rules applied. Total rules applied 142 place count 77 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 70 transition count 130
Iterating global reduction 3 with 7 rules applied. Total rules applied 156 place count 70 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 161 place count 70 transition count 125
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 171 place count 65 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 65 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 175 place count 65 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 64 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 64 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 63 transition count 156
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 181 place count 63 transition count 156
Applied a total of 181 rules in 76 ms. Remains 63 /156 variables (removed 93) and now considering 156/300 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 63/156 places, 156/300 transitions.
RANDOM walk for 40000 steps (8 resets) in 593 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 237415 steps, run visited all 1 properties in 274 ms. (steps per millisecond=866 )
Probabilistic random walk after 237415 steps, saw 33493 distinct states, run finished after 278 ms. (steps per millisecond=854 ) properties seen :1
FORMULA HealthRecord-PT-08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7141 ms.
ITS solved all properties within timeout

BK_STOP 1716490716503

--------------------
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-08"
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-08, 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-171640602300758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 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 ;