fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r058-smll-152646385600160
Last Updated
June 26, 2018

About the Execution of M4M.full for DES-PT-00a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
880.240 25463.00 38925.00 806.60 T 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)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 31K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DES-PT-00a, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385600160
=====================================================================


--------------------
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 DES-PT-00a-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1526531833704


BK_STOP 1526531859167

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-00a as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityDeadlock', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 213, 'Memory': 106.45, 'Tool': 'lola'}, {'Time': 413, 'Memory': 106.17, 'Tool': 'lola'}, {'Time': 8233, 'Memory': 2205.39, 'Tool': 'marcie'}, {'Time': 10361, 'Memory': 2206.02, 'Tool': 'marcie'}, {'Time': 24477, 'Memory': 860.44, 'Tool': 'itstools'}, {'Time': 25317, 'Memory': 842.82, 'Tool': 'itstools'}, {'Time': 222535, 'Memory': 1405.97, 'Tool': 'gspn'}, {'Time': 230324, 'Memory': 1381.12, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 114.91549295774648x far from the best tool lola.
ReachabilityDeadlock itstools DES-PT-00a...
May 17, 2018 4:37:23 AM 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, ReachabilityDeadlock]
May 17, 2018 4:37:23 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 17, 2018 4:37:23 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 57 ms
May 17, 2018 4:37:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 115 places.
May 17, 2018 4:37:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 76 transitions.
May 17, 2018 4:37:23 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 17, 2018 4:37:23 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 14 ms
May 17, 2018 4:37:24 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 98 ms
Flatten gal took : 103 ms
May 17, 2018 4:37:24 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.simple.gal : 4 ms
May 17, 2018 4:37:24 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 76 transitions.
Constant places removed 1 places and 1 transitions.
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 114 transition count 61
Constant places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 113 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + HF-interchangeable + Divergent Free condition.
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 113 transition count 60
Constant places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 111 transition count 60
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 111 transition count 60
Constant places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 110 transition count 59
Performed 2 Post agglomeration using F-continuation condition.
Constant places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 22 place count 108 transition count 57
Applied a total of 22 rules in 65 ms. Remains 108 /115 variables (removed 7) and now considering 57/76 (removed 19) transitions.
// Phase 1: matrix 57 rows 108 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
May 17, 2018 4:37:24 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/ReachabilityDeadlock.pnml.gal : 3 ms
May 17, 2018 4:37:24 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 57 transitions.
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /mcc-data/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/mcc-data]

