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 Railroad-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097kn-smll-146369138700222
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463986641742


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 : !((G((G((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P42_1>=1")))U(G(G(("pl_P2_1>=1")&&("pl_P17_1>=1")))))))
Formula 0 simplified : !G(G("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P42_1>=1") U G("pl_P2_1>=1" & "pl_P17_1>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
33 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.369279,35596,1,0,115,28628,183,54,2172,28242,135
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((F(X(F((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P40_3>=1")))))U(G(F(F((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_5>=1")))))))
Formula 1 simplified : !(FXF("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P40_3>=1") U GF("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_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,0.375527,36200,1,0,116,28854,200,54,2180,28643,146
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((("pl_P0_1>=1")&&("pl_P2_1>=1"))&&("pl_P6_1>=1"))))
Formula 2 simplified : !X("pl_P0_1>=1" & "pl_P2_1>=1" & "pl_P6_1>=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.376978,36200,1,0,116,28869,211,54,2188,28694,153
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X(X(G(F((("pl_P0_2>=1")&&("pl_P2_1>=1"))&&("pl_P32_1>=1"))))))))
Formula 3 simplified : !XXXGF("pl_P0_2>=1" & "pl_P2_1>=1" & "pl_P32_1>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
4 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.409668,36816,1,0,147,33383,228,55,2196,33850,244
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P42_1>=1")))))
Formula 4 simplified : !XF("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P42_1>=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.421526,37272,1,0,172,34374,241,65,2202,36653,301
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(((("pl_P0_3>=1")&&("pl_P2_1>=1"))&&("pl_P31_1>=1"))U(("pl_P12_1>=1")&&("pl_P21_1>=1"))))U(("pl_P8_1>=1")&&("pl_P25_1>=1"))))
Formula 5 simplified : !(F(("pl_P0_3>=1" & "pl_P2_1>=1" & "pl_P31_1>=1") U ("pl_P12_1>=1" & "pl_P21_1>=1")) U ("pl_P8_1>=1" & "pl_P25_1>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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.596408,42512,1,0,246,55648,270,97,2219,67463,493
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((("pl_P23_1>=1")&&("pl_P34_1>=1"))&&("pl_P42_1>=1")))
Formula 6 simplified : !("pl_P23_1>=1" & "pl_P34_1>=1" & "pl_P42_1>=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.597246,42800,1,0,246,55648,279,97,2226,67463,495
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((((X((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_6>=1")))U(X((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P40_2>=1"))))U(X((("pl_P2_1>=1")&&("pl_P13_1>=1"))U((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P40_5>=1"))))))
Formula 7 simplified : !((X("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_6>=1") U X("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P40_2>=1")) U X(("pl_P2_1>=1" & "pl_P13_1>=1") U ("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P40_5>=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.63762,42940,1,0,246,55648,375,97,2316,67473,504
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_1>=1")))
Formula 8 simplified : !("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_1>=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.638311,42988,1,0,246,55648,384,97,2323,67475,506
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F((((("pl_P11_1>=1")&&("pl_P29_1>=1"))&&("pl_P39_1>=1"))U((("pl_P23_1>=1")&&("pl_P34_4>=1"))&&("pl_P40_6>=1")))U(G(X((("pl_P23_1>=1")&&("pl_P34_4>=1"))&&("pl_P40_2>=1")))))))
Formula 9 simplified : !F((("pl_P11_1>=1" & "pl_P29_1>=1" & "pl_P39_1>=1") U ("pl_P23_1>=1" & "pl_P34_4>=1" & "pl_P40_6>=1")) U GX("pl_P23_1>=1" & "pl_P34_4>=1" & "pl_P40_2>=1"))
2 unique states visited
1 strongly connected components in search stack
3 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.64325,42996,1,0,247,56209,395,97,2330,67945,512
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((G(X(G(("pl_P2_1>=1")&&("pl_P17_1>=1")))))U(X(((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P40_1>=1"))U(("pl_P7_1>=1")&&("pl_P30_1>=1"))))))
Formula 10 simplified : !(GXG("pl_P2_1>=1" & "pl_P17_1>=1") U X(("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P40_1>=1") U ("pl_P7_1>=1" & "pl_P30_1>=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.655181,42996,1,0,247,56209,446,97,2384,67954,520
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((X(F((("pl_P23_1>=1")&&("pl_P34_6>=1"))&&("pl_P40_1>=1"))))U(G(G((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_1>=1")))))))
Formula 11 simplified : !X(XF("pl_P23_1>=1" & "pl_P34_6>=1" & "pl_P40_1>=1") U G("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_1>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.705926,44384,1,0,280,61693,475,118,2402,76194,634
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G(F(G(F((("pl_P23_1>=1")&&("pl_P34_3>=1"))&&("pl_P40_4>=1"))))))))
Formula 12 simplified : !GFGF("pl_P23_1>=1" & "pl_P34_3>=1" & "pl_P40_4>=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.708502,44648,1,0,281,61817,490,118,2409,76304,643
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(X(X(F(G((("pl_P23_1>=1")&&("pl_P34_2>=1"))&&("pl_P40_6>=1"))))))))
Formula 13 simplified : !FXXFG("pl_P23_1>=1" & "pl_P34_2>=1" & "pl_P40_6>=1")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.717534,44740,1,0,281,62421,511,118,2420,77101,762
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(X(G(F(G((("pl_P0_1>=1")&&("pl_P2_1>=1"))&&("pl_P6_1>=1"))))))))
Formula 14 simplified : !GXGFG("pl_P0_1>=1" & "pl_P2_1>=1" & "pl_P6_1>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17 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.884868,48668,1,0,364,79099,525,154,2424,108518,943
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(F(((("pl_P23_1>=1")&&("pl_P34_5>=1"))&&("pl_P42_1>=1"))U(("pl_P2_1>=1")&&("pl_P13_1>=1"))))))
Formula 15 simplified : !XF(("pl_P23_1>=1" & "pl_P34_5>=1" & "pl_P42_1>=1") U ("pl_P2_1>=1" & "pl_P13_1>=1"))
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.938115,50540,1,0,402,85320,532,170,2424,117715,1038
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Railroad-PT-005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1463986646568

--------------------
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 23, 2016 6:57:24 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 6:57:24 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 42 ms
May 23, 2016 6:57:24 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 68 places.
May 23, 2016 6:57:24 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
May 23, 2016 6:57:25 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 14 fixed domain variables (out of 68 variables) in GAL type Railroad_PT_005
May 23, 2016 6:57:25 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 14 constant array cells/variables (out of 68 variables) in type Railroad_PT_005
May 23, 2016 6:57:25 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: pl_P7_5,pl_P7_2,pl_P7_6,pl_P29_6,pl_P14_1,pl_P9_1,pl_P1_1,pl_P29_4,pl_P24_1,pl_P38_1,pl_P3_1,pl_P7_4,pl_P37_1,pl_P29_5,
May 23, 2016 6:57:25 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 14 constant variables :pl_P7_5, pl_P7_2, pl_P7_6, pl_P29_6, pl_P14_1, pl_P9_1, pl_P1_1, pl_P29_4, pl_P24_1, pl_P38_1, pl_P3_1, pl_P7_4, pl_P37_1, pl_P29_5
May 23, 2016 6:57:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 324 ms
May 23, 2016 6:57:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 13 ms
May 23, 2016 6:57:25 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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="Railroad-PT-005"
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/Railroad-PT-005.tgz
mv Railroad-PT-005 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 Railroad-PT-005, 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 r097kn-smll-146369138700222"
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 ;