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 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-COL-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474100458
=====================================================================

--------------------
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 PermAdmissibility-COL-20-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527153593141


BK_STOP 1527153891265

--------------------
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 PermAdmissibility-COL-20 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1679100, 'Memory': 15949.55, 'Tool': 'lola'}, {'Time': 1731033, 'Memory': 15946.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola PermAdmissibility-COL-20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PermAdmissibility-COL-20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-COL-20 @ 3539 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 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-20-CTLCardinality.task
lola: NOT(E (F (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p42)))))) : E (G ((E (F ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126))) OR TRUE))) : E (X ((A (G ((p166 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) OR (p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)))) : (A (G (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= 0) OR (p67 <= 0)))) OR ((E (X ((p118 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))) AND (3 <= p68)) AND ((p127 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153) AND (p157 <= p93)))) : (((((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p129) AND (p93 <= p156)) AND E (X ((p191 <= p17)))) OR (((p16 <= p118) OR (1 <= p154)) AND (p128 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))) AND (E (G (((3 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)))) AND NOT(E (G ((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))))) : A (F (NOT(E (F ((3 <= p154)))))) : A (G ((p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 <= p127))) : A (X (A (((p118 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145) U (1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))))) : (E (F ((1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))) AND A (F ((((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p128) OR (p157 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117)) AND (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : NOT(E (X (A (F ((2 <= p166)))))) : E (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) U E (F ((3 <= p127))))) : E (G ((E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) OR (2 <= p129)))) : A (X (NOT(A (F ((1 <= p156)))))) : E (F (((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p17) AND (p127 + 1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND (1 <= p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99)))) : E (((p156 <= 1) U E (F ((3 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145))))) : E (G (E (X ((p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p42 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: processed formula length: 80
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 321 markings, 360 edges
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126))) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p166 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) OR (p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p166 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p166))))
lola: processed formula length: 78
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 302 markings, 304 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))
lola: processed formula length: 100
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= 0) OR (p67 <= 0)))) OR ((E (X ((p118 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))) AND (3 <= p68)) AND ((p127 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153) AND (p157 <= p93))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= 0) OR (p67 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p118 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p118 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p68) AND ((p127 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153) AND (p157 <= p93)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p68) AND ((p127 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153) AND (p157 <= p93)))
lola: processed formula length: 100
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p129) AND (p93 <= p156)) AND E (X ((p191 <= p17)))) OR (((p16 <= p118) OR (1 <= p154)) AND (p128 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))) AND (E (G (((3 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p129) AND (p93 <= p156))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p129) AND (p93 <= p156))
lola: processed formula length: 200
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p16 <= p118) OR (1 <= p154)) AND (p128 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p16 <= p118) OR (1 <= p154)) AND (p128 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109) OR (p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 2) AND (p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + 1 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58))))
lola: processed formula length: 190
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1502372 markings, 1732795 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2980675 markings, 3517065 edges, 295661 markings/sec, 5 secs
lola: 4451866 markings, 5231368 edges, 294238 markings/sec, 10 secs
lola: 5930195 markings, 6978973 edges, 295666 markings/sec, 15 secs
lola: 7362862 markings, 8688235 edges, 286533 markings/sec, 20 secs
lola: 8814060 markings, 10444315 edges, 290240 markings/sec, 25 secs
lola: 10235008 markings, 12146000 edges, 284190 markings/sec, 30 secs
lola: 11653817 markings, 13833382 edges, 283762 markings/sec, 35 secs
lola: 13061399 markings, 15536743 edges, 281516 markings/sec, 40 secs
lola: 14540699 markings, 17382557 edges, 295860 markings/sec, 45 secs
lola: 16010221 markings, 19191569 edges, 293904 markings/sec, 50 secs
lola: 17526523 markings, 21076708 edges, 303260 markings/sec, 55 secs
lola: 19048990 markings, 22985442 edges, 304493 markings/sec, 60 secs
lola: 20506646 markings, 24865877 edges, 291531 markings/sec, 65 secs
lola: 21879005 markings, 26696419 edges, 274472 markings/sec, 70 secs
lola: 23286377 markings, 28502908 edges, 281474 markings/sec, 75 secs
lola: 24687552 markings, 30296126 edges, 280235 markings/sec, 80 secs
lola: 26060338 markings, 31988849 edges, 274557 markings/sec, 85 secs
lola: 27458794 markings, 33642844 edges, 279691 markings/sec, 90 secs
lola: 28823515 markings, 35270416 edges, 272944 markings/sec, 95 secs
lola: 30212736 markings, 36913124 edges, 277844 markings/sec, 100 secs
lola: 31627922 markings, 38676712 edges, 283037 markings/sec, 105 secs
lola: 33064724 markings, 40435463 edges, 287360 markings/sec, 110 secs
lola: 34484817 markings, 42220895 edges, 284019 markings/sec, 115 secs
lola: 35830598 markings, 43966845 edges, 269156 markings/sec, 120 secs
lola: 37085472 markings, 45656025 edges, 250975 markings/sec, 125 secs
lola: 38344287 markings, 47320276 edges, 251763 markings/sec, 130 secs
lola: 39642789 markings, 49031661 edges, 259700 markings/sec, 135 secs
lola: 40946100 markings, 50727089 edges, 260662 markings/sec, 140 secs
lola: 42297099 markings, 52445517 edges, 270200 markings/sec, 145 secs
lola: 43635498 markings, 54161411 edges, 267680 markings/sec, 150 secs
lola: 44851555 markings, 56008757 edges, 243211 markings/sec, 155 secs
lola: 46127100 markings, 57890527 edges, 255109 markings/sec, 160 secs
lola: 47401879 markings, 59746071 edges, 254956 markings/sec, 165 secs
lola: 48678795 markings, 61575017 edges, 255383 markings/sec, 170 secs
lola: 50040987 markings, 63362759 edges, 272438 markings/sec, 175 secs
lola: 51527193 markings, 65165469 edges, 297241 markings/sec, 180 secs
lola: 52935052 markings, 66950855 edges, 281572 markings/sec, 185 secs
lola: 54350418 markings, 68736434 edges, 283073 markings/sec, 190 secs
lola: 55739893 markings, 70417681 edges, 277895 markings/sec, 195 secs
lola: 57086987 markings, 72106081 edges, 269419 markings/sec, 200 secs
lola: 58423855 markings, 73765342 edges, 267374 markings/sec, 205 secs
lola: 59823240 markings, 75477036 edges, 279877 markings/sec, 210 secs
lola: 61280512 markings, 77213006 edges, 291454 markings/sec, 215 secs
lola: 62631670 markings, 78872695 edges, 270232 markings/sec, 220 secs
lola: 63975657 markings, 80548775 edges, 268797 markings/sec, 225 secs
lola: 65347020 markings, 82191316 edges, 274273 markings/sec, 230 secs
lola: 66747916 markings, 83935742 edges, 280179 markings/sec, 235 secs
lola: 68082666 markings, 85676423 edges, 266950 markings/sec, 240 secs
lola: 69402171 markings, 87467475 edges, 263901 markings/sec, 245 secs
lola: 70671399 markings, 89218368 edges, 253846 markings/sec, 250 secs
lola: 72005914 markings, 90845377 edges, 266903 markings/sec, 255 secs
lola: 73437792 markings, 92553098 edges, 286376 markings/sec, 260 secs
lola: 74807473 markings, 94219272 edges, 273936 markings/sec, 265 secs
lola: 76156774 markings, 95902223 edges, 269860 markings/sec, 270 secs
lola: 77430263 markings, 97613485 edges, 254698 markings/sec, 275 secs
lola: 78810047 markings, 99337557 edges, 275957 markings/sec, 280 secs
lola: 80200974 markings, 101071723 edges, 278185 markings/sec, 285 secs
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: '\ufffd'
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)
----- Kill lola and sara stderr -----
FORMULA PermAdmissibility-COL-20-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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