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-full
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 r130-smll-152673532700094
=====================================================================

--------------------
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 1526882742891


BK_STOP 1526883045300

--------------------
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 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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- 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 (((p157 + p158 + p159 + p160 <= p28 + p29 + p30 + p31) U ((1 <= p76) AND (1 <= p204) AND (3 <= p411) AND (p257 + p258 + p259 + p260 + p261 + p262 <= p282 + p283 + p284 + p285)))) : (((3 <= p304 + p305 + p306 + p307) OR (3 <= p203) OR (p153 + p154 + p155 + p156 + 1 <= p310)) AND E (G (((p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 <= p76) OR (p311 + p312 + p313 + p314 <= p445 + p446 + p447 + p448) OR (1 <= p296 + p297 + p298 + p299))))) : A (F ((A (G ((2 <= p256 + p255 + p254 + p253 + p252 + p251))) AND ((p436 + p437 + p438 + p439 <= 1) OR (p390 + p391 + p392 + p393 + 1 <= p256 + p255 + p254 + p253 + p252 + p251))))) : ((E (F ((p149 + p150 + p151 + p152 <= 2))) AND ((p349 <= 0) OR (p186 + p187 + p188 + p189 + p190 <= 2) OR (p191 <= 1))) AND A (G (A (G ((p296 + p297 + p298 + p299 <= p344 + p345 + p346 + p347)))))) : A (G ((p153 + p154 + p155 + p156 <= 2))) : A (G (E (G (((1 <= p441 + p442 + p443 + p444) OR (2 <= p268 + p269 + p270 + p271 + p272)))))) : A ((E (F ((3 <= p290 + p291 + p292 + p293))) U ((p308 <= 2) AND (p153 + p154 + p155 + p156 <= 0)))) : NOT(E (X (E (F ((1 <= p239 + p240 + p241 + p242)))))) : NOT((E (F (((1 <= p157 + p158 + p159 + p160) OR (3 <= p311 + p312 + p313 + p314)))) OR (3 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138))) : A (F ((((p139 <= p24 + p25 + p26 + p27) AND ((1 <= p453 + p452 + p451 + p450) OR (p263 + p264 + p265 + p266 <= p24 + p25 + p26 + p27))) OR E (G ((3 <= p309)))))) : (NOT(E (((p436 + p437 + p438 + p439 <= p273) U (3 <= p411)))) AND (E (F (((3 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138) AND (3 <= p308)))) OR (3 <= p257 + p258 + p259 + p260 + p261 + p262))) : A (F ((((p230 + p231 + p232 + p233 <= 0) AND (p296 + p297 + p298 + p299 <= 0)) AND E (X ((2 <= p247 + p248 + p249 + p250)))))) : (E (G ((p197 + p198 + p199 + p200 + p201 + p202 <= p295))) AND E (X ((2 <= p256 + p255 + p254 + p253 + p252 + p251)))) : NOT(A (F ((p308 <= p204)))) : NOT((((p267 <= 1) AND (1 <= p295)) AND A (F (((p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 <= p441 + p442 + p443 + p444) AND (3 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)))))) : E (((p115 + p116 + p117 + p118 <= p139) U E (G ((p405 <= p290 + p291 + p292 + p293)))))
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 (((p157 + p158 + p159 + p160 <= p28 + p29 + p30 + p31) U ((1 <= p76) AND (1 <= p204) AND (3 <= p411) AND (p257 + p258 + p259 + p260 + p261 + p262 <= p282 + p283 + p284 + p285))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p157 + p158 + p159 + p160 <= p28 + p29 + p30 + p31) U ((1 <= p76) AND (1 <= p204) AND (3 <= p411) AND (p257 + p258 + p259 + p260 + p261 + p262 <= p282 + p283 + p284 + p285))))
lola: processed formula: A (((p157 + p158 + p159 + p160 <= p28 + p29 + p30 + p31) U ((1 <= p76) AND (1 <= p204) AND (3 <= p411) AND (p257 + p258 + p259 + p260 + p261 + p262 <= p282 + p283 + p284 + p285))))
lola: processed formula length: 180
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 <= p304 + p305 + p306 + p307) OR (3 <= p203) OR (p153 + p154 + p155 + p156 + 1 <= p310)) AND E (G (((p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 <= p76) OR (p311 + p312 + p313 + p314 <= p445 + p446 + p447 + p448) OR (1 <= p296 + p297 + p298 + p299)))))
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 <= p304 + p305 + p306 + p307) OR (3 <= p203) OR (p153 + p154 + p155 + p156 + 1 <= p310))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p304 + p305 + p306 + p307) OR (3 <= p203) OR (p153 + p154 + p155 + p156 + 1 <= p310))
lola: processed formula length: 94
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 (((p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 <= p76) OR (p311 + p312 + p313 + p314 <= p445 + p446 + p447 + p448) OR (1 <= p296 + p297 + p298 + p299))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p76 + 1 <= p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435) AND (p445 + p446 + p447 + p448 + 1 <= p311 + p312 + p313 + p314) AND (p296 + p297 + p298 + p299 <= 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 <= p256 + p255 + p254 + p253 + p252 + p251))) AND ((p436 + p437 + p438 + p439 <= 1) OR (p390 + p391 + p392 + p393 + 1 <= p256 + p255 + p254 + p253 + p252 + p251)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= p256 + p255 + p254 + p253 + p252 + p251))) AND ((p436 + p437 + p438 + p439 <= 1) OR (p390 + p391 + p392 + p393 + 1 <= p256 + p255 + p254 + p253 + p252 + p251)))))
lola: processed formula: A (F ((A (G ((2 <= p256 + p255 + p254 + p253 + p252 + p251))) AND ((p436 + p437 + p438 + p439 <= 1) OR (p390 + p391 + p392 + p393 + 1 <= p256 + p255 + p254 + p253 + p252 + p251)))))
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 ((p149 + p150 + p151 + p152 <= 2))) AND ((p349 <= 0) OR (p186 + p187 + p188 + p189 + p190 <= 2) OR (p191 <= 1))) AND A (G (A (G ((p296 + p297 + p298 + p299 <= p344 + p345 + p346 + p347))))))
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 ((p149 + p150 + p151 + p152 <= 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: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 27 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p349 <= 0) OR (p186 + p187 + p188 + p189 + p190 <= 2) OR (p191 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p349 <= 0) OR (p186 + p187 + p188 + p189 + p190 <= 2) OR (p191 <= 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 ((p296 + p297 + p298 + p299 <= p344 + p345 + p346 + p347)))
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: 1060 markings, 1724 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 ((p153 + p154 + p155 + p156 <= 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 || 17389 markings, 41598 edges, 3478 markings/sec, 0 secs
lola: sara is running 5 secs || 34495 markings, 88011 edges, 3421 markings/sec, 5 secs
lola: sara is running 10 secs || 52729 markings, 137060 edges, 3647 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 77112 markings, 202140 edges, 4877 markings/sec, 15 secs
lola: sara is running 20 secs || 103217 markings, 276931 edges, 5221 markings/sec, 20 secs
lola: sara is running 25 secs || 120446 markings, 324738 edges, 3446 markings/sec, 25 secs
lola: sara is running 30 secs || 136303 markings, 375317 edges, 3171 markings/sec, 30 secs
lola: sara is running 35 secs || 153240 markings, 427495 edges, 3387 markings/sec, 35 secs
lola: sara is running 40 secs || 179075 markings, 507143 edges, 5167 markings/sec, 40 secs
lola: sara is running 45 secs || 201213 markings, 580743 edges, 4428 markings/sec, 45 secs
lola: sara is running 50 secs || 219293 markings, 623722 edges, 3616 markings/sec, 50 secs
lola: sara is running 55 secs || 236464 markings, 676772 edges, 3434 markings/sec, 55 secs
lola: sara is running 60 secs || 258048 markings, 741991 edges, 4317 markings/sec, 60 secs
lola: sara is running 65 secs || 284197 markings, 822139 edges, 5230 markings/sec, 65 secs
lola: sara is running 70 secs || 301259 markings, 869781 edges, 3412 markings/sec, 70 secs
lola: sara is running 75 secs || 317390 markings, 920052 edges, 3226 markings/sec, 75 secs
lola: sara is running 80 secs || 338188 markings, 981625 edges, 4160 markings/sec, 80 secs
lola: sara is running 85 secs || 362795 markings, 1057545 edges, 4921 markings/sec, 85 secs
lola: sara is running 90 secs || 380016 markings, 1107612 edges, 3444 markings/sec, 90 secs
lola: sara is running 95 secs || 397011 markings, 1155426 edges, 3399 markings/sec, 95 secs
lola: sara is running 100 secs || 417763 markings, 1216503 edges, 4150 markings/sec, 100 secs
lola: sara is running 105 secs || 443375 markings, 1291579 edges, 5122 markings/sec, 105 secs
lola: sara is running 110 secs || 460510 markings, 1340930 edges, 3427 markings/sec, 110 secs
lola: sara is running 115 secs || 476831 markings, 1389315 edges, 3264 markings/sec, 115 secs
lola: sara is running 120 secs || 496968 markings, 1449202 edges, 4027 markings/sec, 120 secs
lola: sara is running 125 secs || 521528 markings, 1523949 edges, 4912 markings/sec, 125 secs
lola: sara is running 130 secs || 539140 markings, 1574015 edges, 3522 markings/sec, 130 secs
lola: sara is running 135 secs || 556329 markings, 1625210 edges, 3438 markings/sec, 135 secs
lola: sara is running 140 secs || 576987 markings, 1685405 edges, 4132 markings/sec, 140 secs
lola: sara is running 145 secs || 601831 markings, 1761883 edges, 4969 markings/sec, 145 secs
lola: sara is running 150 secs || 621310 markings, 1822206 edges, 3896 markings/sec, 150 secs
lola: sara is running 155 secs || 638452 markings, 1872636 edges, 3428 markings/sec, 155 secs
lola: sara is running 160 secs || 658087 markings, 1929974 edges, 3927 markings/sec, 160 secs
lola: sara is running 165 secs || 683456 markings, 2006160 edges, 5074 markings/sec, 165 secs
lola: sara is running 170 secs || 703308 markings, 2070001 edges, 3970 markings/sec, 170 secs
lola: sara is running 175 secs || 719473 markings, 2116164 edges, 3233 markings/sec, 175 secs
lola: sara is running 180 secs || 736563 markings, 2167329 edges, 3418 markings/sec, 180 secs
lola: sara is running 185 secs || 760814 markings, 2240028 edges, 4850 markings/sec, 185 secs
lola: sara is running 190 secs || 782375 markings, 2305733 edges, 4312 markings/sec, 190 secs
lola: sara is running 195 secs || 799551 markings, 2353971 edges, 3435 markings/sec, 195 secs
lola: sara is running 200 secs || 818358 markings, 2407383 edges, 3761 markings/sec, 200 secs
lola: sara is running 205 secs || 842990 markings, 2478593 edges, 4926 markings/sec, 205 secs
lola: sara is running 210 secs || 863406 markings, 2543955 edges, 4083 markings/sec, 210 secs
lola: sara is running 215 secs || 879664 markings, 2588758 edges, 3252 markings/sec, 215 secs
lola: sara is running 220 secs || 896631 markings, 2636998 edges, 3393 markings/sec, 220 secs
lola: sara is running 225 secs || 921128 markings, 2708217 edges, 4899 markings/sec, 225 secs
lola: sara is running 230 secs || 940936 markings, 2774051 edges, 3962 markings/sec, 230 secs
lola: sara is running 235 secs || 957399 markings, 2822636 edges, 3293 markings/sec, 235 secs
lola: sara is running 240 secs || 973976 markings, 2871354 edges, 3315 markings/sec, 240 secs
lola: sara is running 245 secs || 995210 markings, 2934430 edges, 4247 markings/sec, 245 secs
lola: sara is running 250 secs || 1020377 markings, 3015017 edges, 5033 markings/sec, 250 secs
lola: sara is running 255 secs || 1037689 markings, 3068631 edges, 3462 markings/sec, 255 secs
lola: sara is running 260 secs || 1054645 markings, 3118189 edges, 3391 markings/sec, 260 secs
lola: sara is running 265 secs || 1077625 markings, 3190805 edges, 4596 markings/sec, 265 secs
lola: sara is running 270 secs || 1103059 markings, 3273821 edges, 5087 markings/sec, 270 secs
lola: sara is running 275 secs || 1120058 markings, 3324040 edges, 3400 markings/sec, 275 secs
lola: sara is running 280 secs || 1136017 markings, 3375175 edges, 3192 markings/sec, 280 secs
lola: sara is running 285 secs || 1152943 markings, 3427188 edges, 3385 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-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/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-full"
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 r130-smll-152673532700094"
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 ;