About the Execution of ITS-Tools for S_CircularTrains-PT-012
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
264.840 | 3002.00 | 5814.00 | 177.10 | TFFFTTFFTTFTFFFT | normal |
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_CircularTrains-PT-012, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-csrt-149441077000618
=====================================================================
--------------------
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 CircularTrains-PT-012-LTLFireability-0
FORMULA_NAME CircularTrains-PT-012-LTLFireability-1
FORMULA_NAME CircularTrains-PT-012-LTLFireability-10
FORMULA_NAME CircularTrains-PT-012-LTLFireability-11
FORMULA_NAME CircularTrains-PT-012-LTLFireability-12
FORMULA_NAME CircularTrains-PT-012-LTLFireability-13
FORMULA_NAME CircularTrains-PT-012-LTLFireability-14
FORMULA_NAME CircularTrains-PT-012-LTLFireability-15
FORMULA_NAME CircularTrains-PT-012-LTLFireability-2
FORMULA_NAME CircularTrains-PT-012-LTLFireability-3
FORMULA_NAME CircularTrains-PT-012-LTLFireability-4
FORMULA_NAME CircularTrains-PT-012-LTLFireability-5
FORMULA_NAME CircularTrains-PT-012-LTLFireability-6
FORMULA_NAME CircularTrains-PT-012-LTLFireability-7
FORMULA_NAME CircularTrains-PT-012-LTLFireability-8
FORMULA_NAME CircularTrains-PT-012-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496426181650
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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 24 cols
invariant : 1'F7 + -1'Section_6 + -1'F6 + 1'Section_8= 0
invariant : 1'F7 + -1'Section_11 + 1'F2 + -1'Section_6 + 1'F9 + 1'F12 + 1'F4= 2
invariant : 1'Section_2 + 1'F2 + 1'Section_3= 2
invariant : 1'Section_12 + 1'F12 + 1'Section_1= 1
invariant : 1'Section_4 + -1'Section_2 + -1'F2 + 1'F3= -1
invariant : -1'Section_9 + 1'Section_11 + -1'F9 + 1'F10= 0
invariant : 1'Section_11 + 1'Section_12 + 1'F11= 2
invariant : 1'Section_2 + -1'Section_12 + -1'F12 + 1'F1= 0
invariant : 1'Section_6 + 1'F6 + 1'Section_7= 1
invariant : -1'F7 + 1'Section_9 + 1'Section_6 + 1'F6 + 1'F8= 2
invariant : -1'Section_4 + 1'F7 + -1'Section_11 + 1'F2 + 1'F9 + 1'F12 + 1'F5= 3
invariant : 1'Section_4 + -1'F7 + 1'Section_11 + -1'F2 + 1'Section_6 + -1'F9 + -1'F12 + 1'Section_5= -1
invariant : 1'Section_9 + 1'F9 + 1'Section_10= 1
Checking formula 0 : !((F(G(F(X(F(("Section_11>=1")&&("F12>=1"))))))))
Formula 0 simplified : !FGFXF("F12>=1" & "Section_11>=1")
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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.07564,24192,1,0,45,4204,29,1,547,2721,114
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F((("Section_9>=1")&&("F10>=1"))U(X(G(("F5>=1")&&("Section_4>=1")))))))
Formula 1 simplified : !F(("F10>=1" & "Section_9>=1") U XG("F5>=1" & "Section_4>=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.100546,25356,1,0,115,8714,49,33,554,10337,260
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(X(("Section_9>=1")&&("F10>=1")))))
Formula 2 simplified : !FX("F10>=1" & "Section_9>=1")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.120721,25956,1,0,193,11058,63,50,559,14043,421
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((("Section_12>=1")&&("F1>=1")))
Formula 3 simplified : !("F1>=1" & "Section_12>=1")
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.121343,26212,1,0,193,11058,71,50,564,14043,423
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(((("Section_9>=1")&&("F10>=1"))U(("Section_9>=1")&&("F10>=1")))U(("Section_6>=1")&&("F7>=1")))))
Formula 4 simplified : !X(("F10>=1" & "Section_9>=1") U ("F7>=1" & "Section_6>=1"))
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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.132917,26848,1,0,257,12286,95,68,581,16974,601
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F((G(X(("Section_5>=1")&&("F6>=1"))))U(X(("F8>=1")&&("Section_7>=1"))))))
Formula 5 simplified : !F(GX("F6>=1" & "Section_5>=1") U X("F8>=1" & "Section_7>=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.139834,27380,1,0,305,13196,109,79,586,18131,702
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X(("Section_11>=1")&&("F12>=1")))))
Formula 6 simplified : !XX("F12>=1" & "Section_11>=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.141598,27616,1,0,307,13264,109,79,586,18308,712
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((X(F(X(("F3>=1")&&("Section_2>=1")))))U(G(("F5>=1")&&("Section_4>=1")))))
Formula 7 simplified : !(XFX("F3>=1" & "Section_2>=1") U G("F5>=1" & "Section_4>=1"))
81 unique states visited
2 strongly connected components in search stack
81 transitions explored
19 items max in DFS search stack
10 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.257547,33012,1,0,1074,32025,123,362,591,51198,2371
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((("F8>=1")&&("Section_7>=1"))U(G(G(X(("F5>=1")&&("Section_4>=1")))))))
Formula 8 simplified : !(("F8>=1" & "Section_7>=1") U GX("F5>=1" & "Section_4>=1"))
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
28 unique states visited
1 strongly connected components in search stack
28 transitions explored
27 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.301131,34764,1,0,1167,36264,140,387,602,56395,2722
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(F(G(F(X(("Section_9>=1")&&("F10>=1"))))))))
Formula 9 simplified : !GFGFX("F10>=1" & "Section_9>=1")
2 unique states visited
0 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.303194,35044,1,0,1182,36339,140,388,602,56513,2764
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((("Section_11>=1")&&("F12>=1")))
Formula 10 simplified : !("F12>=1" & "Section_11>=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.303973,35044,1,0,1182,36339,140,388,602,56513,2766
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((("F11>=1")&&("Section_10>=1")))
Formula 11 simplified : !("F11>=1" & "Section_10>=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.304652,35080,1,0,1182,36339,148,388,607,56515,2768
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(((("F9>=1")&&("Section_8>=1"))U(("F2>=1")&&("Section_1>=1")))U(G(F(("F2>=1")&&("Section_1>=1")))))))
Formula 12 simplified : !F((("F9>=1" & "Section_8>=1") U ("F2>=1" & "Section_1>=1")) U GF("F2>=1" & "Section_1>=1"))
2 unique states visited
0 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.311814,35148,1,0,1232,37501,162,389,612,57588,2897
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(("F3>=1")&&("Section_2>=1"))))
Formula 13 simplified : !F("F3>=1" & "Section_2>=1")
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.314709,35412,1,0,1264,37856,162,402,612,58388,2963
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(F(F(G(G(("F4>=1")&&("Section_3>=1"))))))))
Formula 14 simplified : !XFG("F4>=1" & "Section_3>=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.330873,35860,1,0,1334,40885,182,439,619,64594,3120
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((("Section_11>=1")&&("F12>=1")))
Formula 15 simplified : !("F12>=1" & "Section_11>=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.331389,36120,1,0,1334,40885,182,439,619,64594,3120
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0
BK_STOP 1496426184652
--------------------
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
Jun 02, 2017 5:56:23 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2017 5:56:23 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 40 ms
Jun 02, 2017 5:56:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Jun 02, 2017 5:56:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 12 transitions.
Jun 02, 2017 5:56:23 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
Jun 02, 2017 5:56:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
Jun 02, 2017 5:56:23 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 02, 2017 5:56:23 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 11 ms
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 24 variables to be positive in 57 ms
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 12 transitions.
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/12 took 2 ms. Total solver calls (SAT/UNSAT): 3(1/2)
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 36(12/24)
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 12 transitions.
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 125 ms. Total solver calls (SAT/UNSAT): 36(20/16)
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 12 transitions.
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 33 ms. Total solver calls (SAT/UNSAT): 78(46/32)
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 12 transitions.
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 4(0/4)
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 344ms conformant to PINS in folder :/home/mcc/execution
Jun 02, 2017 5:56:24 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]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
Jun 02, 2017 5:56:24 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTS min runner thread failed on error :java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:66)
at java.lang.Thread.run(Thread.java:748)
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_CircularTrains-PT-012"
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/S_CircularTrains-PT-012.tgz
mv S_CircularTrains-PT-012 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_CircularTrains-PT-012, 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 r090-csrt-149441077000618"
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 '
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 ;