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 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 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.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584700129
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527462863972


BK_STOP 1527463796490

--------------------
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 PermAdmissibility-COL-10 as instance name.
Using PermAdmissibility 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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1769493, 'Memory': 7934.23, 'Tool': 'lola'}, {'Time': 1770567, 'Memory': 11344.28, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-COL-10 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-LTLCardinality.task
lola: A ((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)) : A (X ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p53))) : A (X (G (X (F ((2 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))) : A (X (((2 <= p140) U G ((p140 <= p106))))) : A (X (F (F ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))) : A ((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 <= p158)) : A ((p43 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)) : A (X (G (F ((1 <= p43))))) : A ((((1 <= p158) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)) U G (G ((1 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79))))) : A (G ((3 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) : A ((p53 <= p55)) : A (F ((2 <= p105))) : A (X ((p44 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))) : A (((2 <= p55) U F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))) : A (X (F (G ((2 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114))))) : A (X (G (G ((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))
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 ((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p53)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p53)))
lola: processed formula: A (X ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p53)))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((2 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (F ((2 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))))
lola: processed formula: A (X (G (X (F ((2 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 270 markings, 270 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p140) U G ((p140 <= p106)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= p140) U G ((p140 <= p106)))))
lola: processed formula: A (X (((2 <= p140) U G ((p140 <= p106)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))
lola: processed formula: A (X (F ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63))))
lola: processed formula length: 108
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 <= p158))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 <= p158)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p43 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p43 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((1 <= p43)))))
lola: processed formula: A (X (G (F ((1 <= p43)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 1057847 markings, 1190837 edges, 211569 markings/sec, 0 secs
lola: 2086250 markings, 2402000 edges, 205681 markings/sec, 5 secs
lola: 3183445 markings, 3659131 edges, 219439 markings/sec, 10 secs
lola: 4216530 markings, 4834798 edges, 206617 markings/sec, 15 secs
lola: 5136867 markings, 5885074 edges, 184067 markings/sec, 20 secs
lola: 6110537 markings, 6994416 edges, 194734 markings/sec, 25 secs
lola: 7043124 markings, 8052411 edges, 186517 markings/sec, 30 secs
lola: 8004215 markings, 9190159 edges, 192218 markings/sec, 35 secs
lola: 8906443 markings, 10247129 edges, 180446 markings/sec, 40 secs
lola: 9808396 markings, 11301462 edges, 180391 markings/sec, 45 secs
lola: 10693668 markings, 12370635 edges, 177054 markings/sec, 50 secs
lola: 11605590 markings, 13522116 edges, 182384 markings/sec, 55 secs
lola: 12500389 markings, 14708114 edges, 178960 markings/sec, 60 secs
lola: 13415543 markings, 15819571 edges, 183031 markings/sec, 65 secs
lola: 14327475 markings, 16901260 edges, 182386 markings/sec, 70 secs
lola: 15198034 markings, 17982915 edges, 174112 markings/sec, 75 secs
lola: 16080523 markings, 19084021 edges, 176498 markings/sec, 80 secs
lola: 16982875 markings, 20186540 edges, 180470 markings/sec, 85 secs
lola: 17901655 markings, 21323040 edges, 183756 markings/sec, 90 secs
lola: 18826182 markings, 22436614 edges, 184905 markings/sec, 95 secs
lola: 19723629 markings, 23524512 edges, 179489 markings/sec, 100 secs
lola: 20591474 markings, 24567679 edges, 173569 markings/sec, 105 secs
lola: 21497363 markings, 25626135 edges, 181178 markings/sec, 110 secs
lola: 22399767 markings, 26691150 edges, 180481 markings/sec, 115 secs
lola: 23295550 markings, 27731986 edges, 179157 markings/sec, 120 secs
lola: 24193449 markings, 28765374 edges, 179580 markings/sec, 125 secs
lola: 25109969 markings, 29814687 edges, 183304 markings/sec, 130 secs
lola: 26008376 markings, 30855168 edges, 179681 markings/sec, 135 secs
lola: 26913024 markings, 31931703 edges, 180930 markings/sec, 140 secs
lola: 27866049 markings, 33138425 edges, 190605 markings/sec, 145 secs
lola: 28741856 markings, 34271556 edges, 175161 markings/sec, 150 secs
lola: 29615796 markings, 35363681 edges, 174788 markings/sec, 155 secs
lola: 30458286 markings, 36465339 edges, 168498 markings/sec, 160 secs
lola: 31319391 markings, 37551986 edges, 172221 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p158) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)) U G (G ((1 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p158) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)) U G (G ((1 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)))))
lola: processed formula: A ((((1 <= p158) U (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)) U G (G ((1 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)))))
lola: processed formula length: 129
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 161 markings, 161 edges
lola: subprocess 9 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))
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 708 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 10 will run for 561 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((p53 <= p55))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p53 <= p55)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 673 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p105)))
lola: processed formula: A (F ((2 <= p105)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 327 markings, 327 edges
lola: ========================================
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p44 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p44 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: processed formula: A (X ((p44 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 1122 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p55) U F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p55) U F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))))
lola: processed formula: A (((2 <= p55) U F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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 14 will run for 1683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((2 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)))))
lola: processed formula: A (X (F (G ((2 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 513124 markings, 3113401 edges, 102625 markings/sec, 0 secs
lola: 959374 markings, 5979231 edges, 89250 markings/sec, 5 secs
lola: 1342745 markings, 8635513 edges, 76674 markings/sec, 10 secs
lola: 1764027 markings, 11416605 edges, 84256 markings/sec, 15 secs
lola: 2138729 markings, 14116316 edges, 74940 markings/sec, 20 secs
lola: 2589396 markings, 17142766 edges, 90133 markings/sec, 25 secs
lola: 2979755 markings, 19981573 edges, 78072 markings/sec, 30 secs
lola: 3399528 markings, 22778443 edges, 83955 markings/sec, 35 secs
lola: 3753110 markings, 25336576 edges, 70716 markings/sec, 40 secs
lola: 4119416 markings, 27981976 edges, 73261 markings/sec, 45 secs
lola: 4519271 markings, 30803296 edges, 79971 markings/sec, 50 secs
lola: 4878883 markings, 33398912 edges, 71922 markings/sec, 55 secs
lola: 5229866 markings, 36040268 edges, 70197 markings/sec, 60 secs
lola: 5578793 markings, 38690227 edges, 69785 markings/sec, 65 secs
lola: 5913761 markings, 41300879 edges, 66994 markings/sec, 70 secs
lola: 6267210 markings, 43969283 edges, 70690 markings/sec, 75 secs
lola: 6611660 markings, 46681453 edges, 68890 markings/sec, 80 secs
lola: 6964983 markings, 49524586 edges, 70665 markings/sec, 85 secs
lola: 7292811 markings, 52274803 edges, 65566 markings/sec, 90 secs
lola: 7631774 markings, 55139288 edges, 67793 markings/sec, 95 secs
lola: 8095128 markings, 58037290 edges, 92671 markings/sec, 100 secs
lola: 8526985 markings, 60804690 edges, 86371 markings/sec, 105 secs
lola: 8917428 markings, 63513900 edges, 78089 markings/sec, 110 secs
lola: 9346328 markings, 66344863 edges, 85780 markings/sec, 115 secs
lola: 9709955 markings, 68979610 edges, 72725 markings/sec, 120 secs
lola: 10134599 markings, 71807908 edges, 84929 markings/sec, 125 secs
lola: 10544359 markings, 74785300 edges, 81952 markings/sec, 130 secs
lola: 10995678 markings, 77806485 edges, 90264 markings/sec, 135 secs
lola: 11387632 markings, 80656330 edges, 78391 markings/sec, 140 secs
lola: 11762244 markings, 83400245 edges, 74922 markings/sec, 145 secs
lola: 12147868 markings, 86089270 edges, 77125 markings/sec, 150 secs
lola: 12514569 markings, 88751292 edges, 73340 markings/sec, 155 secs
lola: 12865318 markings, 91405134 edges, 70150 markings/sec, 160 secs
lola: 13216881 markings, 94075732 edges, 70313 markings/sec, 165 secs
lola: 13539956 markings, 96632644 edges, 64615 markings/sec, 170 secs
lola: 13893756 markings, 99319882 edges, 70760 markings/sec, 175 secs
lola: 14205486 markings, 102050346 edges, 62346 markings/sec, 180 secs
lola: 14496623 markings, 104526826 edges, 58227 markings/sec, 185 secs
lola: 14780844 markings, 107054274 edges, 56844 markings/sec, 190 secs
lola: 15084323 markings, 109624935 edges, 60696 markings/sec, 195 secs
lola: 15365392 markings, 112208171 edges, 56214 markings/sec, 200 secs
lola: 15638082 markings, 114676792 edges, 54538 markings/sec, 205 secs
lola: 15942500 markings, 117297332 edges, 60884 markings/sec, 210 secs
lola: 16241042 markings, 119974945 edges, 59708 markings/sec, 215 secs
lola: 16525842 markings, 122656306 edges, 56960 markings/sec, 220 secs
lola: 16842645 markings, 125380371 edges, 63361 markings/sec, 225 secs
lola: 17133052 markings, 127988851 edges, 58081 markings/sec, 230 secs
lola: 17421381 markings, 130633777 edges, 57666 markings/sec, 235 secs
lola: 17701304 markings, 133306249 edges, 55985 markings/sec, 240 secs
lola: 17992615 markings, 135954090 edges, 58262 markings/sec, 245 secs
lola: 18240776 markings, 138355931 edges, 49632 markings/sec, 250 secs
lola: 18495104 markings, 140818384 edges, 50866 markings/sec, 255 secs
lola: 18751108 markings, 143340615 edges, 51201 markings/sec, 260 secs
lola: 19018386 markings, 145960991 edges, 53456 markings/sec, 265 secs
lola: 19263164 markings, 148471933 edges, 48956 markings/sec, 270 secs
lola: 19544159 markings, 151217166 edges, 56199 markings/sec, 275 secs
lola: 19820028 markings, 154005857 edges, 55174 markings/sec, 280 secs
lola: 20079784 markings, 156721937 edges, 51951 markings/sec, 285 secs
lola: 20327994 markings, 159326919 edges, 49642 markings/sec, 290 secs
lola: 20568478 markings, 161939521 edges, 48097 markings/sec, 295 secs
lola: 20816772 markings, 164750809 edges, 49659 markings/sec, 300 secs
lola: 21122517 markings, 167978590 edges, 61149 markings/sec, 305 secs
lola: 21530511 markings, 171057092 edges, 81599 markings/sec, 310 secs
lola: 21874126 markings, 174064557 edges, 68723 markings/sec, 315 secs
lola: 22176149 markings, 177051311 edges, 60405 markings/sec, 320 secs
lola: 22430119 markings, 179868313 edges, 50794 markings/sec, 325 secs
lola: 22813925 markings, 182601062 edges, 76761 markings/sec, 330 secs
lola: 23215824 markings, 185210078 edges, 80380 markings/sec, 335 secs
lola: 23586647 markings, 187646037 edges, 74165 markings/sec, 340 secs
lola: 23949076 markings, 190094535 edges, 72486 markings/sec, 345 secs
lola: 24320819 markings, 192634430 edges, 74349 markings/sec, 350 secs
lola: 24655548 markings, 195064509 edges, 66946 markings/sec, 355 secs
lola: 25047729 markings, 197660950 edges, 78436 markings/sec, 360 secs
lola: 25398753 markings, 200180981 edges, 70205 markings/sec, 365 secs
lola: 25795300 markings, 202871972 edges, 79309 markings/sec, 370 secs
lola: 26168099 markings, 205523095 edges, 74560 markings/sec, 375 secs
lola: 26524906 markings, 208080069 edges, 71361 markings/sec, 380 secs
lola: 26852749 markings, 210546466 edges, 65569 markings/sec, 385 secs
lola: 27150491 markings, 213085952 edges, 59548 markings/sec, 390 secs
lola: 27447643 markings, 215613387 edges, 59430 markings/sec, 395 secs
lola: 27739939 markings, 218204354 edges, 58459 markings/sec, 400 secs
lola: 28043060 markings, 220845512 edges, 60624 markings/sec, 405 secs
lola: 28308852 markings, 223270548 edges, 53158 markings/sec, 410 secs
lola: 28585708 markings, 225728688 edges, 55371 markings/sec, 415 secs
lola: 28859828 markings, 228175407 edges, 54824 markings/sec, 420 secs
lola: 29141218 markings, 230716076 edges, 56278 markings/sec, 425 secs
lola: 29420508 markings, 233257434 edges, 55858 markings/sec, 430 secs
lola: 29688686 markings, 235760034 edges, 53636 markings/sec, 435 secs
lola: 29952035 markings, 238236640 edges, 52670 markings/sec, 440 secs
lola: 30250954 markings, 240925826 edges, 59784 markings/sec, 445 secs
lola: 30527980 markings, 243558426 edges, 55405 markings/sec, 450 secs
lola: 30809632 markings, 246332466 edges, 56330 markings/sec, 455 secs
lola: 31085589 markings, 248976012 edges, 55191 markings/sec, 460 secs
lola: 31345026 markings, 251508287 edges, 51887 markings/sec, 465 secs
lola: 31599800 markings, 254090505 edges, 50955 markings/sec, 470 secs
lola: 31936656 markings, 256614033 edges, 67371 markings/sec, 475 secs
lola: 32279684 markings, 259338607 edges, 68606 markings/sec, 480 secs
lola: 32611655 markings, 262144840 edges, 66394 markings/sec, 485 secs
lola: 32889287 markings, 264891389 edges, 55526 markings/sec, 490 secs
lola: 33156942 markings, 267621028 edges, 53531 markings/sec, 495 secs
lola: 33414439 markings, 270323815 edges, 51499 markings/sec, 500 secs
lola: 33664378 markings, 273056012 edges, 49988 markings/sec, 505 secs
lola: 33900720 markings, 275908895 edges, 47268 markings/sec, 510 secs
lola: 34347992 markings, 278696742 edges, 89454 markings/sec, 515 secs
lola: 34741458 markings, 281316611 edges, 78693 markings/sec, 520 secs
lola: 35111826 markings, 283766365 edges, 74074 markings/sec, 525 secs
lola: 35481853 markings, 286198192 edges, 74005 markings/sec, 530 secs
lola: 35852906 markings, 288785242 edges, 74211 markings/sec, 535 secs
lola: 36237137 markings, 291426909 edges, 76846 markings/sec, 540 secs
lola: 36602397 markings, 294014241 edges, 73052 markings/sec, 545 secs
lola: 36946139 markings, 296509046 edges, 68748 markings/sec, 550 secs
lola: 37328317 markings, 299030685 edges, 76436 markings/sec, 555 secs
lola: 37679366 markings, 301575070 edges, 70210 markings/sec, 560 secs
lola: 38053568 markings, 304282348 edges, 74840 markings/sec, 565 secs
lola: 38401248 markings, 306963103 edges, 69536 markings/sec, 570 secs
lola: 38723251 markings, 309738594 edges, 64401 markings/sec, 575 secs
lola: 39028601 markings, 312418441 edges, 61070 markings/sec, 580 secs
lola: 39338119 markings, 315089865 edges, 61904 markings/sec, 585 secs
lola: 39637471 markings, 317777161 edges, 59870 markings/sec, 590 secs
lola: 39930160 markings, 320391122 edges, 58538 markings/sec, 595 secs
lola: 40209737 markings, 322960652 edges, 55915 markings/sec, 600 secs
lola: 40481616 markings, 325441211 edges, 54376 markings/sec, 605 secs
lola: 40761253 markings, 327898498 edges, 55927 markings/sec, 610 secs
lola: 41016479 markings, 330295485 edges, 51045 markings/sec, 615 secs
lola: 41288212 markings, 332793571 edges, 54347 markings/sec, 620 secs
lola: 41577007 markings, 335383589 edges, 57759 markings/sec, 625 secs
lola: 41854614 markings, 338046580 edges, 55521 markings/sec, 630 secs
lola: 42122125 markings, 340617461 edges, 53502 markings/sec, 635 secs
lola: 42387161 markings, 343196780 edges, 53007 markings/sec, 640 secs
lola: 42637707 markings, 345614759 edges, 50109 markings/sec, 645 secs
lola: 42885925 markings, 348115153 edges, 49644 markings/sec, 650 secs
lola: 43178114 markings, 350639351 edges, 58438 markings/sec, 655 secs
lola: 43486641 markings, 353162490 edges, 61705 markings/sec, 660 secs
lola: 43776511 markings, 355695462 edges, 57974 markings/sec, 665 secs
lola: 44046028 markings, 357983106 edges, 53903 markings/sec, 670 secs
lola: 44095238 markings, 358419120 edges, 9842 markings/sec, 675 secs
lola: 44096125 markings, 358428532 edges, 177 markings/sec, 680 secs
lola: 44097121 markings, 358436633 edges, 199 markings/sec, 685 secslola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))
lola: processed formula: A (X (G (G ((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 161 markings, 161 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes unknown no no yes no yes yes unknown no
FORMULA PermAdmissibility-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-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 stderr -----
----- Finished stdout -----

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="PermAdmissibility-COL-10"
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/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 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 PermAdmissibility-COL-10, 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 r259-csrt-152732584700129"
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 ;