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 328K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 2.9K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 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 irma4mcc-structural
Input is PolyORBLF-COL-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732262000371
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527434706571


BK_STOP 1527435024806

--------------------
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-S04J06T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 120892, 'Memory': 400, 'Tool': 'lola'}, {'Time': 130224, 'Memory': 551, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-COL-S04J06T06...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S04J06T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S04J06T06: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S04J06T06 @ 3539 seconds
----- 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: 3808/65536 symbol table entries, 459 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: A ((p86 + p85 + p84 + p83 + p82 + p87 <= p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413)) : A (X (((3 <= p414) U X ((2 <= p364 + p365 + p366 + p367 + p368 + p369))))) : A ((p315 + p316 + p317 + p318 + p319 + p320 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p74)) : A (G ((G ((2 <= p480)) U F ((p278 + p279 + p280 + p281 + p282 + p283 <= p12))))) : A (F (((3 <= p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311) U F ((p384 + p385 + p386 + p387 + p388 + p389 <= p466 + p465 + p464 + p463))))) : A (X (((p6 + p7 + p8 + p9 + p10 + p11 <= p571 + p572 + p573 + p574 + p575 + p576) U X ((1 <= p271 + p272 + p273 + p274 + p275 + p276))))) : A (X ((G ((2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362)) U F ((3 <= p377 + p378 + p379 + p380 + p381 + p382 + p383))))) : A ((p224 + p225 + p226 + p227 <= p21 + p22 + p23 + p24 + p25 + p26)) : A ((((1 <= p20) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p92 + p91 + p90 + p89 + p88 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p507))))) : A (F ((p577 + p578 + p579 + p580 + p581 + p582 <= p596 + p597 + p598 + p599 + p600 + p601))) : A ((((2 <= p229 + p230 + p231 + p232 + p233 + p234) U (p363 <= p577 + p578 + p579 + p580 + p581 + p582)) U X (G ((p138 + p139 + p140 + p141 + p142 + p143 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185))))) : A ((2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362)) : A (X ((X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)) U F ((p20 <= p376))))) : A (((p488 + p489 + p490 + p491 + p492 + p493 <= p241 + p242 + p243 + p244 + p245 + p246) U (2 <= p278 + p279 + p280 + p281 + p282 + p283))) : A ((1 <= p6 + p7 + p8 + p9 + p10 + p11)) : A ((p608 + p609 + p610 + p611 + p612 + p613 <= p577 + p578 + p579 + p580 + p581 + p582))
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 ((p86 + p85 + p84 + p83 + p82 + p87 <= p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p86 + p85 + p84 + p83 + p82 + p87 <= p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413)
lola: processed formula length: 204
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= p414) U X ((2 <= p364 + p365 + p366 + p367 + p368 + p369)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((3 <= p414) U X ((2 <= p364 + p365 + p366 + p367 + p368 + p369)))))
lola: processed formula: A (X (((3 <= p414) U X ((2 <= p364 + p365 + p366 + p367 + p368 + p369)))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 25 markings, 36 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p315 + p316 + p317 + p318 + p319 + p320 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p74))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p315 + p316 + p317 + p318 + p319 + p320 <= p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p74)
lola: processed formula length: 294
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((2 <= p480)) U F ((p278 + p279 + p280 + p281 + p282 + p283 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((2 <= p480)) U F ((p278 + p279 + p280 + p281 + p282 + p283 <= p12)))))
lola: processed formula: A (G ((G ((2 <= p480)) U F ((p278 + p279 + p280 + p281 + p282 + p283 <= p12)))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 23754 markings, 24942 edges, 4751 markings/sec, 0 secs
lola: 47392 markings, 51185 edges, 4728 markings/sec, 5 secs
lola: 71028 markings, 77496 edges, 4727 markings/sec, 10 secs
lola: 94797 markings, 104954 edges, 4754 markings/sec, 15 secs
lola: 118516 markings, 132062 edges, 4744 markings/sec, 20 secs
lola: 142518 markings, 158572 edges, 4800 markings/sec, 25 secs
lola: 166401 markings, 185614 edges, 4777 markings/sec, 30 secs
lola: 190324 markings, 213278 edges, 4785 markings/sec, 35 secs
lola: 214469 markings, 241549 edges, 4829 markings/sec, 40 secs
lola: 238680 markings, 268976 edges, 4842 markings/sec, 45 secs
lola: 262860 markings, 297295 edges, 4836 markings/sec, 50 secs
lola: 286517 markings, 325087 edges, 4731 markings/sec, 55 secs
lola: 310539 markings, 353359 edges, 4804 markings/sec, 60 secs
lola: 334560 markings, 382164 edges, 4804 markings/sec, 65 secs
lola: 358290 markings, 408566 edges, 4746 markings/sec, 70 secs
lola: 382514 markings, 436381 edges, 4845 markings/sec, 75 secs
lola: 406615 markings, 465319 edges, 4820 markings/sec, 80 secs
lola: 431416 markings, 495261 edges, 4960 markings/sec, 85 secs
lola: 455810 markings, 523500 edges, 4879 markings/sec, 90 secs
lola: 480593 markings, 553963 edges, 4957 markings/sec, 95 secs
lola: 505136 markings, 582510 edges, 4909 markings/sec, 100 secs
lola: 529871 markings, 612414 edges, 4947 markings/sec, 105 secs
lola: 554504 markings, 641938 edges, 4927 markings/sec, 110 secs
lola: 578538 markings, 669908 edges, 4807 markings/sec, 115 secs
lola: 603558 markings, 699833 edges, 5004 markings/sec, 120 secs
lola: 628326 markings, 728744 edges, 4954 markings/sec, 125 secs
lola: 653314 markings, 757321 edges, 4998 markings/sec, 130 secs
lola: 678041 markings, 786916 edges, 4945 markings/sec, 135 secs
lola: 703008 markings, 817763 edges, 4993 markings/sec, 140 secs
lola: 727733 markings, 845673 edges, 4945 markings/sec, 145 secs
lola: 752747 markings, 875782 edges, 5003 markings/sec, 150 secs
lola: 777332 markings, 904457 edges, 4917 markings/sec, 155 secs
lola: 802452 markings, 934464 edges, 5024 markings/sec, 160 secs
lola: 827058 markings, 962447 edges, 4921 markings/sec, 165 secs
lola: 852025 markings, 993571 edges, 4993 markings/sec, 170 secs
lola: 877123 markings, 1024296 edges, 5020 markings/sec, 175 secs
lola: 902028 markings, 1053829 edges, 4981 markings/sec, 180 secs
lola: 926836 markings, 1084466 edges, 4962 markings/sec, 185 secs
lola: 951753 markings, 1113946 edges, 4983 markings/sec, 190 secs
lola: 976825 markings, 1144048 edges, 5014 markings/sec, 195 secs
lola: 1001471 markings, 1173855 edges, 4929 markings/sec, 200 secs
lola: 1026122 markings, 1201482 edges, 4930 markings/sec, 205 secs
lola: 1051120 markings, 1232298 edges, 5000 markings/sec, 210 secs
lola: 1075931 markings, 1261127 edges, 4962 markings/sec, 215 secs
lola: 1100216 markings, 1291379 edges, 4857 markings/sec, 220 secs
lola: 1124514 markings, 1321051 edges, 4860 markings/sec, 225 secs
lola: 1148332 markings, 1347285 edges, 4764 markings/sec, 230 secs
lola: 1172902 markings, 1374782 edges, 4914 markings/sec, 235 secs
lola: 1197801 markings, 1406001 edges, 4980 markings/sec, 240 secs
lola: 1222626 markings, 1435847 edges, 4965 markings/sec, 245 secs
lola: 1247234 markings, 1463916 edges, 4922 markings/sec, 250 secs
lola: 1272284 markings, 1494260 edges, 5010 markings/sec, 255 secs
lola: 1297204 markings, 1523959 edges, 4984 markings/sec, 260 secs
lola: 1322362 markings, 1555336 edges, 5032 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311) U F ((p384 + p385 + p386 + p387 + p388 + p389 <= p466 + p465 + p464 + p463)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311) U F ((p384 + p385 + p386 + p387 + p388 + p389 <= p466 + p465 + p464 + p463)))))
lola: processed formula: A (F (((3 <= p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311) U F ((p384 + p385 + p386 + p387 + p388 + p389 <= p466 + p465 + p464 + p463)))))
lola: processed formula length: 287
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p6 + p7 + p8 + p9 + p10 + p11 <= p571 + p572 + p573 + p574 + p575 + p576) U X ((1 <= p271 + p272 + p273 + p274 + p275 + p276)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p6 + p7 + p8 + p9 + p10 + p11 <= p571 + p572 + p573 + p574 + p575 + p576) U X ((1 <= p271 + p272 + p273 + p274 + p275 + p276)))))
lola: processed formula: A (X (((p6 + p7 + p8 + p9 + p10 + p11 <= p571 + p572 + p573 + p574 + p575 + p576) U X ((1 <= p271 + p272 + p273 + p274 + p275 + p276)))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 368 markings, 368 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362)) U F ((3 <= p377 + p378 + p379 + p380 + p381 + p382 + p383)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362)) U F ((3 <= p377 + p378 + p379 + p380 + p381 + p382 + p383)))))
lola: processed formula: A (X ((G ((2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362)) U F ((3 <= p377 + p378 + p379 + p380 + p381 + p382 + p383)))))
lola: processed formula length: 372
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 368 markings, 368 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p224 + p225 + p226 + p227 <= p21 + p22 + p23 + p24 + p25 + p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p224 + p225 + p226 + p227 <= p21 + p22 + p23 + p24 + p25 + p26)
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 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 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p20) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p92 + p91 + p90 + p89 + p88 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p507)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p20) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p92 + p91 + p90 + p89 + p88 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p507)))))
lola: processed formula: A ((((1 <= p20) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p92 + p91 + p90 + p89 + p88 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) U X (X ((3 <= p507)))))
lola: processed formula length: 329
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 368 markings, 368 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p577 + p578 + p579 + p580 + p581 + p582 <= p596 + p597 + p598 + p599 + p600 + p601)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p577 + p578 + p579 + p580 + p581 + p582 <= p596 + p597 + p598 + p599 + p600 + p601)))
lola: processed formula: A (F ((p577 + p578 + p579 + p580 + p581 + p582 <= p596 + p597 + p598 + p599 + p600 + p601)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p229 + p230 + p231 + p232 + p233 + p234) U (p363 <= p577 + p578 + p579 + p580 + p581 + p582)) U X (G ((p138 + p139 + p140 + p141 + p142 + p143 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= p229 + p230 + p231 + p232 + p233 + p234) U (p363 <= p577 + p578 + p579 + p580 + p581 + p582)) U X (G ((p138 + p139 + p140 + p141 + p142 + p143 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185)))))
lola: processed formula: A ((((2 <= p229 + p230 + p231 + p232 + p233 + p234) U (p363 <= p577 + p578 + p579 + p580 + p581 + p582)) U X (G ((p138 + p139 + p140 + p141 + p142 + p143 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 ... (shortened)
lola: processed formula length: 453
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 12652 markings, 13401 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362)
lola: processed formula length: 298
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 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 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)) U F ((p20 <= p376)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)) U F ((p20 <= p376)))))
lola: processed formula: A (X ((X ((2 <= p241 + p242 + p243 + p244 + p245 + p246)) U F ((p20 <= p376)))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p488 + p489 + p490 + p491 + p492 + p493 <= p241 + p242 + p243 + p244 + p245 + p246) U (2 <= p278 + p279 + p280 + p281 + p282 + p283)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p488 + p489 + p490 + p491 + p492 + p493 <= p241 + p242 + p243 + p244 + p245 + p246) U (2 <= p278 + p279 + p280 + p281 + p282 + p283)))
lola: processed formula: A (((p488 + p489 + p490 + p491 + p492 + p493 <= p241 + p242 + p243 + p244 + p245 + p246) U (2 <= p278 + p279 + p280 + p281 + p282 + p283)))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 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: 391 markings, 391 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p6 + p7 + p8 + p9 + p10 + p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p6 + p7 + p8 + p9 + p10 + p11)
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 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 15 will run for 3267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p608 + p609 + p610 + p611 + p612 + p613 <= p577 + p578 + p579 + p580 + p581 + p582))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p608 + p609 + p610 + p611 + p612 + p613 <= p577 + p578 + p579 + p580 + p581 + p582)
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 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: RESULT
lola:
SUMMARY: yes yes yes unknown yes no no no no yes no no yes no yes yes
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-15 TRUE 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-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
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/PolyORBLF-COL-S04J06T06.tgz
mv PolyORBLF-COL-S04J06T06 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 PolyORBLF-COL-S04J06T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-smll-152732262000371"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;