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 AutoFlight-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-csrt-149436129300168
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496249701854


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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(X(G(X(F("u10.p0>=1")))))))
Formula 0 simplified : !XXGXF"u10.p0>=1"
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.040137,23580,1,0,752,201,388,949,167,604,2103
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("u3.p7>=1")&&("u6.p12>=1")))
Formula 1 simplified : !("u3.p7>=1" & "u6.p12>=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.041563,23792,1,0,762,201,399,953,168,604,2160
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(G("u1.p3>=1")))))
Formula 2 simplified : !XFG"u1.p3>=1"
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.06021,24052,1,0,1729,225,434,2271,168,1048,4493
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(G((X(("u7.p23>=1")&&("u9.p30>=1")))U(X(("u2.p6>=1")&&("u8.p26>=1")))))))
Formula 3 simplified : !G(X("u7.p23>=1" & "u9.p30>=1") U X("u2.p6>=1" & "u8.p26>=1"))
5 unique states visited
5 strongly connected components in search stack
6 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.066363,25936,1,0,1780,226,460,2374,170,1101,4776
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X("u1.p3>=1")))
Formula 4 simplified : !X"u1.p3>=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.066861,25936,1,0,1780,226,460,2374,170,1101,4786
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(F(G(("u3.p7>=1")&&("u7.p21>=1")))))))
Formula 5 simplified : !GXFG("u3.p7>=1" & "u7.p21>=1")
4 unique states visited
4 strongly connected components in search stack
5 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.069857,26132,1,0,1807,226,506,2420,171,1103,5005
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G("u2.p6>=1"))U((X(("u8.p24>=1")&&("u9.p31>=1")))U(F("u2.p5>=1")))))
Formula 6 simplified : !(G"u2.p6>=1" U (X("u8.p24>=1" & "u9.p31>=1") U F"u2.p5>=1"))
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.074369,26512,1,0,1896,229,535,2605,171,1126,5383
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(G(F(("u3.p7>=1")&&("u6.p15>=1")))))U(X(("u3.p7>=1")&&("u6.p12>=1")))))
Formula 7 simplified : !(XGF("u3.p7>=1" & "u6.p15>=1") U X("u3.p7>=1" & "u6.p12>=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.080618,27164,1,0,2000,229,580,2777,174,1153,5826
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("u2.p5>=1"))
Formula 8 simplified : !"u2.p5>=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.081074,27164,1,0,2000,229,580,2777,174,1153,5827
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(("u1.p2>=1")U("u4.p9>=1")))U(G((("u6.p11>=1")&&("u9.p31>=1"))U(("u8.p24>=1")&&("u9.p31>=1"))))))
Formula 9 simplified : !(F("u1.p2>=1" U "u4.p9>=1") U G(("u6.p11>=1" & "u9.p31>=1") U ("u8.p24>=1" & "u9.p31>=1")))
5 unique states visited
4 strongly connected components in search stack
5 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.091777,27896,1,0,2287,229,658,3137,174,1193,6849
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(((("u8.p29>=1")&&("u9.p30>=1"))U(("u2.p6>=1")&&("u8.p26>=1")))U(X(X("u10.p0>=1"))))))
Formula 10 simplified : !F((("u8.p29>=1" & "u9.p30>=1") U ("u2.p6>=1" & "u8.p26>=1")) U XX"u10.p0>=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.09242,27896,1,0,2287,229,658,3145,174,1193,6858
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(G(G((("u7.p18>=1")&&("u9.p31>=1"))U(("u3.p7>=1")&&("u7.p19>=1")))))))
Formula 11 simplified : !G(("u7.p18>=1" & "u9.p31>=1") U ("u3.p7>=1" & "u7.p19>=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.095298,28092,1,0,2287,229,712,3145,176,1193,6904
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("u2.p6>=1")&&("u8.p26>=1")))
Formula 12 simplified : !("u2.p6>=1" & "u8.p26>=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.095826,28144,1,0,2287,229,713,3145,176,1193,6927
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(("u1.p1>=1")&&("u6.p16>=1"))))
Formula 13 simplified : !G("u1.p1>=1" & "u6.p16>=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.096996,28144,1,0,2287,229,741,3145,176,1193,6964
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(G(G(X(("u1.p3>=1")&&("u8.p25>=1")))))))
Formula 14 simplified : !FGX("u1.p3>=1" & "u8.p25>=1")
3 unique states visited
2 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.100508,28172,1,0,2346,229,765,3283,176,1220,7177
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(G(X("u1.p2>=1"))))U(F(F(X("u7.p20>=1"))))))
Formula 15 simplified : !(XGX"u1.p2>=1" U FX"u7.p20>=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.102726,28224,1,0,2435,229,788,3408,176,1220,7459
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA AutoFlight-PT-01a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 30 rows 32 cols
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u5:p10= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u4:p8 + 1'u4:p9= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u8:p24 + 1'u8:p25 + 1'u8:p26 + 1'u8:p27 + 1'u8:p28 + 1'u8:p29= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u2:p4 + 1'u2:p5 + 1'u2:p6= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u3:p7= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u6:p11 + 1'u6:p12 + 1'u6:p13 + 1'u6:p14 + 1'u6:p15 + 1'u6:p16 + 1'u6:p17= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u7:p18 + 1'u7:p19 + 1'u7:p20 + 1'u7:p21 + 1'u7:p22 + 1'u7:p23= 0
invariant : -1'u6:p11 + -1'u6:p12 + -1'u6:p13 + -1'u6:p14 + -1'u6:p15 + -1'u6:p16 + -1'u7:p18 + -1'u7:p19 + -1'u7:p20 + -1'u7:p21 + -1'u7:p22 + -1'u8:p24 + -1'u8:p25 + -1'u8:p26 + -1'u8:p27 + -1'u8:p28 + 1'u9:p31= 0
invariant : 1'u1:p1 + 1'u1:p2 + 1'u1:p3 + 1'u10:p0= 1
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + 1'u6:p11 + 1'u6:p12 + 1'u6:p13 + 1'u6:p14 + 1'u6:p15 + 1'u6:p16 + 1'u7:p18 + 1'u7:p19 + 1'u7:p20 + 1'u7:p21 + 1'u7:p22 + 1'u8:p24 + 1'u8:p25 + 1'u8:p26 + 1'u8:p27 + 1'u8:p28 + 1'u9:p30= 0
Exit code :0

BK_STOP 1496249704353

--------------------
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 -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 LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 4:55:03 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 4:55:03 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 32 ms
May 31, 2017 4:55:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 32 places.
May 31, 2017 4:55:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 transitions.
May 31, 2017 4:55:03 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 31, 2017 4:55:03 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 31, 2017 4:55:03 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 31, 2017 4:55:03 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
May 31, 2017 4:55:03 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 31, 2017 4:55:03 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 7 redundant transitions.
May 31, 2017 4:55:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
May 31, 2017 4:55:03 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 31, 2017 4:55:04 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 10 place invariants in 14 ms
May 31, 2017 4:55:04 PM 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
built 12 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t25, t26, u1.t0, u1.t8, u2.t1, u2.t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :5/21/4/30
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="AutoFlight-PT-01a"
export BK_EXAMINATION="LTLFireability"
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/AutoFlight-PT-01a.tgz
mv AutoFlight-PT-01a 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 AutoFlight-PT-01a, 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 r010-csrt-149436129300168"
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 ;