its-ctl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /mcc-data/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 57 rows 108 cols
invariant :p64 + p65 = 1
invariant :-1'p101 + -1'p102 + p103 + p104 = 0
invariant :p88 + p89 + -1'p90 + -1'p91 = 0
invariant :p42 + p55 + -1'p59 + p71 + p75 + -1'p87 = 1
invariant :p80 + p81 + p90 + p91 = 1
invariant :p48 + p55 + -1'p65 + p71 + p81 + -1'p87 = 1
invariant :p36 + p37 = 1
invariant :p9 + -1'p11 + -1'p37 + -1'p55 + -1'p71 + p87 + p90 + -1'p93 + p96 + p98 + -1'p100 + p102 + -1'p104 + -1'p109 + p112 + -1'p114 = 1
invariant :-1'p33 + p35 + -2'p37 + p39 + -2'p55 + -2'p71 + 2'p87 + 2'p90 + -2'p93 + -1'p95 + -1'p97 + p98 + -1'p100 + -1'p101 + p102 + -1'p104 + -1'p105 + -1'p109 + p112 + -1'p114 = 1
invariant :p82 + p83 + p90 + p91 = 1
invariant :p26 + p27 = 1
invariant :p32 + p33 = 1
invariant :p44 + p55 + -1'p61 + p71 + p77 + -1'p87 = 1
invariant :p66 + p67 = 1
invariant :p51 + -1'p55 + p67 + -1'p71 + -1'p83 + p87 = 0
invariant :p58 + p59 = 1
invariant :p3 + p4 = 1
invariant :p62 + p63 = 1
invariant :p84 + p85 + p90 + p91 = 1
invariant :p92 + p93 = 1
invariant :p50 + p55 + -1'p67 + p71 + p83 + -1'p87 = 1
invariant :p86 + p87 + p90 + p91 = 1
invariant :p111 + p112 = 1
invariant :p113 + p114 = 1
invariant :-1'p9 + p11 + p37 + p55 + p71 + -1'p87 + -1'p90 + p93 + p94 + p95 + p97 + p100 + p101 + p104 + p109 + -1'p112 + p114 = 0
invariant :p41 + -1'p55 + p57 + -1'p71 + -1'p73 + p87 = 0
invariant :p56 + p57 = 1
invariant :p43 + -1'p55 + p59 + -1'p71 + -1'p75 + p87 = 0
invariant :p72 + p73 + p90 + p91 = 1
invariant :p1 + p2 = 1
invariant :p47 + -1'p55 + p63 + -1'p71 + -1'p79 + p87 = 0
invariant :p33 + -1'p35 + 2'p37 + p38 + 2'p55 + 2'p71 + -2'p87 + -2'p90 + 2'p93 + p95 + p97 + -1'p98 + p100 + p101 + -1'p102 + p104 + p105 + p109 + -1'p112 + p114 = 0
invariant :p54 + p55 = 1
invariant :p49 + -1'p55 + p65 + -1'p71 + -1'p81 + p87 = 0
invariant :p13 + p14 = 1
invariant :p70 + p71 = 1
invariant :p8 + p9 = 1
invariant :p74 + p75 + p90 + p91 = 1
invariant :p34 + p35 = 1
invariant :p105 + p106 + p107 + p109 = 1
invariant :p28 + p29 = 1
invariant :p40 + p55 + -1'p57 + p71 + p73 + -1'p87 = 1
invariant :p45 + -1'p55 + p61 + -1'p71 + -1'p77 + p87 = 0
invariant :p46 + p55 + -1'p63 + p71 + p79 + -1'p87 = 1
invariant :p76 + p77 + p90 + p91 = 1
invariant :p10 + p11 = 1
invariant :p53 + -1'p55 + p69 + -1'p71 + -1'p85 + p87 = 0
invariant :p68 + p69 = 1
invariant :p6 + p7 = 1
invariant :p78 + p79 + p90 + p91 = 1
May 17, 2018 4:37:24 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 53 place invariants in 37 ms
invariant :p52 + p55 + -1'p69 + p71 + p85 + -1'p87 = 1
invariant :p60 + p61 = 1
invariant :-1'p97 + -1'p98 + p99 + p100 = 0
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 262 ms
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 57 transitions.
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/57 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 57 transitions.
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 17, 2018 4:37:25 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 57 transitions.
May 17, 2018 4:37:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 1612 ms. Total solver calls (SAT/UNSAT): 311(199/112)
May 17, 2018 4:37:26 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 57 transitions.
May 17, 2018 4:37:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 325 ms. Total solver calls (SAT/UNSAT): 27(0/27)
May 17, 2018 4:37:27 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 2476ms conformant to PINS in folder :/mcc-data
Running compilation step : CommandLine [args=[gcc, -c, -I/usr/bin/include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/mcc-data]
java.io.IOException: Cannot run program "gcc" (in directory "/mcc-data"): error=2, No such file or directory
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1048)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:46)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.application.LTSminRunner.compilePINS(LTSminRunner.java:235)
at fr.lip6.move.gal.application.LTSminRunner.access$6(LTSminRunner.java:220)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:75)
at java.lang.Thread.run(Thread.java:748)
Caused by: java.io.IOException: error=2, No such file or directory
at java.lang.UNIXProcess.forkAndExec(Native Method)
at java.lang.UNIXProcess.(UNIXProcess.java:247)
at java.lang.ProcessImpl.start(ProcessImpl.java:134)
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
... 6 more
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.76515e+09,6.12488,134620,2,30006,5,607228,6,0,491,672707,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,2420,12.7126,198976,2,809,7,1.0924e+06,9,1,2268,672707,2

System contains 2420 deadlocks (shown below if less than --print-limit option) !
FORMULA DES-PT-00a-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 2420 states ] showing 10 first states
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p28=1 p1=1 p26=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p28=1 p1=1 p26=1 p15=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p28=1 p1=1 p27=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p28=1 p1=1 p27=1 p16=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p28=1 p1=1 p27=1 p15=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p29=1 p1=1 p26=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p29=1 p1=1 p26=1 p15=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p29=1 p1=1 p27=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p29=1 p1=1 p27=1 p16=1 ]
[ p113=1 p111=1 p93=1 p98=1 p107=1 p99=1 p35=1 p32=1 p39=1 p91=1 p36=1 p70=1 p68=1 p66=1 p88=1 p64=1 p62=1 p60=1 p54=1 p58=1 p52=1 p50=1 p48=1 p46=1 p44=1 p42=1 p56=1 p10=1 p9=1 p40=1 p13=1 p3=1 p7=1 p29=1 p1=1 p27=1 p15=1 ]

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="DES-PT-00a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="mcc4mcc-full"
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/DES-PT-00a.tgz
mv DES-PT-00a 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-full"
echo " Input is DES-PT-00a, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-152646385600160"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.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 ;