Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_Philosophers-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-149441683200203
=====================================================================

--------------------
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 Philosophers-COL-000005-LTLCardinality-0
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-1
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-15
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-2
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-3
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-4
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-5
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-6
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-7
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-8
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496370338549


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)")))
Formula 0 simplified : !G"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.058203,23576,1,0,8,1821,23,5,654,1008,21
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)>=2")))
Formula 1 simplified : !F"((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.069081,23680,1,0,19,3027,32,16,668,2887,53
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=2"))
Formula 2 simplified : !"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=2"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.069966,23684,1,0,19,3027,35,16,674,2887,55
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(G(("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)>=3")U("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)")))))
Formula 3 simplified : !G("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)>=3" U "((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.074556,24508,1,0,19,3027,51,16,711,2887,62
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X(X(G("((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)>=3"))))))
Formula 4 simplified : !GXXG"((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)>=3"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.079594,24596,1,0,21,3192,57,18,735,3062,75
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)"))
Formula 5 simplified : !"((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.080563,24596,1,0,21,3192,60,18,746,3062,77
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=3"))
Formula 6 simplified : !"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=3"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.081286,24676,1,0,21,3192,63,18,752,3062,79
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=1")))
Formula 7 simplified : !G"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=1"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.092103,24828,1,0,23,3440,69,25,781,3589,114
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G("((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)"))))
Formula 8 simplified : !XG"((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)"
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.103225,24844,1,0,24,3501,75,28,928,3863,131
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(G(F("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)>=2")))))
Formula 9 simplified : !GF"((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.109982,24912,1,0,29,3958,84,33,944,4695,153
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=3")))
Formula 10 simplified : !F"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=3"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.110673,25016,1,0,29,3958,90,33,944,4695,155
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(F(F("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)"))))))
Formula 11 simplified : !GXF"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.119133,25072,1,0,31,4346,97,35,1019,5289,168
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)>=2"))
Formula 12 simplified : !"((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)>=2"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.119934,25072,1,0,31,4346,100,35,1025,5289,170
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(F("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)>=2"))))
Formula 13 simplified : !F"((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.120519,25208,1,0,31,4346,100,35,1025,5289,170
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)")U("((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")))
Formula 14 simplified : !("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)" U "((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.122439,25252,1,0,31,4346,110,35,1042,5289,174
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=1")))
Formula 15 simplified : !X"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)>=1"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.123154,25268,1,0,31,4346,110,35,1042,5289,176
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 25 rows 25 cols
invariant : 1'Think_4 + 1'Think_5 + -1'Fork_4 + 1'Catch1_4 + 1'Catch2_5= 1
invariant : 1'Think_3 + 1'Think_4 + -1'Fork_3 + 1'Catch1_3 + 1'Catch2_4= 1
invariant : 1'Think_1 + 1'Think_5 + -1'Fork_5 + 1'Catch1_5 + 1'Catch2_1= 1
invariant : -1'Think_2 + 1'Fork_2 + -1'Catch1_2 + 1'Catch1_3 + 1'Eat_3= 0
invariant : -1'Think_3 + 1'Fork_3 + -1'Catch1_3 + 1'Catch1_4 + 1'Eat_4= 0
invariant : 1'Think_1 + 1'Think_2 + -1'Fork_1 + 1'Catch1_1 + 1'Catch2_2= 1
invariant : -1'Think_5 + 1'Fork_5 + 1'Catch1_1 + -1'Catch1_5 + 1'Eat_1= 0
invariant : -1'Think_1 + 1'Fork_1 + -1'Catch1_1 + 1'Catch1_2 + 1'Eat_2= 0
invariant : -1'Think_4 + 1'Fork_4 + 1'Catch1_5 + -1'Catch1_4 + 1'Eat_5= 0
invariant : 1'Think_2 + 1'Think_3 + -1'Fork_2 + 1'Catch1_2 + 1'Catch2_3= 1
Exit code :0

BK_STOP 1496370341936

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 02, 2017 2:25:40 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 2:25:40 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 64 ms
Jun 02, 2017 2:25:40 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Jun 02, 2017 2:25:40 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Jun 02, 2017 2:25:41 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 84 ms
Jun 02, 2017 2:25:41 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 13 ms
Jun 02, 2017 2:25:41 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Jun 02, 2017 2:25:41 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 16 ms
Jun 02, 2017 2:25:41 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states
Computing Next relation with stutter on 2 deadlock states

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="S_Philosophers-PT-000005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/S_Philosophers-PT-000005.tgz
mv S_Philosophers-PT-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_Philosophers-PT-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-149441683200203"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;