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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 46K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716489985210

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 18:46:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 18:46:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:46:26] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-23 18:46:26] [INFO ] Transformed 117 places.
[2024-05-23 18:46:26] [INFO ] Transformed 218 transitions.
[2024-05-23 18:46:26] [INFO ] Found NUPN structural information;
[2024-05-23 18:46:26] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 18:46:26] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2024-05-23 18:46:26] [INFO ] Computed 14 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (523 resets) in 31 ms. (312 steps per ms)
FORMULA HealthRecord-PT-01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (418 resets) in 46 ms. (1063 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-23 18:46:26] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
[2024-05-23 18:46:26] [INFO ] Invariant cache hit.
[2024-05-23 18:46:26] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-23 18:46:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 18 ms returned sat
[2024-05-23 18:46:26] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-23 18:46:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 18:46:26] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 18:46:27] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 21 ms.
[2024-05-23 18:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:46:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:46:27] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 15 ms.
[2024-05-23 18:46:27] [INFO ] Added : 15 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 81 ms.
[2024-05-23 18:46:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:46:27] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 17 ms to minimize.
[2024-05-23 18:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:46:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-23 18:46:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 18:46:27] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 6 ms to minimize.
[2024-05-23 18:46:27] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-23 18:46:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-05-23 18:46:27] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 19 ms.
[2024-05-23 18:46:27] [INFO ] Added : 19 causal constraints over 5 iterations in 122 ms. Result :sat
Minimization took 67 ms.
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-23 18:46:28] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 14 ms.
[2024-05-23 18:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:46:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:46:28] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 16 ms.
[2024-05-23 18:46:28] [INFO ] Added : 17 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 77 ms.
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 15 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 18:46:28] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 13 ms.
[2024-05-23 18:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:46:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:46:28] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 16 ms.
[2024-05-23 18:46:28] [INFO ] Added : 17 causal constraints over 4 iterations in 75 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:46:28] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:46:29] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-23 18:46:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:46:29] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 13 ms.
[2024-05-23 18:46:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 18:46:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-23 18:46:29] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 18:46:29] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-23 18:46:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 18:46:29] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-23 18:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 18:46:29] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 21 ms.
[2024-05-23 18:46:29] [INFO ] Added : 17 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 213/213 transitions.
Graph (trivial) has 165 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 401 edges and 110 vertex of which 80 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 80 transition count 96
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 119 place count 36 transition count 52
Iterating global reduction 1 with 44 rules applied. Total rules applied 163 place count 36 transition count 52
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 163 place count 36 transition count 50
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 167 place count 34 transition count 50
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 175 place count 26 transition count 42
Iterating global reduction 1 with 8 rules applied. Total rules applied 183 place count 26 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 186 place count 26 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 25 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 25 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 25 transition count 37
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 3 with 4 rules applied. Total rules applied 193 place count 23 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 22 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 21 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 198 place count 21 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 200 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 19 transition count 29
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 19 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 18 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 18 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 18 transition count 26
Applied a total of 207 rules in 45 ms. Remains 18 /117 variables (removed 99) and now considering 26/213 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 18/117 places, 26/213 transitions.
// Phase 1: matrix 26 rows 18 cols
[2024-05-23 18:46:29] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (125453 resets) in 522 ms. (1912 steps per ms)
FORMULA HealthRecord-PT-01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (42376 resets) in 248 ms. (4016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4037 ms.
ITS solved all properties within timeout

BK_STOP 1716489990384

--------------------
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 UpperBounds -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-01"
export BK_EXAMINATION="UpperBounds"
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-01, examination is UpperBounds"
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-171640602100701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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