About the Execution of ITS-Tools for S_Parking-PT-104
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
353.490 | 5258.00 | 11777.00 | 261.00 | FFFFFFFFFFFFTFFF | 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-2979
Executing tool itstools
Input is S_Parking-PT-104, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444112701167
=====================================================================
--------------------
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 Parking-PT-104-LTLFireability-0
FORMULA_NAME Parking-PT-104-LTLFireability-1
FORMULA_NAME Parking-PT-104-LTLFireability-10
FORMULA_NAME Parking-PT-104-LTLFireability-11
FORMULA_NAME Parking-PT-104-LTLFireability-12
FORMULA_NAME Parking-PT-104-LTLFireability-13
FORMULA_NAME Parking-PT-104-LTLFireability-14
FORMULA_NAME Parking-PT-104-LTLFireability-15
FORMULA_NAME Parking-PT-104-LTLFireability-2
FORMULA_NAME Parking-PT-104-LTLFireability-3
FORMULA_NAME Parking-PT-104-LTLFireability-4
FORMULA_NAME Parking-PT-104-LTLFireability-5
FORMULA_NAME Parking-PT-104-LTLFireability-6
FORMULA_NAME Parking-PT-104-LTLFireability-7
FORMULA_NAME Parking-PT-104-LTLFireability-8
FORMULA_NAME Parking-PT-104-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1464744491231
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(X(G(("u3.p5>=1")&&("u13.p55>=1"))))))
Formula 0 simplified : !GXG("u3.p5>=1" & "u13.p55>=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,0.126899,24020,1,0,2370,681,833,3074,260,2574,7353
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X((("u1.p2>=1")&&("u9.p18>=1"))U(("u2.p3>=1")&&("u9.p23>=1"))))U(G(("u12.p43>=1")&&("u15.p64>=1")))))
Formula 1 simplified : !(X(("u1.p2>=1" & "u9.p18>=1") U ("u2.p3>=1" & "u9.p23>=1")) U G("u12.p43>=1" & "u15.p64>=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.140855,27916,1,0,2371,681,886,3075,262,2574,7432
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(X(G("u12.p44>=1"))))U(X(X(G("u10.p28>=1"))))))
Formula 2 simplified : !(GXG"u12.p44>=1" U XXG"u10.p28>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.159398,28092,1,0,2939,722,908,3744,263,2802,9537
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((("u11.p36>=1")U("u10.p28>=1"))U(G("u15.p62>=1")))))
Formula 3 simplified : !X(("u11.p36>=1" U "u10.p28>=1") U G"u15.p62>=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.164927,28092,1,0,2939,722,971,3744,263,2802,9574
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("u2.p4>=1"))
Formula 4 simplified : !"u2.p4>=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.165444,28324,1,0,2939,722,973,3744,263,2802,9591
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(((("u1.p2>=1")&&("u9.p18>=1"))U("u6.p12>=1"))U(("u9.p22>=1")&&("u15.p63>=1")))))
Formula 5 simplified : !G((("u1.p2>=1" & "u9.p18>=1") U "u6.p12>=1") U ("u9.p22>=1" & "u15.p63>=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.17303,28324,1,0,2939,722,1050,3744,264,2802,9723
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("u15.p64>=1")))
Formula 6 simplified : !X"u15.p64>=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.173566,28420,1,0,2939,722,1051,3744,264,2802,9727
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Parking-PT-104-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("u1.p2>=1")))
Formula 7 simplified : !G"u1.p2>=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.174774,28420,1,0,2939,722,1065,3744,264,2802,9750
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G(X("u12.p44>=1"))))U(G(G(G("u11.p37>=1"))))))
Formula 8 simplified : !(XGX"u12.p44>=1" U G"u11.p37>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.181217,28496,1,0,3048,727,1085,3842,265,2880,10257
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("u15.p64>=1")&&("u11.p38>=1")))
Formula 9 simplified : !("u11.p38>=1" & "u15.p64>=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.181941,28496,1,0,3048,727,1093,3842,265,2880,10263
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("u8.p16>=1")))
Formula 10 simplified : !G"u8.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.183289,28524,1,0,3048,727,1108,3842,265,2880,10278
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((F(("u1.p2>=1")&&("u9.p19>=1")))U((("u9.p17>=1")&&("u14.p60>=1"))U("u12.p44>=1")))))
Formula 11 simplified : !F(F("u1.p2>=1" & "u9.p19>=1") U (("u9.p17>=1" & "u14.p60>=1") U "u12.p44>=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.185963,28532,1,0,3091,727,1120,3922,265,2889,10579
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X((F(G("u9.p20>=1")))U(F(G("u11.p37>=1"))))))
Formula 12 simplified : !X(FG"u9.p20>=1" U FG"u11.p37>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
11 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.300107,30916,1,0,9410,875,1127,11346,265,4804,21174
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((((G("u15.p62>=1"))U("u9.p20>=1"))U((X("u5.p10>=1"))U(X("u12.p45>=1")))))
Formula 13 simplified : !((G"u15.p62>=1" U "u9.p20>=1") U (X"u5.p10>=1" U X"u12.p45>=1"))
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.315379,31188,1,0,9638,910,1156,11708,265,5013,22256
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X((X("u15.p64>=1"))U(("u10.p29>=1")&&("u15.p64>=1"))))))
Formula 14 simplified : !FX(X"u15.p64>=1" U ("u10.p29>=1" & "u15.p64>=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.328694,31364,1,0,10252,916,1192,12543,265,5176,24038
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G("u6.p12>=1"))))
Formula 15 simplified : !XG"u6.p12>=1"
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.366296,31964,1,0,11374,936,1218,14322,265,5553,27354
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1464744496489
--------------------
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
Jun 01, 2016 1:28:14 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 1:28:14 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 58 ms
Jun 01, 2016 1:28:14 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 65 places.
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 97 transitions.
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 93 ms
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 292 ms
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[p1, p2, ],[p3, p4, ],[p5, p6, ],[p7, p8, ],[p9, p10, ],[p11, p12, ],[p13, p14, ],[p15, p16, ],[p17, p18, p19, p20, p21, p22, p23, p24, ],[p25, p26, p27, p28, p29, p30, p31, p32, ],[p33, p34, p35, p36, p37, p38, p39, p40, ],[p41, p42, p43, p44, p45, p46, p47, p48, ],[p49, p50, p51, p52, p53, p54, p55, p56, p57, p58, ],[p59, p60, ],[p61, p62, p63, p64, ],[p0, ],
Jun 01, 2016 1:28:15 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
Jun 01, 2016 1:28:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 23 ms
Jun 01, 2016 1:28:15 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_Parking-PT-104"
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_Parking-PT-104.tgz
mv S_Parking-PT-104 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_Parking-PT-104, 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 r181kn-smll-146444112701167"
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 ;