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.r261-smll-167863536200333.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 itstools
Input is NoC3x3-PT-7B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536200333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 09:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 130K Feb 26 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 5 18:23 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 NoC3x3-PT-7B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678900546681

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 17:15:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 17:15:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 17:15:51] [INFO ] Load time of PNML (sax parser for PT used): 864 ms
[2023-03-15 17:15:51] [INFO ] Transformed 7014 places.
[2023-03-15 17:15:51] [INFO ] Transformed 8833 transitions.
[2023-03-15 17:15:51] [INFO ] Found NUPN structural information;
[2023-03-15 17:15:51] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 1144 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 8833 rows 7014 cols
[2023-03-15 17:15:51] [INFO ] Computed 66 place invariants in 127 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 16) seen :6
FORMULA NoC3x3-PT-7B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
[2023-03-15 17:15:52] [INFO ] Invariant cache hit.
[2023-03-15 17:15:55] [INFO ] [Real]Absence check using 66 positive place invariants in 613 ms returned sat
[2023-03-15 17:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:15:57] [INFO ] [Real]Absence check using state equation in 1874 ms returned unknown
[2023-03-15 17:15:59] [INFO ] [Real]Absence check using 66 positive place invariants in 402 ms returned sat
[2023-03-15 17:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:02] [INFO ] [Real]Absence check using state equation in 2861 ms returned unknown
[2023-03-15 17:16:04] [INFO ] [Real]Absence check using 66 positive place invariants in 368 ms returned sat
[2023-03-15 17:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:07] [INFO ] [Real]Absence check using state equation in 2687 ms returned unknown
[2023-03-15 17:16:09] [INFO ] [Real]Absence check using 66 positive place invariants in 355 ms returned sat
[2023-03-15 17:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:12] [INFO ] [Real]Absence check using state equation in 2784 ms returned unknown
[2023-03-15 17:16:14] [INFO ] [Real]Absence check using 66 positive place invariants in 354 ms returned sat
[2023-03-15 17:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:17] [INFO ] [Real]Absence check using state equation in 3008 ms returned unknown
[2023-03-15 17:16:19] [INFO ] [Real]Absence check using 66 positive place invariants in 331 ms returned sat
[2023-03-15 17:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:22] [INFO ] [Real]Absence check using state equation in 3075 ms returned unknown
[2023-03-15 17:16:24] [INFO ] [Real]Absence check using 66 positive place invariants in 441 ms returned sat
[2023-03-15 17:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:27] [INFO ] [Real]Absence check using state equation in 2874 ms returned unknown
[2023-03-15 17:16:29] [INFO ] [Real]Absence check using 66 positive place invariants in 360 ms returned sat
[2023-03-15 17:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:32] [INFO ] [Real]Absence check using state equation in 2832 ms returned unknown
[2023-03-15 17:16:34] [INFO ] [Real]Absence check using 66 positive place invariants in 391 ms returned sat
[2023-03-15 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:37] [INFO ] [Real]Absence check using state equation in 2892 ms returned unknown
[2023-03-15 17:16:39] [INFO ] [Real]Absence check using 66 positive place invariants in 347 ms returned sat
[2023-03-15 17:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 17:16:42] [INFO ] [Real]Absence check using state equation in 3089 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7802 edges and 7014 vertex of which 4835 / 7014 are part of one of the 33 SCC in 32 ms
Free SCC test removed 4802 places
Drop transitions removed 5887 transitions
Reduce isomorphic transitions removed 5887 transitions.
Drop transitions removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 375 rules applied. Total rules applied 376 place count 2212 transition count 2571
Reduce places removed 375 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 384 rules applied. Total rules applied 760 place count 1837 transition count 2562
Reduce places removed 6 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 2 with 10 rules applied. Total rules applied 770 place count 1831 transition count 2558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 772 place count 1829 transition count 2558
Discarding 761 places :
Symmetric choice reduction at 4 with 761 rule applications. Total rules 1533 place count 1068 transition count 1797
Iterating global reduction 4 with 761 rules applied. Total rules applied 2294 place count 1068 transition count 1797
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 2294 place count 1068 transition count 1735
Deduced a syphon composed of 62 places in 7 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 2418 place count 1006 transition count 1735
Discarding 489 places :
Symmetric choice reduction at 4 with 489 rule applications. Total rules 2907 place count 517 transition count 1021
Iterating global reduction 4 with 489 rules applied. Total rules applied 3396 place count 517 transition count 1021
Ensure Unique test removed 429 transitions
Reduce isomorphic transitions removed 429 transitions.
Iterating post reduction 4 with 429 rules applied. Total rules applied 3825 place count 517 transition count 592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3826 place count 516 transition count 590
Iterating global reduction 5 with 1 rules applied. Total rules applied 3827 place count 516 transition count 590
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3828 place count 515 transition count 589
Iterating global reduction 5 with 1 rules applied. Total rules applied 3829 place count 515 transition count 589
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3830 place count 514 transition count 588
Iterating global reduction 5 with 1 rules applied. Total rules applied 3831 place count 514 transition count 588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3832 place count 513 transition count 586
Iterating global reduction 5 with 1 rules applied. Total rules applied 3833 place count 513 transition count 586
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 15 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 4055 place count 402 transition count 475
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4057 place count 402 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4059 place count 401 transition count 472
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 4067 place count 397 transition count 486
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4070 place count 397 transition count 483
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 4083 place count 397 transition count 470
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4086 place count 394 transition count 467
Iterating global reduction 7 with 3 rules applied. Total rules applied 4089 place count 394 transition count 467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4091 place count 393 transition count 478
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 4094 place count 393 transition count 475
Free-agglomeration rule applied 202 times.
Iterating global reduction 7 with 202 rules applied. Total rules applied 4296 place count 393 transition count 273
Reduce places removed 202 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 517 edges and 191 vertex of which 57 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.1 ms
Discarding 134 places :
Also discarding 86 output transitions
Drop transitions removed 86 transitions
Iterating post reduction 7 with 240 rules applied. Total rules applied 4536 place count 57 transition count 150
Drop transitions removed 90 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 8 with 93 rules applied. Total rules applied 4629 place count 57 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4630 place count 57 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4631 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 117 edges and 56 vertex of which 48 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 9 with 2 rules applied. Total rules applied 4633 place count 48 transition count 51
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 4638 place count 48 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4639 place count 47 transition count 45
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 15 edges and 38 vertex of which 9 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 11 rules applied. Total rules applied 4650 place count 31 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 4663 place count 30 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4665 place count 29 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4666 place count 29 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 4667 place count 28 transition count 30
Applied a total of 4667 rules in 1123 ms. Remains 28 /7014 variables (removed 6986) and now considering 30/8833 (removed 8803) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1124 ms. Remains : 28/7014 places, 30/8833 transitions.
// Phase 1: matrix 30 rows 28 cols
[2023-03-15 17:16:43] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=880 ) properties (out of 10) seen :10
FORMULA NoC3x3-PT-7B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 54631 ms.

BK_STOP 1678900605745

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="NoC3x3-PT-7B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-7B, 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 r261-smll-167863536200333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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