Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r203-smll-167840349300277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is HealthRecord-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349300277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 67K Mar 5 18:22 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-06-UpperBounds-00
FORMULA_NAME HealthRecord-PT-06-UpperBounds-01
FORMULA_NAME HealthRecord-PT-06-UpperBounds-02
FORMULA_NAME HealthRecord-PT-06-UpperBounds-03
FORMULA_NAME HealthRecord-PT-06-UpperBounds-04
FORMULA_NAME HealthRecord-PT-06-UpperBounds-05
FORMULA_NAME HealthRecord-PT-06-UpperBounds-06
FORMULA_NAME HealthRecord-PT-06-UpperBounds-07
FORMULA_NAME HealthRecord-PT-06-UpperBounds-08
FORMULA_NAME HealthRecord-PT-06-UpperBounds-09
FORMULA_NAME HealthRecord-PT-06-UpperBounds-10
FORMULA_NAME HealthRecord-PT-06-UpperBounds-11
FORMULA_NAME HealthRecord-PT-06-UpperBounds-12
FORMULA_NAME HealthRecord-PT-06-UpperBounds-13
FORMULA_NAME HealthRecord-PT-06-UpperBounds-14
FORMULA_NAME HealthRecord-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678577791032

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-11 23:36:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 23:36:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:36:33] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-11 23:36:33] [INFO ] Transformed 154 places.
[2023-03-11 23:36:33] [INFO ] Transformed 319 transitions.
[2023-03-11 23:36:33] [INFO ] Found NUPN structural information;
[2023-03-11 23:36:33] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Normalized transition count is 282 out of 294 initially.
// Phase 1: matrix 282 rows 154 cols
[2023-03-11 23:36:33] [INFO ] Computed 18 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 505 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :11
FORMULA HealthRecord-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
[2023-03-11 23:36:34] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2023-03-11 23:36:34] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-11 23:36:34] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2023-03-11 23:36:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-11 23:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:34] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-11 23:36:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:36:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:35] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-11 23:36:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:36:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-11 23:36:35] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 48 ms.
[2023-03-11 23:36:35] [INFO ] Added : 11 causal constraints over 3 iterations in 181 ms. Result :sat
Minimization took 49 ms.
[2023-03-11 23:36:35] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:35] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-11 23:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:36:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:35] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-11 23:36:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-11 23:36:36] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 40 ms.
[2023-03-11 23:36:36] [INFO ] Added : 24 causal constraints over 6 iterations in 209 ms. Result :sat
Minimization took 31 ms.
[2023-03-11 23:36:36] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-11 23:36:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2023-03-11 23:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:36] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-11 23:36:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:36:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-11 23:36:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:36] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-11 23:36:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-11 23:36:36] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 8 ms to minimize.
[2023-03-11 23:36:36] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2023-03-11 23:36:37] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2023-03-11 23:36:37] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2023-03-11 23:36:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 482 ms
[2023-03-11 23:36:37] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 28 ms.
[2023-03-11 23:36:37] [INFO ] Added : 15 causal constraints over 3 iterations in 115 ms. Result :sat
Minimization took 30 ms.
[2023-03-11 23:36:37] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-11 23:36:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-03-11 23:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:37] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-11 23:36:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:36:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-11 23:36:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 23:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:37] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-11 23:36:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-11 23:36:37] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2023-03-11 23:36:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-11 23:36:37] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 36 ms.
[2023-03-11 23:36:38] [INFO ] Added : 13 causal constraints over 3 iterations in 132 ms. Result :sat
Minimization took 46 ms.
[2023-03-11 23:36:38] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-11 23:36:38] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 23:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:38] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-11 23:36:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:36:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-11 23:36:38] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 23:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:36:38] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-11 23:36:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-11 23:36:38] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 37 ms.
[2023-03-11 23:36:38] [INFO ] Added : 12 causal constraints over 4 iterations in 150 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 233 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 636 edges and 147 vertex of which 113 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.3 ms
Discarding 34 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Drop transitions removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 113 transition count 141
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 180 place count 40 transition count 68
Iterating global reduction 1 with 73 rules applied. Total rules applied 253 place count 40 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 253 place count 40 transition count 64
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 261 place count 36 transition count 64
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 270 place count 27 transition count 55
Iterating global reduction 1 with 9 rules applied. Total rules applied 279 place count 27 transition count 55
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 288 place count 27 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 290 place count 25 transition count 43
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 24 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 24 transition count 41
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 298 place count 24 transition count 38
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 4 with 4 rules applied. Total rules applied 302 place count 22 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 21 transition count 34
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 307 place count 19 transition count 33
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 316 place count 19 transition count 24
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 5 with 2 rules applied. Total rules applied 318 place count 18 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 319 place count 17 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 17 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 321 place count 17 transition count 21
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 324 place count 17 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 327 place count 14 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 328 place count 14 transition count 18
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 329 place count 14 transition count 17
Applied a total of 329 rules in 98 ms. Remains 14 /154 variables (removed 140) and now considering 17/294 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 14/154 places, 17/294 transitions.
// Phase 1: matrix 17 rows 14 cols
[2023-03-11 23:36:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 85736 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 2) seen :2
FORMULA HealthRecord-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6198 ms.
ITS solved all properties within timeout

BK_STOP 1678577801147

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is HealthRecord-PT-06, 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 r203-smll-167840349300277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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