About the Execution of ITS-Tools for DrinkVendingMachine-COL-16
| Execution Summary | |||||
| Max Memory Used (MB)  | 
      Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status  | 
   
| 184.571 | 2695.00 | 4000.00 | 30.50 | 64 16 16 16 64 16 16 16 64 16 16 16 16 16 16 64 | normal | 
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.r078-tall-165260110000245.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 DrinkVendingMachine-COL-16, examination is UpperBounds
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r078-tall-165260110000245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users  11K Apr 30 05:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 05:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:57 CTLFireability.txt
-rw-r--r-- 1 mcc users  56K Apr 30 05:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May  9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users  27K May  9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May  9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users  17K May  9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May  9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May  9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users    5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users    3 May 10 09:33 instance
-rw-r--r-- 1 mcc users    5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users  25K May 10 09:33 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 DrinkVendingMachine-COL-16-UpperBounds-00
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-01
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-02
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-03
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-04
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-05
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-06
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-07
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-08
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-09
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-10
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-11
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-12
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-13
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-14
FORMULA_NAME DrinkVendingMachine-COL-16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652654161670
Running Version 202205111006
[2022-05-15 22:36:02] [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] 
[2022-05-15 22:36:02] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2022-05-15 22:36:02] [INFO   ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet 
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 22:36:03] [WARNING] Using fallBack plugin, rng conformance not checked 
[2022-05-15 22:36:03] [INFO   ] Load time of PNML (colored model parsed with PNMLFW) : 563 ms 
[2022-05-15 22:36:03] [INFO   ] Imported 6 HL places and 7 HL transitions for a total of 192 PT places and 4473952.0 transition bindings in 16 ms. 
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2022-05-15 22:36:03] [INFO   ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms. 
[2022-05-15 22:36:03] [INFO   ] Skeletonized 16 HLPN properties in 0 ms. 
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 22:36:03] [INFO   ] Computed 3 place invariants in 7 ms 
FORMULA DrinkVendingMachine-COL-16-UpperBounds-15 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-UpperBounds-11 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-UpperBounds-10 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-UpperBounds-08 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-UpperBounds-07 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-UpperBounds-00 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 22:36:03] [INFO   ] Computed 3 place invariants in 1 ms 
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using  3 positive place invariants in 3 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using state equation in 7 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using state equation in 4 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 4 ms. 
[2022-05-15 22:36:03] [INFO   ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat 
Minimization took 10 ms.
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using state equation in 5 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using state equation in 4 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:03] [INFO   ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat 
Minimization took 4 ms.
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using  3 positive place invariants in 2 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using state equation in 5 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms. 
[2022-05-15 22:36:03] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using state equation in 3 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:03] [INFO   ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat 
Minimization took 2 ms.
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using state equation in 3 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms. 
[2022-05-15 22:36:03] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using state equation in 6 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms. 
[2022-05-15 22:36:03] [INFO   ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat 
Minimization took 5 ms.
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:03] [INFO   ] [Real]Absence check using state equation in 4 ms returned sat 
[2022-05-15 22:36:03] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:03] [INFO   ] [Nat]Absence check using  3 positive place invariants in 0 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using state equation in 3 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:04] [INFO   ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat 
Minimization took 5 ms.
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using state equation in 4 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using state equation in 3 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:04] [INFO   ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat 
Minimization took 3 ms.
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using state equation in 3 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:04] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using state equation in 5 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 0 ms. 
[2022-05-15 22:36:04] [INFO   ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat 
Minimization took 3 ms.
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using state equation in 3 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using state equation in 4 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 0 ms. 
[2022-05-15 22:36:04] [INFO   ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat 
Minimization took 3 ms.
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Real]Absence check using state equation in 4 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:04] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using  3 positive place invariants in 1 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-15 22:36:04] [INFO   ] [Nat]Absence check using state equation in 2 ms returned sat 
[2022-05-15 22:36:04] [INFO   ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms. 
[2022-05-15 22:36:04] [INFO   ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat 
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [16, 16, 64, 16, 16, 16, 16, 16, 16]
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:64) in guard (AND (GT $x 47) (LEQ $x 63))introduces in Quality(64) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:64) in guard (AND (GT $x 31) (LEQ $x 47))introduces in Quality(64) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:64) in guard (AND (GT $x 15) (LEQ $x 31))introduces in Quality(64) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:64) in guard (LEQ $x 15)introduces in Quality(64) partition with 2 elements
Sort wr.t. initial and guards Quality has partition Partition [nbSubs=4, partition=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]]
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 64 reducing to 4 values.
For transition elaborate3:(AND (GT $x 47) (LEQ $x 63)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 31) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 15) (LEQ $x 31)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 15) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 16
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 16
[2022-05-15 22:36:04] [INFO   ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 17 ms. 
[2022-05-15 22:36:04] [INFO   ] Unfolded 9 HLPN properties in 1 ms. 
Incomplete random walk after 10002  steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :170
FORMULA DrinkVendingMachine-COL-16-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-13 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-12 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-09 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-06 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-05 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-02 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-16-UpperBounds-01 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001  steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :64
FORMULA DrinkVendingMachine-COL-16-UpperBounds-04 64 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 1534 ms.
BK_STOP 1652654164365
--------------------
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="DrinkVendingMachine-COL-16"
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-4028"
echo "    Executing tool itstools"
echo "    Input is DrinkVendingMachine-COL-16, 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 r078-tall-165260110000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-16.tgz
mv DrinkVendingMachine-COL-16 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 '
		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 ;
