Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300445.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.6K Apr 30 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 113K 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 AutoFlight-PT-05b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652661306583

Running Version 202205111006
[2022-05-16 00:35:07] [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-16 00:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:35:08] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2022-05-16 00:35:08] [INFO ] Transformed 482 places.
[2022-05-16 00:35:08] [INFO ] Transformed 480 transitions.
[2022-05-16 00:35:08] [INFO ] Found NUPN structural information;
[2022-05-16 00:35:08] [INFO ] Parsed PT model containing 482 places and 480 transitions in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 480 rows 482 cols
[2022-05-16 00:35:08] [INFO ] Computed 34 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :1
FORMULA AutoFlight-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
// Phase 1: matrix 480 rows 482 cols
[2022-05-16 00:35:08] [INFO ] Computed 34 place invariants in 4 ms
[2022-05-16 00:35:08] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-05-16 00:35:08] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:35:08] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-16 00:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:35:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-16 00:35:08] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:35:08] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 14 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 0 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2022-05-16 00:35:09] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 0 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 0 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-16 00:35:10] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1716 ms
[2022-05-16 00:35:10] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-16 00:35:13] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2022-05-16 00:35:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 00:35:13] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 00:35:13] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:35:14] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-05-16 00:35:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:35:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 00:35:14] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:35:14] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-05-16 00:35:14] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 29 ms.
[2022-05-16 00:35:17] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2022-05-16 00:35:17] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2022-05-16 00:35:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2022-05-16 00:35:17] [INFO ] Added : 449 causal constraints over 91 iterations in 2991 ms. Result :sat
Minimization took 155 ms.
[2022-05-16 00:35:17] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 00:35:17] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:35:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:35:17] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-05-16 00:35:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 00:35:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 00:35:17] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 00:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 00:35:18] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-16 00:35:18] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2022-05-16 00:35:18] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2022-05-16 00:35:18] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 1 ms to minimize.
[2022-05-16 00:35:18] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2022-05-16 00:35:18] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-16 00:35:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 623 ms
[2022-05-16 00:35:18] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 00:35:20] [INFO ] Added : 432 causal constraints over 87 iterations in 2131 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA AutoFlight-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 482 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 482/482 places, 479/479 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 481 transition count 291
Reduce places removed 188 places and 1 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 223 rules applied. Total rules applied 411 place count 293 transition count 255
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 421 place count 283 transition count 255
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 421 place count 283 transition count 188
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 555 place count 216 transition count 188
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 601 place count 170 transition count 142
Iterating global reduction 3 with 46 rules applied. Total rules applied 647 place count 170 transition count 142
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 647 place count 170 transition count 127
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 677 place count 155 transition count 127
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 751 place count 118 transition count 90
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 771 place count 118 transition count 70
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 791 place count 98 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 792 place count 97 transition count 69
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 46 rules applied. Total rules applied 838 place count 78 transition count 42
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 865 place count 51 transition count 42
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 865 place count 51 transition count 28
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 893 place count 37 transition count 28
Applied a total of 893 rules in 116 ms. Remains 37 /482 variables (removed 445) and now considering 28/479 (removed 451) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/482 places, 28/479 transitions.
// Phase 1: matrix 28 rows 37 cols
[2022-05-16 00:35:21] [INFO ] Computed 15 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 30833 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties (out of 1) seen :1
FORMULA AutoFlight-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14639 ms.

BK_STOP 1652661322550

--------------------
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="AutoFlight-PT-05b"
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 AutoFlight-PT-05b, 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 r006-tajo-165245689300445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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