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_Parking-PT-104, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-blw7-149441652100329
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496455883976


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 : !((G(F(X(("u13.p57==0")||("u10.p26==1"))))))
Formula 0 simplified : !GFX("u10.p26==1" | "u13.p57==0")
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 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.101816,24856,1,0,2821,680,868,3493,262,2595,9102
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-104-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("u13.p57==0")||("u10.p31==1")))))
Formula 1 simplified : !XG("u10.p31==1" | "u13.p57==0")
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.115342,25560,1,0,3844,738,889,4882,264,3053,12618
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X((("u8.p16==0")||("u15.p62==1"))U("u10.p28>=1")))))
Formula 2 simplified : !FX(("u8.p16==0" | "u15.p62==1") U "u10.p28>=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.123396,25720,1,0,4289,739,925,5560,265,3085,14190
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X("u14.p60>=2")))
Formula 3 simplified : !X"u14.p60>=2"
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.124839,25884,1,0,4362,739,930,5594,267,3087,14490
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(("u10.p30==0")||("u1.p2==1")))U(("u11.p38==0")||("u3.p6==1"))))
Formula 4 simplified : !(F("u1.p2==1" | "u10.p30==0") U ("u3.p6==1" | "u11.p38==0"))
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.125951,26276,1,0,4362,739,953,5594,269,3087,14501
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Parking-PT-104-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X("u13.p51>=3")))
Formula 5 simplified : !X"u13.p51>=3"
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.126283,26464,1,0,4362,739,958,5594,271,3087,14517
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("u13.p50>=2")U(F(X(("u6.p12==0")||("u12.p42==1"))))))
Formula 6 simplified : !("u13.p50>=2" U FX("u6.p12==0" | "u12.p42==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.132641,26632,1,0,4913,751,997,6359,273,3176,16129
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X("u8.p16>=2"))))
Formula 7 simplified : !XX"u8.p16>=2"
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.135555,26752,1,0,5100,751,1000,6528,273,3176,16970
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("u13.p55>=3"))
Formula 8 simplified : !"u13.p55>=3"
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.136187,27016,1,0,5100,751,1005,6528,275,3176,16988
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(F(F("u13.p49>=3"))))))
Formula 9 simplified : !XXF"u13.p49>=3"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.155432,27608,1,0,6821,1318,1045,9089,277,5727,20541
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(X(G(X(("u13.p49==0")||("u16.p0==1")))))))
Formula 10 simplified : !GXGX("u13.p49==0" | "u16.p0==1")
5 unique states visited
5 strongly connected components in search stack
5 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.167545,28240,1,0,7429,1353,1068,10752,281,6741,23060
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("u9.p23>=2")))
Formula 11 simplified : !F"u9.p23>=2"
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.176793,28592,1,0,8078,1353,1110,11640,283,6748,25305
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(G(X(("u13.p56==0")||("u11.p33==1"))))))
Formula 12 simplified : !XGX("u11.p33==1" | "u13.p56==0")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.230859,29052,1,0,8643,1368,1138,12622,285,7078,27474
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X(X(("u9.p19==0")||("u13.p56==1"))))))
Formula 13 simplified : !FXX("u9.p19==0" | "u13.p56==1")
3 unique states visited
0 strongly connected components in search stack
2 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.232613,29236,1,0,8643,1368,1169,12622,289,7078,27515
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Parking-PT-104-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(G(G(G("u12.p47>=2"))))))
Formula 14 simplified : !FG"u12.p47>=2"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.297213,31356,1,0,14568,1403,1188,19657,289,8072,37214
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(F((("u12.p45==0")||("u1.p1==1"))U("u6.p11>=2")))))
Formula 15 simplified : !GF(("u1.p1==1" | "u12.p45==0") U "u6.p11>=2")
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.299017,31428,1,0,14581,1403,1207,19695,291,8091,37346
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Parking-PT-104-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 97 rows 65 cols
Exit code :0

BK_STOP 1496455886782

--------------------
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 03, 2017 2:11:25 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 57 ms
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 65 places.
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 97 transitions.
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2017 2:11:25 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
Jun 03, 2017 2:11:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 9 ms
Jun 03, 2017 2:11:25 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Jun 03, 2017 2:11:26 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]
built 26 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, u15.t3, u15.t4, u15.t5, u15.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :41/50/6/97
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states
Computing Next relation with stutter on 16 deadlock states

Jun 03, 2017 2:11:26 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 16 place invariants in 39 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="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/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-3254"
echo " Executing tool itstools"
echo " Input is S_Parking-PT-104, 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 r120-blw7-149441652100329"
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 '' LTLCardinality.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 ;