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)
.................
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DrinkVendingMachine-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r239-blw3-152732478900105
=====================================================================

--------------------
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 DrinkVendingMachine-PT-02-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1528034752905


BK_STOP 1528034760161

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DrinkVendingMachine-PT-02 as instance name.
Using DrinkVendingMachine as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Extended Free Choice': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 153, 'Memory': 112.18, 'Tool': 'lola'}, {'Time': 214, 'Memory': 112, 'Tool': 'lola'}, {'Time': 2977, 'Memory': 225.84, 'Tool': 'itstools'}, {'Time': 3176, 'Memory': 255.13, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 19.45751633986928x far from the best tool lola.
LTLCardinality itstools DrinkVendingMachine-PT-02...
Jun 03, 2018 2:05:58 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLCardinality]
Jun 03, 2018 2:05:58 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 03, 2018 2:05:58 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 58 ms
Jun 03, 2018 2:05:58 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Jun 03, 2018 2:05:58 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 72 transitions.
Jun 03, 2018 2:05:58 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 16 ms
Jun 03, 2018 2:05:58 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
Jun 03, 2018 2:05:59 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 4 ms
Jun 03, 2018 2:05:59 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 3 ms
Jun 03, 2018 2:05:59 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 72 transitions.
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]

its-ltl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLCardinality.pnml.gal -t CGAL -LTL /mcc-data/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((X("((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)>=2)"))U(F("((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)<=(theOptions_1+theOptions_2))")))))
Formula 0 simplified : !F(X"((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)>=2)" U F"((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)<=(theOptions_1+theOptions_2))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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.03153,17204,1,0,5,733,20,0,896,440,6
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(G(F("((optionSlots_1+optionSlots_2)>=3)"))))))
Formula 1 simplified : !FGF"((optionSlots_1+optionSlots_2)>=3)"
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.034496,17608,1,0,5,1066,33,0,1064,662,20
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G("((productSlots_1+productSlots_2)>=3)")))
Formula 2 simplified : !G"((productSlots_1+productSlots_2)>=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.036394,17608,1,0,6,1454,41,0,1068,916,32
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X("((theProducts_1+theProducts_2)>=1)"))))
Formula 3 simplified : !XX"((theProducts_1+theProducts_2)>=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.040115,17608,1,0,9,1994,44,0,1072,1419,42
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(G(("((optionSlots_1+optionSlots_2)>=2)")U("((((((((wait_1+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)>=2)")))))
Formula 4 simplified : !G("((optionSlots_1+optionSlots_2)>=2)" U "((((((((wait_1+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)>=2)")
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 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.068141,18788,1,0,27,7259,60,18,1137,7704,137
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(F("((productSlots_1+productSlots_2)>=2)")))U(X("((((((((wait_1+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)>=1)"))))
Formula 5 simplified : !(F"((productSlots_1+productSlots_2)>=2)" U X"((((((((wait_1+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)+wait_8)>=1)")
3 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.070207,18788,1,0,27,7259,71,18,1159,7704,144
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((F(G("((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)<=(theOptions_1+theOptions_2))")))U(F("((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)>=3)"))))
Formula 6 simplified : !(FG"((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)<=(theOptions_1+theOptions_2))" U F"((((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8)>=3)")
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.081205,18988,1,0,36,8813,80,22,1185,9917,184
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("((optionSlots_1+optionSlots_2)<=(((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8))"))
Formula 7 simplified : !"((optionSlots_1+optionSlots_2)<=(((((((ready_1+ready_3)+ready_2)+ready_5)+ready_4)+ready_7)+ready_6)+ready_8))"
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.081873,18988,1,0,36,8813,83,22,1196,9917,186
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(X(X(X("(ready_2<=wait_7)"))))))
Formula 8 simplified : !GXXX"(ready_2<=wait_7)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 52
// Phase 1: matrix 52 rows 24 cols
invariant :wait_7 + ready_7 = 1
invariant :wait_2 + ready_2 = 1
invariant :theProducts_2 + productSlots_2 = 1
invariant :wait_4 + ready_4 = 1
invariant :wait_6 + ready_6 = 1
invariant :theOptions_1 + optionSlots_1 = 1
invariant :theOptions_2 + optionSlots_2 = 1
invariant :theProducts_1 + productSlots_1 = 1
invariant :wait_5 + ready_5 = 1
invariant :wait_3 + ready_3 = 1
invariant :wait_8 + ready_8 = 1
invariant :wait_1 + ready_1 = 1
Jun 03, 2018 2:05:59 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 12 place invariants in 8 ms
4 unique states visited
0 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.090414,19392,1,0,40,10651,89,24,1199,12603,231
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F((G("(wait_1<=wait_2)"))U(true))))
Formula 9 simplified : 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.090614,19392,1,0,40,10651,89,24,1199,12603,231
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F("(theProducts_1<=ready_1)")))
Formula 10 simplified : !F"(theProducts_1<=ready_1)"
2 unique states visited
2 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.113202,20448,1,0,73,15802,98,40,1203,19831,320
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(("(wait_2<=theOptions_2)")U("(wait_7<=theOptions_2)")))))
Formula 11 simplified : !GX("(wait_2<=theOptions_2)" U "(wait_7<=theOptions_2)")
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.11733,20668,1,0,77,16104,110,40,1215,20162,335
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X((G("(productSlots_1<=ready_7)"))U(X("(productSlots_2<=ready_8)")))))
Formula 12 simplified : !X(G"(productSlots_1<=ready_7)" U X"(productSlots_2<=ready_8)")
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.119868,21476,1,0,81,16107,117,40,1224,20201,347
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(X("(wait_4<=productSlots_2)"))))
Formula 13 simplified : !GX"(wait_4<=productSlots_2)"
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.140356,21736,1,0,107,18738,123,45,1229,23091,446
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(F("(ready_8<=theProducts_1)"))))
Formula 14 simplified : !F"(ready_8<=theProducts_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.141022,22000,1,0,107,18738,132,45,1232,23092,450
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G(X(("(optionSlots_1<=wait_1)")U("(wait_2<=theProducts_1)")))))
Formula 15 simplified : !GX("(optionSlots_1<=wait_1)" U "(wait_2<=theProducts_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.143974,22000,1,0,113,19184,144,45,1244,23510,468
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is DrinkVendingMachine-PT-02, 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 r239-blw3-152732478900105"
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 ;