fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r258-csrt-152732584000133
Last Updated
June 26, 2018

About the Execution of Irma.full for PermAdmissibility-COL-50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15901.090 1048943.00 1033770.00 530.30 FFFT?FFFTFTT?FFF normal

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 216K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 2.7K 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.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 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PermAdmissibility-COL-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-csrt-152732584000133
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527457103801


BK_STOP 1527458152744

--------------------
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 PermAdmissibility-COL-50 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': 1598647, 'Memory': 15941.8, 'Tool': 'lola'}, {'Time': 1698764, 'Memory': 15936.43, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
LTLCardinality lola PermAdmissibility-COL-50...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-50: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-COL-50 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-50-LTLCardinality.task
lola: A (((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) U G ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))) : A ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p207)) : A (F (F (F ((2 <= p137))))) : A ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)) : A ((X ((p164 <= p127)) U X (F ((1 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))) : A (F ((X ((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)) U G ((3 <= p93))))) : A ((1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)) : A (X ((3 <= p190))) : A (((3 <= p93) U X (F ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))) : A (X ((F ((3 <= p8)) U X ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))) : A ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)) : A ((p8 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)) : A (G (F (((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) U (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p27))))) : A (G (((2 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) U X ((2 <= p93))))) : A ((G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U G ((p162 <= p93)))) : A ((X (G ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p137))) U G ((2 <= p164))))
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 (((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) U G ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= 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 (((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) U G ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))))
lola: processed formula: A (((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) U G ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))))
lola: processed formula length: 221
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p207))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p207)
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F ((2 <= p137)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p137)))
lola: processed formula: A (F ((2 <= p137)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 1378 markings, 1378 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p164 <= p127)) U X (F ((1 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p164 <= p127) U F ((1 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)))))
lola: processed formula: A (X (((p164 <= p127) U F ((1 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)))))
lola: processed formula length: 83
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 1115341 markings, 1203836 edges, 223068 markings/sec, 0 secs
lola: 2227229 markings, 2421447 edges, 222378 markings/sec, 5 secs
lola: 3296742 markings, 3574121 edges, 213903 markings/sec, 10 secs
lola: 4365485 markings, 4755600 edges, 213749 markings/sec, 15 secs
lola: 5448664 markings, 5948154 edges, 216636 markings/sec, 20 secs
lola: 6471068 markings, 7105929 edges, 204481 markings/sec, 25 secs
lola: 7509944 markings, 8266469 edges, 207775 markings/sec, 30 secs
lola: 8599062 markings, 9473421 edges, 217824 markings/sec, 35 secs
lola: 9712501 markings, 10700129 edges, 222688 markings/sec, 40 secs
lola: 10777876 markings, 11900205 edges, 213075 markings/sec, 45 secs
lola: 11811763 markings, 13086177 edges, 206777 markings/sec, 50 secs
lola: 12768959 markings, 14182895 edges, 191439 markings/sec, 55 secs
lola: 13773593 markings, 15319795 edges, 200927 markings/sec, 60 secs
lola: 14729377 markings, 16420369 edges, 191157 markings/sec, 65 secs
lola: 15678865 markings, 17540362 edges, 189898 markings/sec, 70 secs
lola: 16608413 markings, 18652447 edges, 185910 markings/sec, 75 secs
lola: 17521067 markings, 19757654 edges, 182531 markings/sec, 80 secs
lola: 18353578 markings, 20805176 edges, 166502 markings/sec, 85 secs
lola: 19165764 markings, 22026417 edges, 162437 markings/sec, 90 secs
lola: 19977123 markings, 23214473 edges, 162272 markings/sec, 95 secs
lola: 20857701 markings, 24379646 edges, 176116 markings/sec, 100 secs
lola: 21795647 markings, 25445540 edges, 187589 markings/sec, 105 secs
lola: 22700088 markings, 26586077 edges, 180888 markings/sec, 110 secs
lola: 23681881 markings, 27757079 edges, 196359 markings/sec, 115 secs
lola: 24556548 markings, 28786131 edges, 174933 markings/sec, 120 secs
lola: 25521184 markings, 29860908 edges, 192927 markings/sec, 125 secs
lola: 26428668 markings, 30905704 edges, 181497 markings/sec, 130 secs
lola: 27374854 markings, 32094114 edges, 189237 markings/sec, 135 secs
lola: 28355226 markings, 33245816 edges, 196074 markings/sec, 140 secs
lola: 29306413 markings, 34359514 edges, 190237 markings/sec, 145 secs
lola: 30333766 markings, 35530711 edges, 205471 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)) U G ((3 <= p93)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)) U G ((3 <= p93)))))
lola: processed formula: A (F ((X ((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)) U G ((3 <= p93)))))
lola: processed formula length: 143
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 802 markings, 803 edges
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 7 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p190)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p190)))
lola: processed formula: A (X ((3 <= p190)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 801 markings, 801 edges
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p93) U X (F ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p93) U X (F ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: processed formula: A (((3 <= p93) U X (F ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= p8)) U X ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((3 <= p8)) U X ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))
lola: processed formula: A (X ((F ((3 <= p8)) U X ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 10 will run for 563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)
lola: processed formula length: 104
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 676 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p8 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p8 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 12 will run for 845 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) U (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) U (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p27)))))
lola: processed formula: A (G (F (((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) U (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p27)))))
lola: processed formula length: 183
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 37099 markings, 110881 edges, 7420 markings/sec, 0 secs
lola: 71966 markings, 228111 edges, 6973 markings/sec, 5 secs
lola: 106742 markings, 345281 edges, 6955 markings/sec, 10 secs
lola: 140622 markings, 464773 edges, 6776 markings/sec, 15 secs
lola: 175803 markings, 585951 edges, 7036 markings/sec, 20 secs
lola: 209787 markings, 708284 edges, 6797 markings/sec, 25 secs
lola: 244314 markings, 829376 edges, 6905 markings/sec, 30 secs
lola: 278766 markings, 948260 edges, 6890 markings/sec, 35 secs
lola: 310555 markings, 1066431 edges, 6358 markings/sec, 40 secs
lola: 340122 markings, 1179333 edges, 5913 markings/sec, 45 secs
lola: 369221 markings, 1293007 edges, 5820 markings/sec, 50 secs
lola: 397413 markings, 1402240 edges, 5638 markings/sec, 55 secs
lola: 425374 markings, 1514840 edges, 5592 markings/sec, 60 secs
lola: 453347 markings, 1628276 edges, 5595 markings/sec, 65 secs
lola: 483863 markings, 1742006 edges, 6103 markings/sec, 70 secs
lola: 521260 markings, 1859347 edges, 7479 markings/sec, 75 secs
lola: 556622 markings, 1977852 edges, 7072 markings/sec, 80 secs
lola: 591082 markings, 2095630 edges, 6892 markings/sec, 85 secs
lola: 625160 markings, 2214489 edges, 6816 markings/sec, 90 secs
lola: 658588 markings, 2332739 edges, 6686 markings/sec, 95 secs
lola: 692634 markings, 2454125 edges, 6809 markings/sec, 100 secs
lola: 727315 markings, 2575511 edges, 6936 markings/sec, 105 secs
lola: 759991 markings, 2688120 edges, 6535 markings/sec, 110 secs
lola: 789891 markings, 2799867 edges, 5980 markings/sec, 115 secs
lola: 819651 markings, 2914195 edges, 5952 markings/sec, 120 secs
lola: 848850 markings, 3028153 edges, 5840 markings/sec, 125 secs
lola: 879167 markings, 3145961 edges, 6063 markings/sec, 130 secs
lola: 907905 markings, 3261566 edges, 5748 markings/sec, 135 secs
lola: 935780 markings, 3374710 edges, 5575 markings/sec, 140 secs
lola: 965395 markings, 3489227 edges, 5923 markings/sec, 145 secs
lola: 992115 markings, 3598636 edges, 5344 markings/sec, 150 secs
lola: 1017740 markings, 3707901 edges, 5125 markings/sec, 155 secs
lola: 1043092 markings, 3817879 edges, 5070 markings/sec, 160 secs
lola: 1068190 markings, 3929049 edges, 5020 markings/sec, 165 secs
lola: 1093525 markings, 4039533 edges, 5067 markings/sec, 170 secs
lola: 1117898 markings, 4149591 edges, 4875 markings/sec, 175 secs
lola: 1141866 markings, 4260985 edges, 4794 markings/sec, 180 secs
lola: 1167246 markings, 4372253 edges, 5076 markings/sec, 185 secs
lola: 1197159 markings, 4485118 edges, 5983 markings/sec, 190 secs
lola: 1227338 markings, 4597623 edges, 6036 markings/sec, 195 secs
lola: 1257620 markings, 4714444 edges, 6056 markings/sec, 200 secs
lola: 1287337 markings, 4830558 edges, 5943 markings/sec, 205 secs
lola: 1316069 markings, 4943405 edges, 5746 markings/sec, 210 secs
lola: 1344022 markings, 5056843 edges, 5591 markings/sec, 215 secs
lola: 1375568 markings, 5173755 edges, 6309 markings/sec, 220 secs
lola: 1409571 markings, 5298944 edges, 6801 markings/sec, 225 secs
lola: 1442490 markings, 5424383 edges, 6584 markings/sec, 230 secs
lola: 1474957 markings, 5552001 edges, 6493 markings/sec, 235 secs
lola: 1508844 markings, 5685756 edges, 6777 markings/sec, 240 secs
lola: 1541499 markings, 5816823 edges, 6531 markings/sec, 245 secs
lola: 1578802 markings, 5943488 edges, 7461 markings/sec, 250 secs
lola: 1613159 markings, 6065534 edges, 6871 markings/sec, 255 secs
lola: 1646562 markings, 6189307 edges, 6681 markings/sec, 260 secs
lola: 1680468 markings, 6314064 edges, 6781 markings/sec, 265 secs
lola: 1709954 markings, 6431943 edges, 5897 markings/sec, 270 secs
lola: 1740132 markings, 6549127 edges, 6036 markings/sec, 275 secs
lola: 1771046 markings, 6667219 edges, 6183 markings/sec, 280 secs
lola: 1801064 markings, 6791982 edges, 6004 markings/sec, 285 secs
lola: 1835583 markings, 6916224 edges, 6904 markings/sec, 290 secs
lola: 1864021 markings, 7040230 edges, 5688 markings/sec, 295 secs
lola: 1897380 markings, 7170162 edges, 6672 markings/sec, 300 secs
lola: 1927687 markings, 7295003 edges, 6061 markings/sec, 305 secs
lola: 1957137 markings, 7413567 edges, 5890 markings/sec, 310 secs
lola: 1987472 markings, 7531564 edges, 6067 markings/sec, 315 secs
lola: 2015142 markings, 7649635 edges, 5534 markings/sec, 320 secs
lola: 2045932 markings, 7768246 edges, 6158 markings/sec, 325 secs
lola: 2077241 markings, 7886552 edges, 6262 markings/sec, 330 secs
lola: 2104097 markings, 8005294 edges, 5371 markings/sec, 335 secs
lola: 2132006 markings, 8133899 edges, 5582 markings/sec, 340 secs
lola: 2164243 markings, 8254963 edges, 6447 markings/sec, 345 secs
lola: 2191755 markings, 8373881 edges, 5502 markings/sec, 350 secs
lola: 2221799 markings, 8492095 edges, 6009 markings/sec, 355 secs
lola: 2252921 markings, 8612789 edges, 6224 markings/sec, 360 secs
lola: 2282897 markings, 8730002 edges, 5995 markings/sec, 365 secs
lola: 2312005 markings, 8847155 edges, 5822 markings/sec, 370 secs
lola: 2340184 markings, 8962164 edges, 5636 markings/sec, 375 secs
lola: 2366545 markings, 9078795 edges, 5272 markings/sec, 380 secs
lola: 2395218 markings, 9199590 edges, 5735 markings/sec, 385 secs
lola: 2422549 markings, 9315768 edges, 5466 markings/sec, 390 secs
lola: 2449040 markings, 9436751 edges, 5298 markings/sec, 395 secs
lola: 2478545 markings, 9555966 edges, 5901 markings/sec, 400 secs
lola: 2502716 markings, 9671216 edges, 4834 markings/sec, 405 secs
lola: 2529249 markings, 9784832 edges, 5307 markings/sec, 410 secs
lola: 2553446 markings, 9895560 edges, 4839 markings/sec, 415 secs
lola: 2579457 markings, 10010175 edges, 5202 markings/sec, 420 secs
lola: 2605698 markings, 10124593 edges, 5248 markings/sec, 425 secs
lola: 2630257 markings, 10238127 edges, 4912 markings/sec, 430 secs
lola: 2656040 markings, 10352303 edges, 5157 markings/sec, 435 secs
lola: 2683470 markings, 10466912 edges, 5486 markings/sec, 440 secs
lola: 2708101 markings, 10585570 edges, 4926 markings/sec, 445 secs
lola: 2731340 markings, 10703363 edges, 4648 markings/sec, 450 secs
lola: 2759389 markings, 10820418 edges, 5610 markings/sec, 455 secs
lola: 2784094 markings, 10938557 edges, 4941 markings/sec, 460 secs
lola: 2811147 markings, 11057070 edges, 5411 markings/sec, 465 secs
lola: 2838467 markings, 11174241 edges, 5464 markings/sec, 470 secs
lola: 2874225 markings, 11292431 edges, 7152 markings/sec, 475 secs
lola: 2906275 markings, 11411098 edges, 6410 markings/sec, 480 secs
lola: 2937141 markings, 11527866 edges, 6173 markings/sec, 485 secs
lola: 2968552 markings, 11643929 edges, 6282 markings/sec, 490 secs
lola: 2998842 markings, 11761553 edges, 6058 markings/sec, 495 secs
lola: 3028607 markings, 11878553 edges, 5953 markings/sec, 500 secs
lola: 3059763 markings, 11999626 edges, 6231 markings/sec, 505 secs
lola: 3091044 markings, 12123438 edges, 6256 markings/sec, 510 secs
lola: 3124183 markings, 12249107 edges, 6628 markings/sec, 515 secs
lola: 3152024 markings, 12372781 edges, 5568 markings/sec, 520 secs
lola: 3184610 markings, 12497067 edges, 6517 markings/sec, 525 secs
lola: 3215776 markings, 12622137 edges, 6233 markings/sec, 530 secs
lola: 3246872 markings, 12745923 edges, 6219 markings/sec, 535 secs
lola: 3277063 markings, 12868834 edges, 6038 markings/sec, 540 secs
lola: 3306655 markings, 12995757 edges, 5918 markings/sec, 545 secs
lola: 3341905 markings, 13123354 edges, 7050 markings/sec, 550 secs
lola: 3372551 markings, 13250255 edges, 6129 markings/sec, 555 secs
lola: 3400109 markings, 13375341 edges, 5512 markings/sec, 560 secs
lola: 3431442 markings, 13502954 edges, 6267 markings/sec, 565 secs
lola: 3462283 markings, 13629712 edges, 6168 markings/sec, 570 secs
lola: 3493557 markings, 13754763 edges, 6255 markings/sec, 575 secs
lola: 3522518 markings, 13873010 edges, 5792 markings/sec, 580 secs
lola: 3553059 markings, 13984590 edges, 6108 markings/sec, 585 secs
lola: 3579924 markings, 14094349 edges, 5373 markings/sec, 590 secs
lola: 3606731 markings, 14206732 edges, 5361 markings/sec, 595 secs
lola: 3634206 markings, 14320287 edges, 5495 markings/sec, 600 secs
lola: 3660556 markings, 14432963 edges, 5270 markings/sec, 605 secs
lola: 3686817 markings, 14546373 edges, 5252 markings/sec, 610 secs
lola: 3713664 markings, 14661521 edges, 5369 markings/sec, 615 secs
lola: 3739942 markings, 14775576 edges, 5256 markings/sec, 620 secs
lola: 3766591 markings, 14889411 edges, 5330 markings/sec, 625 secs
lola: 3790260 markings, 15005581 edges, 4734 markings/sec, 630 secs
lola: 3817309 markings, 15118088 edges, 5410 markings/sec, 635 secs
lola: 3842834 markings, 15232162 edges, 5105 markings/sec, 640 secs
lola: 3868424 markings, 15346060 edges, 5118 markings/sec, 645 secs
lola: 3893847 markings, 15459523 edges, 5085 markings/sec, 650 secs
lola: 3918242 markings, 15572637 edges, 4879 markings/sec, 655 secs
lola: 3945269 markings, 15686429 edges, 5405 markings/sec, 660 secs
lola: 3971407 markings, 15800201 edges, 5228 markings/sec, 665 secs
lola: 3994448 markings, 15914283 edges, 4608 markings/sec, 670 secs
lola: 4017742 markings, 16029206 edges, 4659 markings/sec, 675 secs
lola: 4045104 markings, 16142980 edges, 5472 markings/sec, 680 secs
lola: 4069337 markings, 16257417 edges, 4847 markings/sec, 685 secs
lola: 4095511 markings, 16372723 edges, 5235 markings/sec, 690 secs
lola: 4122332 markings, 16491041 edges, 5364 markings/sec, 695 secs
lola: 4150618 markings, 16612114 edges, 5657 markings/sec, 700 secs
lola: 4175742 markings, 16726764 edges, 5025 markings/sec, 705 secs
lola: 4199266 markings, 16837049 edges, 4705 markings/sec, 710 secs
lola: 4223602 markings, 16948396 edges, 4867 markings/sec, 715 secs
lola: 4248137 markings, 17065822 edges, 4907 markings/sec, 720 secs
lola: 4271802 markings, 17180465 edges, 4733 markings/sec, 725 secs
lola: 4295395 markings, 17292484 edges, 4719 markings/sec, 730 secs
lola: 4319310 markings, 17411918 edges, 4783 markings/sec, 735 secs
lola: 4344902 markings, 17529683 edges, 5118 markings/sec, 740 secs
lola: 4367454 markings, 17644295 edges, 4510 markings/sec, 745 secs
lola: 4389567 markings, 17758126 edges, 4423 markings/sec, 750 secs
lola: 4415064 markings, 17881079 edges, 5099 markings/sec, 755 secs
lola: 4438289 markings, 17994136 edges, 4645 markings/sec, 760 secs
lola: 4461883 markings, 18112109 edges, 4719 markings/sec, 765 secs
lola: 4485837 markings, 18230005 edges, 4791 markings/sec, 770 secs
lola: 4507613 markings, 18343149 edges, 4355 markings/sec, 775 secs
lola: 4533275 markings, 18465711 edges, 5132 markings/sec, 780 secs
lola: 4559316 markings, 18588428 edges, 5208 markings/sec, 785 secs
lola: 4581497 markings, 18706933 edges, 4436 markings/sec, 790 secs
lola: 4602102 markings, 18821020 edges, 4121 markings/sec, 795 secs
lola: 4625354 markings, 18932814 edges, 4650 markings/sec, 800 secs
lola: 4648903 markings, 19052391 edges, 4710 markings/sec, 805 secs
lola: 4672580 markings, 19170089 edges, 4735 markings/sec, 810 secs
lola: 4697381 markings, 19294505 edges, 4960 markings/sec, 815 secs
lola: 4728724 markings, 19423705 edges, 6269 markings/sec, 820 secs
lola: 4760745 markings, 19552279 edges, 6404 markings/sec, 825 secs
lola: 4792853 markings, 19683281 edges, 6422 markings/sec, 830 secs
lola: 4822965 markings, 19814598 edges, 6022 markings/sec, 835 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 845 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) U X ((2 <= p93)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((2 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) U X ((2 <= p93)))))
lola: processed formula: A (G (((2 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) U X ((2 <= p93)))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 14 will run for 1267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U G ((p162 <= p93))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U G ((p162 <= p93))))
lola: processed formula: A ((G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) U G ((p162 <= p93))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 15 will run for 2535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p137))) U G ((2 <= p164))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p137))) U G ((2 <= p164))))
lola: processed formula: A ((X (G ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p137))) U G ((2 <= p164))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 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: 801 markings, 801 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes unknown no no no yes no yes yes unknown no no no
FORMULA PermAdmissibility-COL-50-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-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="PermAdmissibility-COL-50"
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/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-50 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 PermAdmissibility-COL-50, 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 r258-csrt-152732584000133"
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 ;