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

About the Execution of M4M.struct for PolyORBLF-COL-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
923.300 302376.00 597984.00 1408.70 ???????????????? 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 336K
-rw-r--r-- 1 mcc users 4.0K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534000094
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526906017350


BK_STOP 1526906319726

--------------------
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 PolyORBLF-COL-S06J04T04 as instance name.
Using PolyORBLF 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3842, 'Memory': 250.13, 'Tool': 'lola'}, {'Time': 11025, 'Memory': 418.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S06J04T04...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-COL-S06J04T04 @ 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: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: A (((p278 + p279 + p280 + p281 <= p286 + p287 + p288 + p289) U ((1 <= p87) AND (1 <= p304) AND (3 <= p82) AND (p182 + p183 + p184 + p185 + p186 + p187 <= p116 + p117 + p118 + p119)))) : (((3 <= p94 + p93 + p92 + p95) OR (3 <= p315) OR (p44 + p45 + p46 + p47 + 1 <= p176)) AND E (G (((p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 <= p87) OR (p307 + p308 + p309 + p310 <= p158 + p159 + p160 + p161) OR (1 <= p409 + p410 + p411 + p412))))) : A (F ((A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208))) AND ((p300 + p301 + p302 + p303 <= 1) OR (p135 + p136 + p137 + p138 + 1 <= p213 + p212 + p211 + p210 + p209 + p208))))) : ((E (F ((p417 + p416 + p415 + p414 <= 2))) AND ((p192 <= 0) OR (p340 + p341 + p342 + p343 + p344 <= 2) OR (p276 <= 1))) AND A (G (A (G ((p409 + p410 + p411 + p412 <= p282 + p283 + p284 + p285)))))) : A (G ((p44 + p45 + p46 + p47 <= 2))) : A (G (E (G (((1 <= p194 + p195 + p196 + p197) OR (2 <= p369 + p370 + p371 + p372 + p373)))))) : A ((E (F ((3 <= p131 + p132 + p133 + p134))) U ((p275 <= 2) AND (p44 + p45 + p46 + p47 <= 0)))) : NOT(E (X (E (F ((1 <= p145 + p146 + p147 + p148)))))) : NOT((E (F (((1 <= p278 + p279 + p280 + p281) OR (3 <= p307 + p308 + p309 + p310)))) OR (3 <= p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254))) : A (F ((((p306 <= p450 + p451 + p452 + p453) AND ((1 <= p290 + p291 + p292 + p293) OR (p214 + p215 + p216 + p217 <= p450 + p451 + p452 + p453))) OR E (G ((3 <= p299)))))) : (NOT(E (((p300 + p301 + p302 + p303 <= p413) U (3 <= p82)))) AND (E (F (((3 <= p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254) AND (3 <= p275)))) OR (3 <= p182 + p183 + p184 + p185 + p186 + p187))) : A (F ((((p218 + p219 + p220 + p221 <= 0) AND (p409 + p410 + p411 + p412 <= 0)) AND E (X ((2 <= p188 + p189 + p190 + p191)))))) : (E (G ((p139 + p140 + p141 + p142 + p143 + p144 <= p126))) AND E (X ((2 <= p213 + p212 + p211 + p210 + p209 + p208)))) : NOT(A (F ((p275 <= p304)))) : NOT((((p202 <= 1) AND (1 <= p126)) AND A (F (((p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 <= p194 + p195 + p196 + p197) AND (3 <= p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254)))))) : E (((p178 + p179 + p180 + p181 <= p306) U E (G ((p374 <= p131 + p132 + p133 + p134)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p278 + p279 + p280 + p281 <= p286 + p287 + p288 + p289) U ((1 <= p87) AND (1 <= p304) AND (3 <= p82) AND (p182 + p183 + p184 + p185 + p186 + p187 <= p116 + p117 + p118 + p119))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p278 + p279 + p280 + p281 <= p286 + p287 + p288 + p289) U ((1 <= p87) AND (1 <= p304) AND (3 <= p82) AND (p182 + p183 + p184 + p185 + p186 + p187 <= p116 + p117 + p118 + p119))))
lola: processed formula: A (((p278 + p279 + p280 + p281 <= p286 + p287 + p288 + p289) U ((1 <= p87) AND (1 <= p304) AND (3 <= p82) AND (p182 + p183 + p184 + p185 + p186 + p187 <= p116 + p117 + p118 + p119))))
lola: processed formula length: 183
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p94 + p93 + p92 + p95) OR (3 <= p315) OR (p44 + p45 + p46 + p47 + 1 <= p176)) AND E (G (((p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 <= p87) OR (p307 + p308 + p309 + p310 <= p158 + p159 + p160 + p161) OR (1 <= p409 + p410 + p411 + p412)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p94 + p93 + p92 + p95) OR (3 <= p315) OR (p44 + p45 + p46 + p47 + 1 <= p176))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p94 + p93 + p92 + p95) OR (3 <= p315) OR (p44 + p45 + p46 + p47 + 1 <= p176))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 <= p87) OR (p307 + p308 + p309 + p310 <= p158 + p159 + p160 + p161) OR (1 <= p409 + p410 + p411 + p412))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p87 + 1 <= p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445) AND (p158 + p159 + p160 + p161 + 1 <= p307 + p308 + p309 + p310) AND (p409 + p410 + p411 + p412 <= 0))))
lola: processed formula length: 297
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208))) AND ((p300 + p301 + p302 + p303 <= 1) OR (p135 + p136 + p137 + p138 + 1 <= p213 + p212 + p211 + p210 + p209 + p208)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208))) AND ((p300 + p301 + p302 + p303 <= 1) OR (p135 + p136 + p137 + p138 + 1 <= p213 + p212 + p211 + p210 + p209 + p208)))))
lola: processed formula: A (F ((A (G ((2 <= p213 + p212 + p211 + p210 + p209 + p208))) AND ((p300 + p301 + p302 + p303 <= 1) OR (p135 + p136 + p137 + p138 + 1 <= p213 + p212 + p211 + p210 + p209 + p208)))))
lola: processed formula length: 182
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p417 + p416 + p415 + p414 <= 2))) AND ((p192 <= 0) OR (p340 + p341 + p342 + p343 + p344 <= 2) OR (p276 <= 1))) AND A (G (A (G ((p409 + p410 + p411 + p412 <= p282 + p283 + p284 + p285))))))
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: E (F ((p417 + p416 + p415 + p414 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p192 <= 0) OR (p340 + p341 + p342 + p343 + p344 <= 2) OR (p276 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p192 <= 0) OR (p340 + p341 + p342 + p343 + p344 <= 2) OR (p276 <= 1))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p409 + p410 + p411 + p412 <= p282 + p283 + p284 + p285)))
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 1616 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 132 markings, 132 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: A (G ((p44 + p45 + p46 + p47 <= 2)))
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 1616 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-4.sara.
lola: sara is running 0 secs || 13175 markings, 13714 edges, 2635 markings/sec, 0 secs
lola: sara is running 5 secs || 27022 markings, 28213 edges, 2769 markings/sec, 5 secs
lola: sara is running 10 secs || 40950 markings, 43214 edges, 2786 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 54772 markings, 57724 edges, 2764 markings/sec, 15 secs
lola: sara is running 20 secs || 68585 markings, 72171 edges, 2763 markings/sec, 20 secs
lola: sara is running 25 secs || 82346 markings, 86530 edges, 2752 markings/sec, 25 secs
lola: sara is running 30 secs || 95845 markings, 100716 edges, 2700 markings/sec, 30 secs
lola: sara is running 35 secs || 109400 markings, 115073 edges, 2711 markings/sec, 35 secs
lola: sara is running 40 secs || 123087 markings, 129475 edges, 2737 markings/sec, 40 secs
lola: sara is running 45 secs || 136674 markings, 143692 edges, 2717 markings/sec, 45 secs
lola: sara is running 50 secs || 150232 markings, 158256 edges, 2712 markings/sec, 50 secs
lola: sara is running 55 secs || 163812 markings, 172484 edges, 2716 markings/sec, 55 secs
lola: sara is running 60 secs || 177230 markings, 186665 edges, 2684 markings/sec, 60 secs
lola: sara is running 65 secs || 190715 markings, 201856 edges, 2697 markings/sec, 65 secs
lola: sara is running 70 secs || 204296 markings, 216175 edges, 2716 markings/sec, 70 secs
lola: sara is running 75 secs || 217868 markings, 230440 edges, 2714 markings/sec, 75 secs
lola: sara is running 80 secs || 231367 markings, 244588 edges, 2700 markings/sec, 80 secs
lola: sara is running 85 secs || 244905 markings, 258781 edges, 2708 markings/sec, 85 secs
lola: sara is running 90 secs || 258416 markings, 272992 edges, 2702 markings/sec, 90 secs
lola: sara is running 95 secs || 271709 markings, 287012 edges, 2659 markings/sec, 95 secs
lola: sara is running 100 secs || 285243 markings, 302715 edges, 2707 markings/sec, 100 secs
lola: sara is running 105 secs || 298651 markings, 316901 edges, 2682 markings/sec, 105 secs
lola: sara is running 110 secs || 312039 markings, 331049 edges, 2678 markings/sec, 110 secs
lola: sara is running 115 secs || 325657 markings, 345332 edges, 2724 markings/sec, 115 secs
lola: sara is running 120 secs || 339187 markings, 359646 edges, 2706 markings/sec, 120 secs
lola: sara is running 125 secs || 352731 markings, 373874 edges, 2709 markings/sec, 125 secs
lola: sara is running 130 secs || 366072 markings, 388017 edges, 2668 markings/sec, 130 secs
lola: sara is running 135 secs || 379265 markings, 402598 edges, 2639 markings/sec, 135 secs
lola: sara is running 140 secs || 392722 markings, 417256 edges, 2691 markings/sec, 140 secs
lola: sara is running 145 secs || 406055 markings, 431532 edges, 2667 markings/sec, 145 secs
lola: sara is running 150 secs || 419399 markings, 446287 edges, 2669 markings/sec, 150 secs
lola: sara is running 155 secs || 432591 markings, 461003 edges, 2638 markings/sec, 155 secs
lola: sara is running 160 secs || 445750 markings, 475143 edges, 2632 markings/sec, 160 secs
lola: sara is running 165 secs || 458940 markings, 489397 edges, 2638 markings/sec, 165 secs
lola: sara is running 170 secs || 472110 markings, 504017 edges, 2634 markings/sec, 170 secs
lola: sara is running 175 secs || 485470 markings, 518124 edges, 2672 markings/sec, 175 secs
lola: sara is running 180 secs || 498717 markings, 532122 edges, 2649 markings/sec, 180 secs
lola: sara is running 185 secs || 511984 markings, 546960 edges, 2653 markings/sec, 185 secs
lola: sara is running 190 secs || 525239 markings, 561266 edges, 2651 markings/sec, 190 secs
lola: sara is running 195 secs || 538448 markings, 576070 edges, 2642 markings/sec, 195 secs
lola: sara is running 200 secs || 551810 markings, 591539 edges, 2672 markings/sec, 200 secs
lola: sara is running 205 secs || 565091 markings, 606319 edges, 2656 markings/sec, 205 secs
lola: sara is running 210 secs || 578186 markings, 620917 edges, 2619 markings/sec, 210 secs
lola: sara is running 215 secs || 591545 markings, 635708 edges, 2672 markings/sec, 215 secs
lola: sara is running 220 secs || 604926 markings, 651528 edges, 2676 markings/sec, 220 secs
lola: sara is running 225 secs || 618259 markings, 667297 edges, 2667 markings/sec, 225 secs
lola: sara is running 230 secs || 631639 markings, 682569 edges, 2676 markings/sec, 230 secs
lola: sara is running 235 secs || 644927 markings, 697902 edges, 2658 markings/sec, 235 secs
lola: sara is running 240 secs || 658342 markings, 713127 edges, 2683 markings/sec, 240 secs
lola: sara is running 245 secs || 671304 markings, 727734 edges, 2592 markings/sec, 245 secs
lola: sara is running 250 secs || 684534 markings, 741940 edges, 2646 markings/sec, 250 secs
lola: sara is running 255 secs || 697895 markings, 757416 edges, 2672 markings/sec, 255 secs
lola: sara is running 260 secs || 711150 markings, 773632 edges, 2651 markings/sec, 260 secs
lola: sara is running 265 secs || 724305 markings, 787887 edges, 2631 markings/sec, 265 secs
lola: sara is running 270 secs || 737420 markings, 802445 edges, 2623 markings/sec, 270 secs
lola: sara is running 275 secs || 750618 markings, 818808 edges, 2640 markings/sec, 275 secs
lola: sara is running 280 secs || 763883 markings, 833717 edges, 2653 markings/sec, 280 secs
lola: sara is running 285 secs || 777200 markings, 848889 edges, 2663 markings/sec, 285 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 PolyORBLF-COL-S06J04T04-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL 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="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="CTLCardinality"
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/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 PolyORBLF-COL-S06J04T04, 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 r131-smll-152673534000094"
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 ;