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.r191-tall-167838876200057.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 gold2022
Input is FlexibleBarrier-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876200057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K 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 FlexibleBarrier-PT-04b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678564561646

Running Version 202205111006
[2023-03-11 19:56:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 19:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:56:03] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-11 19:56:03] [INFO ] Transformed 268 places.
[2023-03-11 19:56:03] [INFO ] Transformed 305 transitions.
[2023-03-11 19:56:03] [INFO ] Found NUPN structural information;
[2023-03-11 19:56:03] [INFO ] Parsed PT model containing 268 places and 305 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 305 rows 268 cols
[2023-03-11 19:56:03] [INFO ] Computed 6 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :11
FORMULA FlexibleBarrier-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
// Phase 1: matrix 305 rows 268 cols
[2023-03-11 19:56:03] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-11 19:56:03] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-11 19:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:03] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-11 19:56:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:56:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-11 19:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:04] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-11 19:56:04] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 16 ms to minimize.
[2023-03-11 19:56:04] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 1 ms to minimize.
[2023-03-11 19:56:04] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2023-03-11 19:56:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2023-03-11 19:56:04] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 17 ms.
[2023-03-11 19:56:05] [INFO ] Added : 247 causal constraints over 50 iterations in 1186 ms. Result :sat
Minimization took 81 ms.
[2023-03-11 19:56:06] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-11 19:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:06] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-11 19:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:56:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-11 19:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:06] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-11 19:56:06] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 1 ms to minimize.
[2023-03-11 19:56:06] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2023-03-11 19:56:06] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 0 ms to minimize.
[2023-03-11 19:56:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2023-03-11 19:56:06] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 30 ms.
[2023-03-11 19:56:08] [INFO ] Deduced a trap composed of 145 places in 104 ms of which 1 ms to minimize.
[2023-03-11 19:56:08] [INFO ] Deduced a trap composed of 125 places in 87 ms of which 1 ms to minimize.
[2023-03-11 19:56:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-03-11 19:56:08] [INFO ] Added : 272 causal constraints over 55 iterations in 1627 ms. Result :sat
Minimization took 103 ms.
[2023-03-11 19:56:08] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-11 19:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:08] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-11 19:56:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:56:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-11 19:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:08] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-11 19:56:08] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2023-03-11 19:56:08] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2023-03-11 19:56:08] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 1 ms to minimize.
[2023-03-11 19:56:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2023-03-11 19:56:08] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 15 ms.
[2023-03-11 19:56:10] [INFO ] Added : 255 causal constraints over 51 iterations in 1291 ms. Result :sat
Minimization took 86 ms.
[2023-03-11 19:56:10] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-11 19:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:10] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-11 19:56:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 19:56:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-11 19:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 19:56:10] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-11 19:56:10] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 1 ms to minimize.
[2023-03-11 19:56:10] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 0 ms to minimize.
[2023-03-11 19:56:11] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2023-03-11 19:56:11] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 0 ms to minimize.
[2023-03-11 19:56:11] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 0 ms to minimize.
[2023-03-11 19:56:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 486 ms
[2023-03-11 19:56:11] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 17 ms.
[2023-03-11 19:56:12] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 1 ms to minimize.
[2023-03-11 19:56:12] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2023-03-11 19:56:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-11 19:56:12] [INFO ] Added : 272 causal constraints over 55 iterations in 1637 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 250 edges and 268 vertex of which 26 / 268 are part of one of the 4 SCC in 7 ms
Free SCC test removed 22 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 246 transition count 203
Reduce places removed 75 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 153 place count 171 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 169 transition count 201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 155 place count 169 transition count 189
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 179 place count 157 transition count 189
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 248 place count 88 transition count 120
Iterating global reduction 3 with 69 rules applied. Total rules applied 317 place count 88 transition count 120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 317 place count 88 transition count 114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 329 place count 82 transition count 114
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 333 place count 82 transition count 110
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 342 place count 73 transition count 101
Iterating global reduction 4 with 9 rules applied. Total rules applied 351 place count 73 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 360 place count 73 transition count 92
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 396 place count 55 transition count 74
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 400 place count 55 transition count 70
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 404 place count 51 transition count 66
Iterating global reduction 6 with 4 rules applied. Total rules applied 408 place count 51 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 410 place count 50 transition count 83
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 432 place count 50 transition count 61
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 91 edges and 28 vertex of which 15 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 32 rules applied. Total rules applied 464 place count 15 transition count 52
Drop transitions removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 499 place count 15 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 500 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 10 edges and 12 vertex of which 4 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 8 with 5 rules applied. Total rules applied 505 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 511 place count 8 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 511 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 515 place count 6 transition count 8
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 10 with 4 rules applied. Total rules applied 519 place count 4 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 521 place count 4 transition count 4
Applied a total of 521 rules in 76 ms. Remains 4 /268 variables (removed 264) and now considering 4/305 (removed 301) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/268 places, 4/305 transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 19:56:13] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 2) seen :2
FORMULA FlexibleBarrier-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10608 ms.

BK_STOP 1678564573807

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is FlexibleBarrier-PT-04b, 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 r191-tall-167838876200057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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