About the Execution of M4M.full for GlobalResAllocation-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4631.620 | 902656.00 | 1306894.00 | 2369.00 | ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? | 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 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is GlobalResAllocation-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006400373
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-00
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-01
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-02
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-03
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-04
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-05
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-06
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-07
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-08
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-09
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-10
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-11
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-12
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-13
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-14
FORMULA_NAME GlobalResAllocation-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527559895833
BK_STOP 1527560798489
--------------------
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 GlobalResAllocation-COL-06 as instance name.
Using GlobalResAllocation as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 3539567, 'Memory': 2589.83, 'Tool': 'lola'}, {'Time': 3540602, 'Memory': 2513.8, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
UpperBounds lola GlobalResAllocation-COL-06...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
GlobalResAllocation-COL-06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
GlobalResAllocation-COL-06: translating COL formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
UpperBounds @ GlobalResAllocation-COL-06 @ 2838 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 2838 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 136764/65536 symbol table entries, 111398 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 136662 transitions, 78 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5250 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-06-UpperBounds.task
lola: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p100 + p101 + p96 + p97 + p98 + p99) : MAX(p18 + p19 + p20 + p23 + p22 + p21) : MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) : MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 56 markings, 83 edges, 11 markings/sec, 5 secs
lola: 121 markings, 189 edges, 13 markings/sec, 10 secs
lola: 207 markings, 332 edges, 17 markings/sec, 15 secs
lola: 268 markings, 430 edges, 12 markings/sec, 20 secs
lola: 362 markings, 583 edges, 19 markings/sec, 25 secs
lola: 423 markings, 683 edges, 12 markings/sec, 30 secs
lola: 501 markings, 812 edges, 16 markings/sec, 35 secs
lola: 574 markings, 933 edges, 15 markings/sec, 40 secs
lola: 649 markings, 1073 edges, 15 markings/sec, 45 secs
lola: 737 markings, 1224 edges, 18 markings/sec, 50 secs
lola: 822 markings, 1366 edges, 17 markings/sec, 55 secs
lola: 899 markings, 1496 edges, 15 markings/sec, 60 secs
lola: 1024 markings, 1700 edges, 25 markings/sec, 65 secs
lola: 1111 markings, 1871 edges, 17 markings/sec, 70 secs
lola: 1175 markings, 1980 edges, 13 markings/sec, 75 secs
lola: 1252 markings, 2119 edges, 15 markings/sec, 80 secs
lola: 1333 markings, 2254 edges, 16 markings/sec, 85 secs
lola: 1417 markings, 2392 edges, 17 markings/sec, 90 secs
lola: 1477 markings, 2490 edges, 12 markings/sec, 95 secs
lola: 1547 markings, 2603 edges, 14 markings/sec, 100 secs
lola: 1621 markings, 2729 edges, 15 markings/sec, 105 secs
lola: 1703 markings, 2867 edges, 16 markings/sec, 110 secs
lola: 1791 markings, 3016 edges, 18 markings/sec, 115 secs
lola: 1900 markings, 3206 edges, 22 markings/sec, 120 secs
lola: 1999 markings, 3373 edges, 20 markings/sec, 125 secs
lola: 2068 markings, 3502 edges, 14 markings/sec, 130 secs
lola: 2145 markings, 3633 edges, 15 markings/sec, 135 secs
lola: 2235 markings, 3793 edges, 18 markings/sec, 140 secs
lola: 2309 markings, 3923 edges, 15 markings/sec, 145 secs
lola: 2416 markings, 4104 edges, 21 markings/sec, 150 secs
lola: 2495 markings, 4233 edges, 16 markings/sec, 155 secs
lola: 2602 markings, 4413 edges, 21 markings/sec, 160 secs
lola: 2689 markings, 4556 edges, 17 markings/sec, 165 secs
lola: 2785 markings, 4728 edges, 19 markings/sec, 170 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
Aborted (core dumped)
FORMULA GlobalResAllocation-COL-06-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-15 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----
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="GlobalResAllocation-COL-06"
export BK_EXAMINATION="UpperBounds"
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/GlobalResAllocation-COL-06.tgz
mv GlobalResAllocation-COL-06 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 GlobalResAllocation-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-blw7-152650006400373"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 ;