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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 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 69K 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-10-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716490906144

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:01:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:01:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:01:47] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-23 19:01:47] [INFO ] Transformed 158 places.
[2024-05-23 19:01:47] [INFO ] Transformed 333 transitions.
[2024-05-23 19:01:47] [INFO ] Found NUPN structural information;
[2024-05-23 19:01:47] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2515 resets) in 2079 ms. (19 steps per ms) remains 6/14 properties
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (337 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (337 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (324 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 675 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (292 resets) in 513 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (319 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
[2024-05-23 19:01:48] [INFO ] Flow matrix only has 294 transitions (discarded 12 similar events)
// Phase 1: matrix 294 rows 158 cols
[2024-05-23 19:01:48] [INFO ] Computed 18 invariants in 11 ms
[2024-05-23 19:01:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem HealthRecord-PT-10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 25/120 variables, 10/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 25/130 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 38/158 variables, 8/138 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 38/176 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 293/451 variables, 158/334 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/452 variables, 1/335 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/452 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 335 constraints, problems are : Problem set: 1 solved, 5 unsolved in 677 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 55/102 variables, 10/57 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 55/112 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:49] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 12 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/114 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 56/158 variables, 8/123 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 56/179 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 1 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 1 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-23 19:01:50] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 11/190 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 2/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/196 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 2/198 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:01:51] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 7/205 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 293/451 variables, 158/363 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 5/368 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:01:52] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 3/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/452 variables, 1/372 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:53] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:01:53] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 2/374 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 0/374 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 19:01:53] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/452 variables, 1/375 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/452 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/452 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 375 constraints, problems are : Problem set: 1 solved, 5 unsolved in 4539 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: 5/6 constraints, Known Traps: 35/35 constraints]
After SMT, in 5349ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 499 ms.
Support contains 30 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Graph (trivial) has 154 edges and 158 vertex of which 8 / 158 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 666 edges and 154 vertex of which 148 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 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 148 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 146 transition count 279
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 144 transition count 277
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 76 place count 82 transition count 154
Iterating global reduction 3 with 62 rules applied. Total rules applied 138 place count 82 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 82 transition count 153
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 146 place count 75 transition count 139
Iterating global reduction 4 with 7 rules applied. Total rules applied 153 place count 75 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 160 place count 75 transition count 132
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 164 place count 73 transition count 130
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 174 place count 68 transition count 149
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 176 place count 68 transition count 147
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 193 place count 68 transition count 147
Applied a total of 193 rules in 58 ms. Remains 68 /158 variables (removed 90) and now considering 147/306 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 68/158 places, 147/306 transitions.
RANDOM walk for 40000 steps (3322 resets) in 1041 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (594 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (551 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (474 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 999422 steps, run visited all 3 properties in 1241 ms. (steps per millisecond=805 )
Probabilistic random walk after 999422 steps, saw 146731 distinct states, run finished after 1254 ms. (steps per millisecond=796 ) properties seen :3
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9184 ms.
ITS solved all properties within timeout

BK_STOP 1716490916565

--------------------
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-10"
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-10, 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-171640602300774"
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 [ "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 ;