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.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K 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 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 irma4mcc-full
Input is PolyORBLF-COL-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260800363
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527417580097


BK_STOP 1527417878044

--------------------
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-S02J06T10 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': 233832, 'Memory': 15946.59, 'Tool': 'lola'}, {'Time': 381754, 'Memory': 15927.5, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-COL-S02J06T10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S02J06T10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S02J06T10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-COL-S02J06T10 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 2656/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: A (F (G (((3 <= p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533) U (2 <= p596))))) : A (G ((2 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566))) : A (F ((2 <= p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808))) : A ((G (G ((p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99))) U G (G ((p546 + p545 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p95))))) : A ((X (G ((p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277))) U F (X ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p439))))) : A ((p400 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75)) : A (G (F (G (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99)))))) : A (F ((F ((p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 <= p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718)) U F ((p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p95 <= p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648))))) : A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99))) : A (G (G (G (G ((p267 <= p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309)))))) : A ((F (X ((p10 <= p567))) U ((p34 <= p588) U (p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p298)))) : A (G (X ((p298 <= p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798)))) : A (((p544 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) U X (X ((2 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))))) : A (G ((1 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566))) : A ((2 <= p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287)) : A (F (X ((2 <= p829))))
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 (F (G (((3 <= p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533) U (2 <= p596)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533) U (2 <= p596)))))
lola: processed formula: A (F (G (((3 <= p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533) U (2 <= p596)))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 492 markings, 493 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808)))
lola: processed formula: A (F ((2 <= p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808)))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 78346 markings, 120914 edges, 15669 markings/sec, 0 secs
lola: 168261 markings, 259267 edges, 17983 markings/sec, 5 secs
lola: 254667 markings, 394382 edges, 17281 markings/sec, 10 secs
lola: 338082 markings, 524415 edges, 16683 markings/sec, 15 secs
lola: 425135 markings, 662057 edges, 17411 markings/sec, 20 secs
lola: 513652 markings, 800642 edges, 17703 markings/sec, 25 secs
lola: 597705 markings, 935493 edges, 16811 markings/sec, 30 secs
lola: 678720 markings, 1063375 edges, 16203 markings/sec, 35 secs
lola: 765828 markings, 1200204 edges, 17422 markings/sec, 40 secs
lola: 852085 markings, 1335506 edges, 17251 markings/sec, 45 secs
lola: 935691 markings, 1467168 edges, 16721 markings/sec, 50 secs
lola: 1021771 markings, 1599220 edges, 17216 markings/sec, 55 secs
lola: 1103725 markings, 1725325 edges, 16391 markings/sec, 60 secs
lola: 1184858 markings, 1853154 edges, 16227 markings/sec, 65 secs
lola: 1267937 markings, 1979991 edges, 16616 markings/sec, 70 secs
lola: 1345535 markings, 2106192 edges, 15520 markings/sec, 75 secs
lola: 1424498 markings, 2232772 edges, 15793 markings/sec, 80 secs
lola: 1506640 markings, 2358327 edges, 16428 markings/sec, 85 secs
lola: 1578912 markings, 2484090 edges, 14454 markings/sec, 90 secs
lola: 1661568 markings, 2610239 edges, 16531 markings/sec, 95 secs
lola: 1734533 markings, 2735387 edges, 14593 markings/sec, 100 secs
lola: 1815383 markings, 2862588 edges, 16170 markings/sec, 105 secs
lola: 1891030 markings, 2987235 edges, 15129 markings/sec, 110 secs
lola: 1968508 markings, 3113490 edges, 15496 markings/sec, 115 secs
lola: 2041489 markings, 3230238 edges, 14596 markings/sec, 120 secs
lola: 2118283 markings, 3358891 edges, 15359 markings/sec, 125 secs
lola: 2195034 markings, 3486079 edges, 15350 markings/sec, 130 secs
lola: 2277132 markings, 3616599 edges, 16420 markings/sec, 135 secs
lola: 2354493 markings, 3745586 edges, 15472 markings/sec, 140 secs
lola: 2437401 markings, 3873697 edges, 16582 markings/sec, 145 secs
lola: 2517588 markings, 3998475 edges, 16037 markings/sec, 150 secs
lola: 2598175 markings, 4124020 edges, 16117 markings/sec, 155 secs
lola: 2681244 markings, 4253216 edges, 16614 markings/sec, 160 secs
lola: 2760369 markings, 4379721 edges, 15825 markings/sec, 165 secs
lola: 2838465 markings, 4505284 edges, 15619 markings/sec, 170 secs
lola: 2920161 markings, 4631976 edges, 16339 markings/sec, 175 secs
lola: 2999562 markings, 4757518 edges, 15880 markings/sec, 180 secs
lola: 3076838 markings, 4882693 edges, 15455 markings/sec, 185 secs
lola: 3150721 markings, 4997005 edges, 14777 markings/sec, 190 secs
lola: 3230697 markings, 5120346 edges, 15995 markings/sec, 195 secs
lola: 3308524 markings, 5242735 edges, 15565 markings/sec, 200 secs
lola: 3383686 markings, 5367124 edges, 15032 markings/sec, 205 secs
lola: 3456479 markings, 5491557 edges, 14559 markings/sec, 210 secs
lola: 3532290 markings, 5615316 edges, 15162 markings/sec, 215 secs
lola: 3612913 markings, 5739712 edges, 16125 markings/sec, 220 secs
lola: 3692129 markings, 5862193 edges, 15843 markings/sec, 225 secs
lola: 3769803 markings, 5985348 edges, 15535 markings/sec, 230 secs
lola: 3838632 markings, 6109036 edges, 13766 markings/sec, 235 secs
lola: 3908206 markings, 6229438 edges, 13915 markings/sec, 240 secs
lola: 3985863 markings, 6349542 edges, 15531 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99))) U G (G ((p546 + p545 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p95)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99))) U G (G ((p546 + p545 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p95)))))
lola: processed formula: A ((G (G ((p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99))) U G (G ((p546 + p545 <= p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p95)))))
lola: processed formula length: 305
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 365 markings, 365 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277))) U F (X ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p439)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277))) U F (X ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p439)))))
lola: processed formula: A ((X (G ((p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 <= p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277))) U F (X ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p439)))))
lola: processed formula length: 232
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p400 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p400 + p399 + p398 + p397 + p396 + p395 + p394 + p393 + p392 + p391 <= p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75)
lola: processed formula length: 130
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-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 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99)))))
lola: processed formula: A (F (G (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99)))))
lola: processed formula length: 156
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 468 markings, 469 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 <= p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p69... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 <= p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718)) U F ((p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p95 <= p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648)))))
lola: processed formula: A (F ((F ((p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 <= p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p69... (shortened)
lola: processed formula length: 711
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p97 + p96 + p98 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((p267 <= p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (G ((p267 <= p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))))))
lola: processed formula: A (G (G (G (G ((p267 <= p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309))))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 381 markings, 381 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p10 <= p567))) U ((p34 <= p588) U (p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p298))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((p10 <= p567))) U ((p34 <= p588) U (p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p298))))
lola: processed formula: A ((F (X ((p10 <= p567))) U ((p34 <= p588) U (p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p65 <= p298))))
lola: processed formula length: 115
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((p298 <= p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((p298 <= p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798))))
lola: processed formula: A (G (X ((p298 <= p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798))))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 670 markings, 670 edges
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p544 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) U X (X ((2 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p544 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) U X (X ((2 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))))
lola: processed formula: A (((p544 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) U X (X ((2 <= p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))))
lola: processed formula length: 238
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 670 markings, 670 edges
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287)
lola: processed formula length: 74
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-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 15 will run for 3286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= p829))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= p829))))
lola: processed formula: A (F (X ((2 <= p829))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 670 markings, 670 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no yes no no yes no no yes no no no no no
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 FALSE 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-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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-full"
echo " Input is PolyORBLF-COL-S02J06T10, 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 r210-smll-152732260800363"
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 ;