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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.390 1016665.00 997983.00 938.80 TFTFF?FFT?FFTT?T 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 224K
-rw-r--r-- 1 mcc users 3.8K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 12K 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.9K 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 18K 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 14K 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-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-csrt-152732584000127
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527457032865


BK_STOP 1527458049530

--------------------
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-05 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': 728317, 'Memory': 15952.8, 'Tool': 'lola'}, {'Time': 809424, 'Memory': 15936.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
LTLCardinality lola PermAdmissibility-COL-05...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-05: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-COL-05 @ 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-05-LTLCardinality.task
lola: A (F (F (X (F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))) : A ((G (F ((3 <= p52))) U G (F ((2 <= p63))))) : A ((p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)) : A ((X (X ((p80 <= p54))) U (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p106))) : A (X ((1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) : A ((G (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p80))) U X (F ((2 <= p80))))) : A (G (G (G (G ((2 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))))) : A (G (F (G (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p53)))))) : A ((p52 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)) : A (F (X (F (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p199)))))) : A (X ((3 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))) : A (G (F (((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p53))))) : A ((p199 <= p150)) : A ((F (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))) U ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p123) U (1 <= p18)))) : A (G (G (X (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))) : A ((((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p9)) U F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
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 (F (X (F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= 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 (F (X (F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))
lola: processed formula: A (F (X (F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))
lola: processed formula length: 120
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((3 <= p52))) U G (F ((2 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((3 <= p52))) U G (F ((2 <= p63)))))
lola: processed formula: A ((G (F ((3 <= p52))) U G (F ((2 <= p63)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 91 markings, 91 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)
lola: processed formula length: 104
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p80 <= p54))) U (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p106)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((p80 <= p54))) U (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p106)))
lola: processed formula: A ((X (X ((p80 <= p54))) U (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p106)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 108 markings, 108 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))
lola: processed formula: A (X ((1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p80))) U X (F ((2 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p80))) U X (F ((2 <= p80)))))
lola: processed formula: A ((G (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p80))) U X (F ((2 <= p80)))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 904450 markings, 2163139 edges, 180890 markings/sec, 0 secs
lola: 1745920 markings, 4347261 edges, 168294 markings/sec, 5 secs
lola: 2531848 markings, 6497420 edges, 157186 markings/sec, 10 secs
lola: 3342646 markings, 8673376 edges, 162160 markings/sec, 15 secs
lola: 4194772 markings, 10874867 edges, 170425 markings/sec, 20 secs
lola: 5108284 markings, 13094087 edges, 182702 markings/sec, 25 secs
lola: 5885772 markings, 15146365 edges, 155498 markings/sec, 30 secs
lola: 6574181 markings, 17156563 edges, 137682 markings/sec, 35 secs
lola: 7272840 markings, 19007603 edges, 139732 markings/sec, 40 secs
lola: 8106252 markings, 21011077 edges, 166682 markings/sec, 45 secs
lola: 8916527 markings, 23116495 edges, 162055 markings/sec, 50 secs
lola: 9578335 markings, 25058085 edges, 132362 markings/sec, 55 secs
lola: 10281974 markings, 26983432 edges, 140728 markings/sec, 60 secs
lola: 11063649 markings, 28876590 edges, 156335 markings/sec, 65 secs
lola: 11718362 markings, 30734587 edges, 130943 markings/sec, 70 secs
lola: 12391804 markings, 32715210 edges, 134688 markings/sec, 75 secs
lola: 13222751 markings, 34800663 edges, 166189 markings/sec, 80 secs
lola: 13984954 markings, 36873368 edges, 152441 markings/sec, 85 secs
lola: 14689690 markings, 39039114 edges, 140947 markings/sec, 90 secs
lola: 15405358 markings, 41139381 edges, 143134 markings/sec, 95 secs
lola: 16181833 markings, 43202349 edges, 155295 markings/sec, 100 secs
lola: 16935969 markings, 45227757 edges, 150827 markings/sec, 105 secs
lola: 17570856 markings, 47257632 edges, 126977 markings/sec, 110 secs
lola: 18238059 markings, 49246558 edges, 133441 markings/sec, 115 secs
lola: 18994857 markings, 51303507 edges, 151360 markings/sec, 120 secs
lola: 19655424 markings, 53362937 edges, 132113 markings/sec, 125 secs
lola: 20379374 markings, 55373480 edges, 144790 markings/sec, 130 secs
lola: 20999342 markings, 57344833 edges, 123994 markings/sec, 135 secs
lola: 21702745 markings, 59338453 edges, 140681 markings/sec, 140 secs
lola: 22341372 markings, 61313661 edges, 127725 markings/sec, 145 secs
lola: 22871260 markings, 63307568 edges, 105978 markings/sec, 150 secs
lola: 23446813 markings, 65296000 edges, 115111 markings/sec, 155 secs
lola: 24045093 markings, 67211883 edges, 119656 markings/sec, 160 secs
lola: 24699927 markings, 69106901 edges, 130967 markings/sec, 165 secs
lola: 25310783 markings, 70902387 edges, 122171 markings/sec, 170 secs
lola: 25919424 markings, 72845434 edges, 121728 markings/sec, 175 secs
lola: 26609145 markings, 74791660 edges, 137944 markings/sec, 180 secs
lola: 27220945 markings, 76679025 edges, 122360 markings/sec, 185 secs
lola: 27784832 markings, 78378716 edges, 112777 markings/sec, 190 secs
lola: 28426796 markings, 80148765 edges, 128393 markings/sec, 195 secs
lola: 29049066 markings, 81930387 edges, 124454 markings/sec, 200 secs
lola: 29696477 markings, 83790381 edges, 129482 markings/sec, 205 secs
lola: 30287612 markings, 85669103 edges, 118227 markings/sec, 210 secs
lola: 30834721 markings, 87411529 edges, 109422 markings/sec, 215 secs
lola: 31558218 markings, 89267582 edges, 144699 markings/sec, 220 secs
lola: 32310879 markings, 91261545 edges, 150532 markings/sec, 225 secs
lola: 33065651 markings, 93090400 edges, 150954 markings/sec, 230 secs
lola: 33725028 markings, 94963322 edges, 131875 markings/sec, 235 secs
lola: 34370770 markings, 96759516 edges, 129148 markings/sec, 240 secs
lola: 35085546 markings, 98727970 edges, 142955 markings/sec, 245 secs
lola: 35841702 markings, 100685441 edges, 151231 markings/sec, 250 secs
lola: 36638669 markings, 102640051 edges, 159393 markings/sec, 255 secs
lola: 37406159 markings, 104652754 edges, 153498 markings/sec, 260 secs
lola: 38113081 markings, 106581152 edges, 141384 markings/sec, 265 secs
lola: 38761022 markings, 108472912 edges, 129588 markings/sec, 270 secs
lola: 39444140 markings, 110354946 edges, 136624 markings/sec, 275 secs
lola: 40181809 markings, 112171451 edges, 147534 markings/sec, 280 secs
lola: 40883165 markings, 114016962 edges, 140271 markings/sec, 285 secs
lola: 41604852 markings, 115753663 edges, 144337 markings/sec, 290 secs
lola: 42217583 markings, 117552014 edges, 122546 markings/sec, 295 secs
lola: 42816907 markings, 119242671 edges, 119865 markings/sec, 300 secs
lola: 43404763 markings, 121099911 edges, 117571 markings/sec, 305 secs
lola: 44059002 markings, 122943639 edges, 130848 markings/sec, 310 secs
lola: 44737503 markings, 124799651 edges, 135700 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((2 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (G ((2 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))))))
lola: processed formula: A (G (G (G (G ((2 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p53))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p53)))))
lola: processed formula: A (F (G (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p53)))))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 82 markings, 83 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p52 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p52 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p199))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p199))))))
lola: processed formula: A (F (X (F (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p199))))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 765173 markings, 2914265 edges, 153035 markings/sec, 0 secs
lola: 1427598 markings, 5655462 edges, 132485 markings/sec, 5 secs
lola: 1987471 markings, 7955460 edges, 111975 markings/sec, 10 secs
lola: 2579407 markings, 10350823 edges, 118387 markings/sec, 15 secs
lola: 3162235 markings, 12660713 edges, 116566 markings/sec, 20 secs
lola: 3787917 markings, 15122241 edges, 125136 markings/sec, 25 secs
lola: 4355643 markings, 17521384 edges, 113545 markings/sec, 30 secs
lola: 4902424 markings, 19802432 edges, 109356 markings/sec, 35 secs
lola: 5414459 markings, 22165697 edges, 102407 markings/sec, 40 secs
lola: 5923466 markings, 24395043 edges, 101801 markings/sec, 45 secs
lola: 6384827 markings, 26523685 edges, 92272 markings/sec, 50 secs
lola: 6931950 markings, 28729173 edges, 109425 markings/sec, 55 secs
lola: 7415991 markings, 30878079 edges, 96808 markings/sec, 60 secs
lola: 7964224 markings, 33215209 edges, 109647 markings/sec, 65 secs
lola: 8454442 markings, 35385858 edges, 98044 markings/sec, 70 secs
lola: 8925226 markings, 37670637 edges, 94157 markings/sec, 75 secs
lola: 9435045 markings, 39809314 edges, 101964 markings/sec, 80 secs
lola: 9938370 markings, 41990621 edges, 100665 markings/sec, 85 secs
lola: 10408455 markings, 44140656 edges, 94017 markings/sec, 90 secs
lola: 10966030 markings, 46459471 edges, 111515 markings/sec, 95 secs
lola: 11589900 markings, 48936130 edges, 124774 markings/sec, 100 secs
lola: 12140116 markings, 51213157 edges, 110043 markings/sec, 105 secs
lola: 12676492 markings, 53457654 edges, 107275 markings/sec, 110 secs
lola: 13152933 markings, 55539579 edges, 95288 markings/sec, 115 secs
lola: 13636731 markings, 57645417 edges, 96760 markings/sec, 120 secs
lola: 14094550 markings, 59669517 edges, 91564 markings/sec, 125 secs
lola: 14570248 markings, 61862164 edges, 95140 markings/sec, 130 secs
lola: 15049984 markings, 64085253 edges, 95947 markings/sec, 135 secs
lola: 15533173 markings, 66275133 edges, 96638 markings/sec, 140 secs
lola: 16028348 markings, 68421014 edges, 99035 markings/sec, 145 secs
lola: 16521096 markings, 70536101 edges, 98550 markings/sec, 150 secs
lola: 16982582 markings, 72626371 edges, 92297 markings/sec, 155 secs
lola: 17407119 markings, 74702528 edges, 84907 markings/sec, 160 secs
lola: 17945508 markings, 76923545 edges, 107678 markings/sec, 165 secs
lola: 18452245 markings, 79059775 edges, 101347 markings/sec, 170 secs
lola: 18947494 markings, 81053280 edges, 99050 markings/sec, 175 secs
lola: 19389805 markings, 82923014 edges, 88462 markings/sec, 180 secs
lola: 19909412 markings, 85038021 edges, 103921 markings/sec, 185 secs
lola: 20404653 markings, 87136948 edges, 99048 markings/sec, 190 secs
lola: 20890015 markings, 89339498 edges, 97072 markings/sec, 195 secs
lola: 21376653 markings, 91421327 edges, 97328 markings/sec, 200 secs
lola: 21838219 markings, 93480684 edges, 92313 markings/sec, 205 secs
lola: 22286343 markings, 95491123 edges, 89625 markings/sec, 210 secs
lola: 22777575 markings, 97530226 edges, 98246 markings/sec, 215 secs
lola: 23332469 markings, 99683765 edges, 110979 markings/sec, 220 secs
lola: 23926872 markings, 101976982 edges, 118881 markings/sec, 225 secs
lola: 24460801 markings, 104286516 edges, 106786 markings/sec, 230 secs
lola: 24968158 markings, 106470739 edges, 101471 markings/sec, 235 secs
lola: 25475672 markings, 108638200 edges, 101503 markings/sec, 240 secs
lola: 25961679 markings, 110760128 edges, 97201 markings/sec, 245 secs
lola: 26474889 markings, 112947454 edges, 102642 markings/sec, 250 secs
lola: 26966797 markings, 114993880 edges, 98382 markings/sec, 255 secs
lola: 27421706 markings, 116969646 edges, 90982 markings/sec, 260 secs
lola: 27872237 markings, 118928800 edges, 90106 markings/sec, 265 secs
lola: 28414573 markings, 121129638 edges, 108467 markings/sec, 270 secs
lola: 28977616 markings, 123326383 edges, 112609 markings/sec, 275 secs
lola: 29466319 markings, 125487312 edges, 97741 markings/sec, 280 secs
lola: 29972979 markings, 127588074 edges, 101332 markings/sec, 285 secs
lola: 30484588 markings, 129781437 edges, 102322 markings/sec, 290 secs
lola: 30999846 markings, 131909048 edges, 103052 markings/sec, 295 secs
lola: 31476305 markings, 134142179 edges, 95292 markings/sec, 300 secs
lola: 31921267 markings, 136306600 edges, 88992 markings/sec, 305 secs
lola: 32373284 markings, 138451196 edges, 90403 markings/sec, 310 secs
lola: 32819259 markings, 140509290 edges, 89195 markings/sec, 315 secs
lola: 33235220 markings, 142517537 edges, 83192 markings/sec, 320 secs
lola: 33635902 markings, 144455541 edges, 80136 markings/sec, 325 secs
lola: 34040677 markings, 146414351 edges, 80955 markings/sec, 330 secs
lola: 34509692 markings, 148370384 edges, 93803 markings/sec, 335 secs
lola: 34974143 markings, 150315886 edges, 92890 markings/sec, 340 secs
lola: 35385809 markings, 152230876 edges, 82333 markings/sec, 345 secs
lola: 35842441 markings, 154302148 edges, 91326 markings/sec, 350 secs
lola: 36389649 markings, 156606757 edges, 109442 markings/sec, 355 secs
lola: 36855155 markings, 158789152 edges, 93101 markings/sec, 360 secs
lola: 37312218 markings, 160924992 edges, 91413 markings/sec, 365 secs
lola: 37756537 markings, 163025773 edges, 88864 markings/sec, 370 secs
lola: 38150448 markings, 165078158 edges, 78782 markings/sec, 375 secs
lola: 38600081 markings, 167113855 edges, 89927 markings/sec, 380 secs
lola: 39075474 markings, 169247832 edges, 95079 markings/sec, 385 secs
lola: 39575817 markings, 171383265 edges, 100069 markings/sec, 390 secs
lola: 40009475 markings, 173391919 edges, 86732 markings/sec, 395 secs
lola: 40464127 markings, 175406294 edges, 90930 markings/sec, 400 secs
lola: 40870229 markings, 177377168 edges, 81220 markings/sec, 405 secs
lola: 41264297 markings, 179321729 edges, 78814 markings/sec, 410 secs
lola: 41786025 markings, 181498114 edges, 104346 markings/sec, 415 secs
lola: 42357249 markings, 183727110 edges, 114245 markings/sec, 420 secs
lola: 42869805 markings, 185947880 edges, 102511 markings/sec, 425 secs
lola: 43362785 markings, 188079217 edges, 98596 markings/sec, 430 secs
lola: 43845560 markings, 190187716 edges, 96555 markings/sec, 435 secs
lola: 44309578 markings, 192245645 edges, 92804 markings/sec, 440 secs
lola: 44809122 markings, 194430777 edges, 99909 markings/sec, 445 secs
lola: 45267191 markings, 196534717 edges, 91614 markings/sec, 450 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: processed formula: A (X ((3 <= p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 11 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p53)))))
lola: processed formula: A (G (F (((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p53)))))
lola: processed formula length: 131
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 12 will run for 689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p199 <= p150))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p199 <= p150)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 13 will run for 919 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))) U ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p123) U (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) U ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p123) U (1 <= p18))))
lola: processed formula: A ((F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) U ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p123) U (1 <= p18))))
lola: processed formula length: 143
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))))
lola: processed formula: A (G (G (X (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))))
lola: processed formula length: 130
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 1354015 markings, 1697907 edges, 270803 markings/sec, 0 secs
lola: 2676850 markings, 3365613 edges, 264567 markings/sec, 5 secs
lola: 4036167 markings, 5075280 edges, 271863 markings/sec, 10 secs
lola: 5334115 markings, 6714627 edges, 259590 markings/sec, 15 secs
lola: 6605985 markings, 8314974 edges, 254374 markings/sec, 20 secs
lola: 7824369 markings, 9860566 edges, 243677 markings/sec, 25 secs
lola: 8949707 markings, 11265170 edges, 225068 markings/sec, 30 secs
lola: 10094983 markings, 12726611 edges, 229055 markings/sec, 35 secs
lola: 11227066 markings, 14162832 edges, 226417 markings/sec, 40 secs
lola: 12348002 markings, 15538619 edges, 224187 markings/sec, 45 secs
lola: 13471215 markings, 16874279 edges, 224643 markings/sec, 50 secs
lola: 14588183 markings, 18217001 edges, 223394 markings/sec, 55 secs
lola: 15760123 markings, 19699428 edges, 234388 markings/sec, 60 secs
lola: 16922236 markings, 21175240 edges, 232423 markings/sec, 65 secs
lola: 18156499 markings, 22717826 edges, 246853 markings/sec, 70 secs
lola: 19372313 markings, 24256061 edges, 243163 markings/sec, 75 secs
lola: 20535839 markings, 25709008 edges, 232705 markings/sec, 80 secs
lola: 21638293 markings, 27114797 edges, 220491 markings/sec, 85 secs
lola: 22741257 markings, 28512331 edges, 220593 markings/sec, 90 secs
lola: 23840198 markings, 29880901 edges, 219788 markings/sec, 95 secs
lola: 25025452 markings, 31393924 edges, 237051 markings/sec, 100 secs
lola: 26141463 markings, 32809583 edges, 223202 markings/sec, 105 secs
lola: 27258610 markings, 34234872 edges, 223429 markings/sec, 110 secs
lola: 28386571 markings, 35624831 edges, 225592 markings/sec, 115 secs
lola: 29497786 markings, 36992393 edges, 222243 markings/sec, 120 secs
lola: 30674054 markings, 38455111 edges, 235254 markings/sec, 125 secs
lola: 31852411 markings, 39915362 edges, 235671 markings/sec, 130 secs
lola: 33037370 markings, 41396631 edges, 236992 markings/sec, 135 secs
lola: 34231311 markings, 42829916 edges, 238788 markings/sec, 140 secs
lola: 35403358 markings, 44253473 edges, 234409 markings/sec, 145 secs
lola: 36536151 markings, 45638401 edges, 226559 markings/sec, 150 secs
lola: 37688315 markings, 47049948 edges, 230433 markings/sec, 155 secs
lola: 38805717 markings, 48424962 edges, 223480 markings/sec, 160 secs
lola: 39948129 markings, 49830947 edges, 228482 markings/sec, 165 secs
lola: 41089001 markings, 51233604 edges, 228174 markings/sec, 170 secs
lola: 42193293 markings, 52589079 edges, 220858 markings/sec, 175 secs
lola: 43251892 markings, 53890168 edges, 211720 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p9)) U F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p9)) U F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
lola: processed formula: A ((((1 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141) U (3 <= p9)) U F ((p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
lola: processed formula length: 199
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: RESULT
lola:
SUMMARY: yes no yes no no unknown no no yes unknown no no yes yes unknown yes
lola: ========================================
FORMULA PermAdmissibility-COL-05-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-15 TRUE 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-05"
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-05.tgz
mv PermAdmissibility-COL-05 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-05, 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-152732584000127"
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 ;