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 S_Dekker-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r145kn-smll-146416245600006
=====================================================================

--------------------
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 Dekker-PT-010-LTLFireability-0
FORMULA_NAME Dekker-PT-010-LTLFireability-1
FORMULA_NAME Dekker-PT-010-LTLFireability-10
FORMULA_NAME Dekker-PT-010-LTLFireability-11
FORMULA_NAME Dekker-PT-010-LTLFireability-12
FORMULA_NAME Dekker-PT-010-LTLFireability-13
FORMULA_NAME Dekker-PT-010-LTLFireability-14
FORMULA_NAME Dekker-PT-010-LTLFireability-15
FORMULA_NAME Dekker-PT-010-LTLFireability-2
FORMULA_NAME Dekker-PT-010-LTLFireability-3
FORMULA_NAME Dekker-PT-010-LTLFireability-4
FORMULA_NAME Dekker-PT-010-LTLFireability-5
FORMULA_NAME Dekker-PT-010-LTLFireability-6
FORMULA_NAME Dekker-PT-010-LTLFireability-7
FORMULA_NAME Dekker-PT-010-LTLFireability-8
FORMULA_NAME Dekker-PT-010-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464163901139


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/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X((("flag_1_0>=1")&&("flag_1_2>=1"))&&("p1_2>=1"))))
Formula 0 simplified : !X("flag_1_0>=1" & "flag_1_2>=1" & "p1_2>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
18 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.241204,25952,1,0,261,15897,276,123,2697,12114,264
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((((((((("flag_0_0>=1")&&("flag_0_1>=1"))&&("flag_0_3>=1"))&&("flag_0_4>=1"))&&("flag_0_5>=1"))&&("flag_0_6>=1"))&&("flag_0_7>=1"))&&("flag_0_8>=1"))&&("flag_0_9>=1"))&&("p1_2>=1")))
Formula 1 simplified : !("flag_0_0>=1" & "flag_0_1>=1" & "flag_0_3>=1" & "flag_0_4>=1" & "flag_0_5>=1" & "flag_0_6>=1" & "flag_0_7>=1" & "flag_0_8>=1" & "flag_0_9>=1" & "p1_2>=1")
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.262835,29896,1,0,261,15939,322,123,2733,12158,268
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F(F((("flag_1_3>=1")&&("flag_1_5>=1"))&&("p1_5>=1"))))U(G(F(X(("flag_1_3>=1")&&("p3_3>=1")))))))
Formula 2 simplified : !(F("flag_1_3>=1" & "flag_1_5>=1" & "p1_5>=1") U GFX("flag_1_3>=1" & "p3_3>=1"))
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.272726,29964,1,0,263,16758,336,124,2738,12977,283
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((((G((("flag_1_6>=1")&&("flag_1_8>=1"))&&("p1_8>=1")))U((("flag_1_3>=1")&&("flag_1_9>=1"))&&("p1_3>=1")))U(G(F(F((("flag_1_1>=1")&&("flag_1_5>=1"))&&("p1_5>=1")))))))
Formula 3 simplified : !((G("flag_1_6>=1" & "flag_1_8>=1" & "p1_8>=1") U ("flag_1_3>=1" & "flag_1_9>=1" & "p1_3>=1")) U GF("flag_1_1>=1" & "flag_1_5>=1" & "p1_5>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.346043,30396,1,0,264,18617,355,124,2747,14597,292
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(("flag_1_7>=1")&&("p3_7>=1"))))
Formula 4 simplified : !X("flag_1_7>=1" & "p3_7>=1")
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.347115,30396,1,0,264,18618,363,124,2752,14599,294
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X((("flag_1_0>=1")&&("flag_1_8>=1"))&&("p1_0>=1"))))
Formula 5 simplified : !X("flag_1_0>=1" & "flag_1_8>=1" & "p1_0>=1")
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.348316,30472,1,0,264,18645,374,124,2760,14627,296
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X(("flag_0_9>=1")&&("p0_9>=1")))))
Formula 6 simplified : !XX("flag_0_9>=1" & "p0_9>=1")
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.351052,30484,1,0,266,18763,380,124,2764,14771,303
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G((("flag_1_2>=1")&&("p3_2>=1"))U(G(X((("flag_1_0>=1")&&("flag_1_5>=1"))&&("p1_0>=1")))))))
Formula 7 simplified : !G(("flag_1_2>=1" & "p3_2>=1") U GX("flag_1_0>=1" & "flag_1_5>=1" & "p1_0>=1"))
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.381619,30824,1,0,270,21709,404,124,2785,17501,318
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F((("flag_1_1>=1")&&("p3_1>=1"))U((("flag_1_8>=1")&&("flag_1_9>=1"))&&("p1_8>=1"))))U((("flag_0_7>=1")&&("p0_7>=1"))U(G(("flag_1_9>=1")&&("p3_9>=1"))))))
Formula 8 simplified : !(F(("flag_1_1>=1" & "p3_1>=1") U ("flag_1_8>=1" & "flag_1_9>=1" & "p1_8>=1")) U (("flag_0_7>=1" & "p0_7>=1") U G("flag_1_9>=1" & "p3_9>=1")))
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.393014,31100,1,0,274,21713,466,124,2839,17508,342
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((G(X(F((("flag_1_1>=1")&&("flag_1_9>=1"))&&("p1_1>=1")))))U(X(((((((((("flag_0_0>=1")&&("flag_0_1>=1"))&&("flag_0_2>=1"))&&("flag_0_3>=1"))&&("flag_0_4>=1"))&&("flag_0_5>=1"))&&("flag_0_6>=1"))&&("flag_0_8>=1"))&&("flag_0_9>=1"))&&("p1_7>=1")))))
Formula 9 simplified : !(GXF("flag_1_1>=1" & "flag_1_9>=1" & "p1_1>=1") U X("flag_0_0>=1" & "flag_0_1>=1" & "flag_0_2>=1" & "flag_0_3>=1" & "flag_0_4>=1" & "flag_0_5>=1" & "flag_0_6>=1" & "flag_0_8>=1" & "flag_0_9>=1" & "p1_7>=1"))
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
7 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,1.48773,33444,1,0,297,32522,518,134,2879,29232,414
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(F((G((("flag_1_0>=1")&&("flag_1_5>=1"))&&("p1_5>=1")))U(X((("flag_1_0>=1")&&("flag_1_8>=1"))&&("p1_0>=1")))))))
Formula 10 simplified : !XF(G("flag_1_0>=1" & "flag_1_5>=1" & "p1_5>=1") U X("flag_1_0>=1" & "flag_1_8>=1" & "p1_0>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 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,1.58034,36744,1,0,316,51093,524,143,2879,45655,469
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((F(F(("flag_1_5>=1")&&("p3_5>=1"))))U(F(X(("flag_0_9>=1")&&("p0_9>=1")))))))
Formula 11 simplified : !X(F("flag_1_5>=1" & "p3_5>=1") U FX("flag_0_9>=1" & "p0_9>=1"))
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,1.60148,37108,1,0,342,52984,530,153,2879,48191,522
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F((X(X((("flag_1_0>=1")&&("flag_1_2>=1"))&&("p1_0>=1"))))U(G(G((("flag_1_0>=1")&&("flag_1_4>=1"))&&("p1_0>=1")))))))
Formula 12 simplified : !F(XX("flag_1_0>=1" & "flag_1_2>=1" & "p1_0>=1") U G("flag_1_0>=1" & "flag_1_4>=1" & "p1_0>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
14 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,1.74643,41192,1,0,383,72769,553,174,2889,67996,640
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(X(((((((((("flag_0_0>=1")&&("flag_0_1>=1"))&&("flag_0_2>=1"))&&("flag_0_3>=1"))&&("flag_0_4>=1"))&&("flag_0_5>=1"))&&("flag_0_7>=1"))&&("flag_0_8>=1"))&&("flag_0_9>=1"))&&("p1_6>=1"))))U(F(F(X((("flag_1_3>=1")&&("flag_1_6>=1"))&&("p1_3>=1")))))))
Formula 13 simplified : !(XX("flag_0_0>=1" & "flag_0_1>=1" & "flag_0_2>=1" & "flag_0_3>=1" & "flag_0_4>=1" & "flag_0_5>=1" & "flag_0_7>=1" & "flag_0_8>=1" & "flag_0_9>=1" & "p1_6>=1") U FX("flag_1_3>=1" & "flag_1_6>=1" & "p1_3>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
7 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,1.99564,42876,1,0,393,82361,570,176,2897,75169,697
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((("flag_1_5>=1")&&("flag_1_8>=1"))&&("p1_5>=1")))
Formula 14 simplified : !("flag_1_5>=1" & "flag_1_8>=1" & "p1_5>=1")
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,1.99688,43136,1,0,393,82361,577,176,2903,75169,699
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(F(G((("flag_1_3>=1")&&("p3_3>=1"))U((("flag_1_2>=1")&&("flag_1_3>=1"))&&("p1_2>=1")))))))
Formula 15 simplified : !XFG(("flag_1_3>=1" & "p3_3>=1") U ("flag_1_2>=1" & "flag_1_3>=1" & "p1_2>=1"))
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
6 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,2.05118,44052,1,0,400,89256,600,176,2920,80178,736
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464163909200

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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 25, 2016 8:11:45 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2016 8:11:45 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 85 ms
May 25, 2016 8:11:45 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 25, 2016 8:11:46 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
May 25, 2016 8:11:46 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 125 ms
May 25, 2016 8:11:46 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 25 ms
May 25, 2016 8:11:46 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.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="S_Dekker-PT-010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/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_Dekker-PT-010.tgz
mv S_Dekker-PT-010 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 S_Dekker-PT-010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r145kn-smll-146416245600006"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;