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-2979
Executing tool itstools
Input is Philosophers-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085kn-ebro-146369085200320
=====================================================================

--------------------
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 1464051233513


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(G(("3<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)")U("((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)")))))
Formula 0 simplified : !G("3<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)" U "((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((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
5 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.089051,24020,1,0,22,4036,28,17,810,3861,50
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 : !((X(X(("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")U("((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")))))
Formula 1 simplified : !XX("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)" U "((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")
3 unique states visited
0 strongly connected components in search stack
2 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.093133,24240,1,0,23,4091,38,18,852,3920,57
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(X(X("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)"))))))
Formula 2 simplified : !XGXX"((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)"
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
3 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.116394,24708,1,0,37,6005,44,30,1008,7272,89
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(G(("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)")U("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")))))
Formula 3 simplified : !G("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)" U "((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")
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.120273,24984,1,0,37,6005,60,30,1053,7297,98
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 : !((X(F(F("((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")))))
Formula 4 simplified : !XF"((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_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.135201,25092,1,0,57,7468,69,49,1124,9648,151
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 : !((("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)")U("((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")))
Formula 5 simplified : !("((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)" U "((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.136759,25356,1,0,57,7468,77,49,1139,9648,155
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 : !(("1<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)"))
Formula 6 simplified : !"1<=((((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.13729,25368,1,0,57,7468,80,49,1145,9648,157
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 : !((F("2<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")))
Formula 7 simplified : !F"2<=((((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.137868,25372,1,0,57,7468,89,49,1151,9648,161
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(G(F("1<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)")))))
Formula 8 simplified : !XGF"1<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.139722,25416,1,0,57,7468,98,49,1167,9648,172
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("3<=((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)"))
Formula 9 simplified : !"3<=((((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.140292,25416,1,0,57,7468,101,49,1173,9648,174
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(F(X(G("1<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)"))))))
Formula 10 simplified : !XFXG"1<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.157272,25644,1,0,74,9057,114,69,1194,12923,227
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F("1<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")))
Formula 11 simplified : !F"1<=((((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.157982,25880,1,0,74,9057,120,69,1194,12923,229
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(X(G(G("3<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)"))))))
Formula 12 simplified : !XXG"3<=((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)"
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.161321,25948,1,0,74,9057,126,69,1212,12923,236
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(("1<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")U(X("2<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")))))
Formula 13 simplified : !F("1<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)" U X"2<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")
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.167943,25960,1,0,80,9272,135,77,1223,13466,263
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 : !(((F(X("((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)")))U(("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)")U("3<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)"))))
Formula 14 simplified : !(FX"((((Catch1_1+Catch1_2)+Catch1_3)+Catch1_5)+Catch1_4)<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)" U ("((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)<=((((Catch2_2+Catch2_1)+Catch2_4)+Catch2_3)+Catch2_5)" U "3<=((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_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.181517,26352,1,0,101,10533,147,97,1284,15433,331
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G("((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)")))
Formula 15 simplified : !G"((((Eat_1+Eat_3)+Eat_2)+Eat_5)+Eat_4)<=((((Fork_1+Fork_2)+Fork_3)+Fork_4)+Fork_5)"
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.190317,26740,1,0,105,10801,151,103,1380,15735,361
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464051239345

--------------------
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
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 24, 2016 12:53:58 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 24, 2016 12:53:58 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 43 ms
May 24, 2016 12:53:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
May 24, 2016 12:53:58 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
May 24, 2016 12:53:58 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 83 ms
May 24, 2016 12:53:58 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.gal : 15 ms
May 24, 2016 12:53:58 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms

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="Philosophers-PT-000005"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is 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 r085kn-ebro-146369085200320"
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 ;