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 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 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.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265500353
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527459764124


BK_STOP 1527459815342

--------------------
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-S02J04T06 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': 11412, 'Memory': 178.32, 'Tool': 'lola'}, {'Time': 23595, 'Memory': 339.56, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-COL-S02J04T06...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S02J04T06: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-COL-S02J04T06 @ 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: 1396/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: A (X ((3 <= p266 + p267 + p268 + p269 + p270 + p271))) : A ((p218 <= p68)) : A ((F ((p454 + p453 + p452 + p451 + p450 + p449 <= p231)) U ((p441 + p442 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p66 + p67) U (1 <= p206 + p207 + p208 + p209 + p210 + p211)))) : A ((3 <= p435 + p436 + p437 + p438 + p439 + p440)) : A (F ((p443 + p444 + p445 + p446 + p447 + p448 <= p467 + p468 + p469 + p470 + p471 + p472))) : A (((p309 + p310 + p311 + p312 + p313 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336) U G ((p75 <= p322 + p323)))) : A (X (X ((p55 <= p88)))) : A ((2 <= p394 + p395 + p396 + p397 + p398 + p399)) : A ((F ((2 <= p233 + p234 + p235 + p236 + p237 + p238)) U F (G ((p233 + p234 + p235 + p236 + p237 + p238 <= p81 + p80 + p79 + p78 + p77 + p76))))) : A (X ((3 <= p225 + p226 + p227 + p228 + p229 + p230))) : A ((p388 + p389 + p390 + p391 + p392 + p393 <= p179)) : A ((((p441 + p442 <= p273 + p274 + p275 + p276 + p277 + p278) U (3 <= p194 + p195 + p196 + p197 + p198 + p199)) U ((p454 + p453 + p452 + p451 + p450 + p449 <= p241 + p242 + p243 + p244 + p245 + p246) U (1 <= p260 + p261 + p262 + p263 + p264 + p265)))) : A (((p81 + p80 + p79 + p78 + p77 + p76 <= p260 + p261 + p262 + p263 + p264 + p265) U (3 <= p73 + p72 + p71 + p70 + p69 + p74))) : A ((p315 <= p412 + p413 + p414 + p415 + p416 + p417)) : A ((p73 + p72 + p71 + p70 + p69 + p74 <= p201 + p202 + p203 + p204 + p205)) : A ((((p182 + p183 + p184 + p185 + p186 + p187 <= p475) U (1 <= p179)) U ((p455 + p456 + p457 + p458 + p459 + p460 <= p218) U (2 <= p75))))
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 (X ((3 <= p266 + p267 + p268 + p269 + p270 + p271)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p266 + p267 + p268 + p269 + p270 + p271)))
lola: processed formula: A (X ((3 <= p266 + p267 + p268 + p269 + p270 + p271)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 444 markings, 444 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p218 <= p68))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p218 <= p68)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((p454 + p453 + p452 + p451 + p450 + p449 <= p231)) U ((p441 + p442 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p66 + p67) U (1 <= p206 + p207 + p208 + p209 + p210 + p211))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((p454 + p453 + p452 + p451 + p450 + p449 <= p231)) U ((p441 + p442 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p66 + p67) U (1 <= p206 + p207 + p208 + p209 + p210 + p211))))
lola: processed formula: A ((F ((p454 + p453 + p452 + p451 + p450 + p449 <= p231)) U ((p441 + p442 <= p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p66 + p67) U (1 <= p206 + p207 + p208 + p209 + p210 + p211))))
lola: processed formula length: 199
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8761 markings, 12027 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p435 + p436 + p437 + p438 + p439 + p440))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p435 + p436 + p437 + p438 + p439 + p440)
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p443 + p444 + p445 + p446 + p447 + p448 <= p467 + p468 + p469 + p470 + p471 + p472)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p443 + p444 + p445 + p446 + p447 + p448 <= p467 + p468 + p469 + p470 + p471 + p472)))
lola: processed formula: A (F ((p443 + p444 + p445 + p446 + p447 + p448 <= p467 + p468 + p469 + p470 + p471 + p472)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p309 + p310 + p311 + p312 + p313 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336) U G ((p75 <= p322 + p323))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p309 + p310 + p311 + p312 + p313 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336) U G ((p75 <= p322 + p323))))
lola: processed formula: A (((p309 + p310 + p311 + p312 + p313 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336) U G ((p75 <= p322 + p323))))
lola: processed formula length: 152
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 29 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: 331 markings, 331 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p55 <= p88))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((p55 <= p88))))
lola: processed formula: A (X (X ((p55 <= p88))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 444 markings, 444 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p394 + p395 + p396 + p397 + p398 + p399))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p394 + p395 + p396 + p397 + p398 + p399)
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= p233 + p234 + p235 + p236 + p237 + p238)) U F (G ((p233 + p234 + p235 + p236 + p237 + p238 <= p81 + p80 + p79 + p78 + p77 + p76)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p233 + p234 + p235 + p236 + p237 + p238)) U F (G ((p233 + p234 + p235 + p236 + p237 + p238 <= p81 + p80 + p79 + p78 + p77 + p76)))))
lola: processed formula: A ((F ((2 <= p233 + p234 + p235 + p236 + p237 + p238)) U F (G ((p233 + p234 + p235 + p236 + p237 + p238 <= p81 + p80 + p79 + p78 + p77 + p76)))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 3603 markings, 3646 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p225 + p226 + p227 + p228 + p229 + p230)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p225 + p226 + p227 + p228 + p229 + p230)))
lola: processed formula: A (X ((3 <= p225 + p226 + p227 + p228 + p229 + p230)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 444 markings, 444 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p388 + p389 + p390 + p391 + p392 + p393 <= p179))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p388 + p389 + p390 + p391 + p392 + p393 <= p179)
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p441 + p442 <= p273 + p274 + p275 + p276 + p277 + p278) U (3 <= p194 + p195 + p196 + p197 + p198 + p199)) U ((p454 + p453 + p452 + p451 + p450 + p449 <= p241 + p242 + p243 + p244 + p245 + p246) U (1 <= p260 + p261 + p262 + p263 + p264 + p265))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p441 + p442 <= p273 + p274 + p275 + p276 + p277 + p278) U (3 <= p194 + p195 + p196 + p197 + p198 + p199)) U ((p454 + p453 + p452 + p451 + p450 + p449 <= p241 + p242 + p243 + p244 + p245 + p246) U (1 <= p260 + p261 + p262 + p263 + p264 + p265))))
lola: processed formula: A ((((p441 + p442 <= p273 + p274 + p275 + p276 + p277 + p278) U (3 <= p194 + p195 + p196 + p197 + p198 + p199)) U ((p454 + p453 + p452 + p451 + p450 + p449 <= p241 + p242 + p243 + p244 + p245 + p246) U (1 <= p260 + p261 + p262 + p263 + p264 + p265))))
lola: processed formula length: 251
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 29 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: 33448 markings, 39790 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p81 + p80 + p79 + p78 + p77 + p76 <= p260 + p261 + p262 + p263 + p264 + p265) U (3 <= p73 + p72 + p71 + p70 + p69 + p74)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p81 + p80 + p79 + p78 + p77 + p76 <= p260 + p261 + p262 + p263 + p264 + p265) U (3 <= p73 + p72 + p71 + p70 + p69 + p74)))
lola: processed formula: A (((p81 + p80 + p79 + p78 + p77 + p76 <= p260 + p261 + p262 + p263 + p264 + p265) U (3 <= p73 + p72 + p71 + p70 + p69 + p74)))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 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: 298 markings, 298 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p315 <= p412 + p413 + p414 + p415 + p416 + p417))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p315 <= p412 + p413 + p414 + p415 + p416 + p417)
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-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 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p73 + p72 + p71 + p70 + p69 + p74 <= p201 + p202 + p203 + p204 + p205))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p73 + p72 + p71 + p70 + p69 + p74 <= p201 + p202 + p203 + p204 + p205)
lola: processed formula length: 71
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-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 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p182 + p183 + p184 + p185 + p186 + p187 <= p475) U (1 <= p179)) U ((p455 + p456 + p457 + p458 + p459 + p460 <= p218) U (2 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p182 + p183 + p184 + p185 + p186 + p187 <= p475) U (1 <= p179)) U ((p455 + p456 + p457 + p458 + p459 + p460 <= p218) U (2 <= p75))))
lola: processed formula: A ((((p182 + p183 + p184 + p185 + p186 + p187 <= p475) U (1 <= p179)) U ((p455 + p456 + p457 + p458 + p459 + p460 <= p218) U (2 <= p75))))
lola: processed formula length: 138
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 29 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: 78633 markings, 110044 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes no no no no no yes yes no yes yes no
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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-S02J04T06"
export BK_EXAMINATION="LTLCardinality"
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-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 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-S02J04T06, 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 r214-smll-152732265500353"
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 ;