About the Execution of ITS-Tools for JoinFreeModules-PT-0005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
273.840 | 2893.00 | 4153.00 | 127.50 | TFTFTFTTTFFFTFFT | 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 JoinFreeModules-PT-0005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r200-blw7-149581092400023
=====================================================================
--------------------
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 JoinFreeModules-PT-0005-LTLCardinality-0
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-1
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-15
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-2
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-3
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-4
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-5
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-6
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-7
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-8
FORMULA_NAME JoinFreeModules-PT-0005-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496655479470
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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("p15<=p14"))
Formula 0 simplified : !"p15<=p14"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,0.076957,24688,1,0,103,12536,101,45,1273,9436,89
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(((G(X("p18>=2")))U(("p17<=p11")U("p10>=2"))))
Formula 1 simplified : !(GX"p18>=2" U ("p17<=p11" U "p10>=2"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 40 rows 25 cols
invariant : 1'p21 + 1'p22 + 1'p23 + 1'p24 + 1'p25= 8
invariant : 1'p1 + 1'p2 + 1'p3 + 1'p4 + 1'p5= 8
invariant : 1'p11 + 1'p12 + 1'p13 + 1'p14 + 1'p15= 8
invariant : 1'p6 + 1'p7 + 1'p8 + 1'p9 + 1'p10= 8
invariant : 1'p16 + 1'p17 + 1'p18 + 1'p19 + 1'p20= 8
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
36 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.432725,39788,1,0,283,72784,111,225,1309,104526,550
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F("p25<=p13"))))
Formula 2 simplified : !XF"p25<=p13"
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.433603,40148,1,0,283,72784,120,225,1313,104526,554
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F(G(F("p21<=p10"))))))
Formula 3 simplified : !XFGF"p21<=p10"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.474034,40840,1,0,285,76503,133,228,1369,109603,574
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((G(false))U(G("p2<=p15")))))
Formula 4 simplified : !G"p2<=p15"
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.474618,41128,1,0,285,76503,141,228,1373,109603,581
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(G(X(G("p25>=3"))))))
Formula 5 simplified : !FGXG"p25>=3"
3 unique states visited
2 strongly connected components in search stack
4 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.475256,41220,1,0,287,76509,147,231,1375,109613,594
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F("p14<=p22")))
Formula 6 simplified : !F"p14<=p22"
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.475512,41220,1,0,287,76509,156,231,1379,109613,598
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G((F("p25>=2"))U(F("p1>=2")))))
Formula 7 simplified : !G(F"p25>=2" U F"p1>=2")
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.480466,41336,1,0,289,77933,165,233,1381,110905,611
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(F(("p21<=1")U("p25>=1")))))
Formula 8 simplified : !GF("p21<=1" U "p25>=1")
3 unique states visited
3 strongly connected components in search stack
4 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.480931,41460,1,0,291,77933,174,234,1383,110906,622
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("p23>=3"))
Formula 9 simplified : !"p23>=3"
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.481168,41460,1,0,291,77933,177,234,1385,110906,624
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("p1<=p3"))
Formula 10 simplified : !"p1<=p3"
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.481384,41572,1,0,291,77933,180,234,1389,110906,626
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("p8<=p12")))
Formula 11 simplified : !X"p8<=p12"
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.482333,41572,1,0,291,78008,183,234,1395,110988,630
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("p23>=2"))
Formula 12 simplified : !"p23>=2"
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.482546,41572,1,0,291,78008,186,234,1396,110988,632
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G("p21>=1"))))
Formula 13 simplified : !FG"p21>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
21 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.707906,50440,1,0,476,122690,199,426,1398,178223,1119
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("p13>=3"))
Formula 14 simplified : !"p13>=3"
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.708644,50440,1,0,476,122690,202,426,1400,178223,1121
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("p13>=1"))
Formula 15 simplified : !"p13>=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.708894,50632,1,0,476,122690,205,426,1401,178223,1123
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0005-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0
BK_STOP 1496655482363
--------------------
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 -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 LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 05, 2017 9:38:00 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 05, 2017 9:38:00 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 42 ms
Jun 05, 2017 9:38:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 26 places.
Jun 05, 2017 9:38:00 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 transitions.
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 1 fixed domain variables (out of 26 variables) in GAL type JoinFreeModules_PT_0005
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Found a total of 1 constant array cells/variables (out of 26 variables) in type JoinFreeModules_PT_0005
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: p,
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 1 constant variables :p
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 5 expressions due to constant valuations.
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 62 ms
Jun 05, 2017 9:38:01 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 9 ms
Jun 05, 2017 9:38:01 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 5 place invariants in 11 ms
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 25 variables to be positive in 42 ms
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 41 transitions.
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/41 took 2 ms. Total solver calls (SAT/UNSAT): 4(2/2)
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 56 ms. Total solver calls (SAT/UNSAT): 185(80/105)
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 41 transitions.
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 185(105/80)
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 41 transitions.
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 137 ms. Total solver calls (SAT/UNSAT): 861(826/35)
Jun 05, 2017 9:38:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 41 transitions.
Jun 05, 2017 9:38:02 AM 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t9, t10, t11, t12, t17, t18, t19, t20, t25, t26, t27, t28, t33, t34, t35, t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/20/41
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 deadlock states
Computing Next relation with stutter on 1 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="JoinFreeModules-PT-0005"
export BK_EXAMINATION="LTLCardinality"
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/JoinFreeModules-PT-0005.tgz
mv JoinFreeModules-PT-0005 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 JoinFreeModules-PT-0005, 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 r200-blw7-149581092400023"
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 '
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 ;