Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998500159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 29 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 29 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 29 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 581K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654241529363

Running Version 202205111006
[2022-06-03 07:32:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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]
[2022-06-03 07:32:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 07:32:12] [INFO ] Load time of PNML (sax parser for PT used): 441 ms
[2022-06-03 07:32:12] [INFO ] Transformed 2117 places.
[2022-06-03 07:32:12] [INFO ] Transformed 2435 transitions.
[2022-06-03 07:32:12] [INFO ] Found NUPN structural information;
[2022-06-03 07:32:12] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 739 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 832 ms. (steps per millisecond=12 ) properties (out of 16) seen :8
FORMULA NoC3x3-PT-3B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2022-06-03 07:32:14] [INFO ] Computed 66 place invariants in 53 ms
[2022-06-03 07:32:16] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 07:32:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 96 ms returned sat
[2022-06-03 07:32:20] [INFO ] After 3076ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-06-03 07:32:21] [INFO ] Deduced a trap composed of 54 places in 555 ms of which 8 ms to minimize.
[2022-06-03 07:32:22] [INFO ] Deduced a trap composed of 61 places in 763 ms of which 4 ms to minimize.
[2022-06-03 07:32:23] [INFO ] Deduced a trap composed of 93 places in 619 ms of which 3 ms to minimize.
[2022-06-03 07:32:24] [INFO ] Deduced a trap composed of 98 places in 717 ms of which 2 ms to minimize.
[2022-06-03 07:32:24] [INFO ] Deduced a trap composed of 133 places in 565 ms of which 2 ms to minimize.
[2022-06-03 07:32:25] [INFO ] Deduced a trap composed of 116 places in 638 ms of which 2 ms to minimize.
[2022-06-03 07:32:26] [INFO ] Deduced a trap composed of 101 places in 514 ms of which 1 ms to minimize.
[2022-06-03 07:32:27] [INFO ] Deduced a trap composed of 86 places in 483 ms of which 2 ms to minimize.
[2022-06-03 07:32:27] [INFO ] Deduced a trap composed of 139 places in 551 ms of which 1 ms to minimize.
[2022-06-03 07:32:28] [INFO ] Deduced a trap composed of 120 places in 578 ms of which 1 ms to minimize.
[2022-06-03 07:32:29] [INFO ] Deduced a trap composed of 89 places in 558 ms of which 1 ms to minimize.
[2022-06-03 07:32:29] [INFO ] Deduced a trap composed of 128 places in 521 ms of which 1 ms to minimize.
[2022-06-03 07:32:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9057 ms
[2022-06-03 07:32:31] [INFO ] Deduced a trap composed of 61 places in 520 ms of which 1 ms to minimize.
[2022-06-03 07:32:32] [INFO ] Deduced a trap composed of 115 places in 334 ms of which 1 ms to minimize.
[2022-06-03 07:32:32] [INFO ] Deduced a trap composed of 52 places in 413 ms of which 2 ms to minimize.
[2022-06-03 07:32:33] [INFO ] Deduced a trap composed of 113 places in 306 ms of which 1 ms to minimize.
[2022-06-03 07:32:33] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 0 ms to minimize.
[2022-06-03 07:32:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2809 ms
[2022-06-03 07:32:34] [INFO ] After 17103ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1974 ms.
[2022-06-03 07:32:36] [INFO ] After 20527ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA NoC3x3-PT-3B-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
FORMULA NoC3x3-PT-3B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 7913 ms.
Support contains 20 out of 2117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1696 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 12 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 2049 transition count 1936
Reduce places removed 427 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 433 rules applied. Total rules applied 866 place count 1622 transition count 1930
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 877 place count 1619 transition count 1922
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 885 place count 1611 transition count 1922
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 885 place count 1611 transition count 1899
Deduced a syphon composed of 23 places in 9 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 931 place count 1588 transition count 1899
Discarding 363 places :
Symmetric choice reduction at 4 with 363 rule applications. Total rules 1294 place count 1225 transition count 1536
Iterating global reduction 4 with 363 rules applied. Total rules applied 1657 place count 1225 transition count 1536
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1657 place count 1225 transition count 1499
Deduced a syphon composed of 37 places in 12 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1731 place count 1188 transition count 1499
Discarding 131 places :
Symmetric choice reduction at 4 with 131 rule applications. Total rules 1862 place count 1057 transition count 1334
Iterating global reduction 4 with 131 rules applied. Total rules applied 1993 place count 1057 transition count 1334
Discarding 132 places :
Symmetric choice reduction at 4 with 132 rule applications. Total rules 2125 place count 925 transition count 1186
Iterating global reduction 4 with 132 rules applied. Total rules applied 2257 place count 925 transition count 1186
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 2310 place count 872 transition count 1094
Iterating global reduction 4 with 53 rules applied. Total rules applied 2363 place count 872 transition count 1094
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 20 rules applied. Total rules applied 2383 place count 870 transition count 1076
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2385 place count 868 transition count 1076
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 2422 place count 831 transition count 1039
Iterating global reduction 6 with 37 rules applied. Total rules applied 2459 place count 831 transition count 1039
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 2465 place count 828 transition count 1036
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2468 place count 825 transition count 1036
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 2494 place count 799 transition count 984
Iterating global reduction 8 with 26 rules applied. Total rules applied 2520 place count 799 transition count 984
Discarding 26 places :
Symmetric choice reduction at 8 with 26 rule applications. Total rules 2546 place count 773 transition count 958
Iterating global reduction 8 with 26 rules applied. Total rules applied 2572 place count 773 transition count 958
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 32 rules applied. Total rules applied 2604 place count 770 transition count 929
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2607 place count 767 transition count 929
Performed 304 Post agglomeration using F-continuation condition.Transition count delta: 304
Deduced a syphon composed of 304 places in 0 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 10 with 608 rules applied. Total rules applied 3215 place count 463 transition count 625
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 3230 place count 448 transition count 610
Iterating global reduction 10 with 15 rules applied. Total rules applied 3245 place count 448 transition count 610
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 3256 place count 437 transition count 588
Iterating global reduction 10 with 11 rules applied. Total rules applied 3267 place count 437 transition count 588
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3269 place count 437 transition count 586
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3271 place count 435 transition count 580
Iterating global reduction 11 with 2 rules applied. Total rules applied 3273 place count 435 transition count 580
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 3309 place count 417 transition count 612
Free-agglomeration rule applied 27 times.
Iterating global reduction 11 with 27 rules applied. Total rules applied 3336 place count 417 transition count 585
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 34 rules applied. Total rules applied 3370 place count 390 transition count 578
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3371 place count 390 transition count 577
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3372 place count 390 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3373 place count 389 transition count 576
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 3375 place count 389 transition count 576
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 3377 place count 389 transition count 576
Applied a total of 3377 rules in 1109 ms. Remains 389 /2117 variables (removed 1728) and now considering 576/2435 (removed 1859) transitions.
Finished structural reductions, in 1 iterations. Remains : 389/2117 places, 576/2435 transitions.
Incomplete random walk after 1000000 steps, including 12455 resets, run finished after 4723 ms. (steps per millisecond=211 ) properties (out of 1) seen :0
Finished Best-First random walk after 144010 steps, including 100 resets, run visited all 1 properties in 338 ms. (steps per millisecond=426 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 38976 ms.

BK_STOP 1654241570878

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="NoC3x3-PT-3B"
export BK_EXAMINATION="ReachabilityFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-3B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998500159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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