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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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-structural
Input is PermAdmissibility-COL-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474000430
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527153246570


BK_STOP 1527153293587

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-01 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 1206, 'Memory': 126.04, 'Tool': 'lola'}, {'Time': 1404, 'Memory': 130.41, 'Tool': 'lola'}, {'Time': 17079, 'Memory': 547.97, 'Tool': 'gspn'}, {'Time': 21567, 'Memory': 566.72, 'Tool': 'gspn'}, {'Time': 31603, 'Memory': 1122.43, 'Tool': 'itstools'}, {'Time': 34204, 'Memory': 1134.63, 'Tool': 'itstools'}, {'Time': 318598, 'Memory': 10131.01, 'Tool': 'marcie'}, {'Time': 329878, 'Memory': 10130.89, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 26.20480928689884x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-01...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PermAdmissibility-COL-01: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-01: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-COL-01 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-01-CTLCardinality.task
lola: (((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) AND A (F (((p110 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p146 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))) AND NOT(A (((p75 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U (3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23))))) : E (F (A (F (((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)))))) : E (G (E (G ((p75 <= 1))))) : A (F (((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= 0) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= 1) AND (p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p76)))) : ((((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p109) OR ((2 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74) AND (2 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) OR (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)) AND (3 <= p145)) OR E (F (A (X ((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))))) : A (X (E (G ((p146 <= 1))))) : A ((((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((3 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (p150 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108))) U A (F ((3 <= p24))))) : E ((A (F ((2 <= p150))) U E (G ((2 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158))))) : ((((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + 1 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (3 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66) OR ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 <= p75) AND (p109 <= 0))) OR A (F (((p149 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (3 <= p136))))) OR A (G (E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))) : A (G (A (F ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p110))))) : NOT(((2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) AND NOT(E (F ((3 <= p58)))))) : (A (F (A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74))))) AND E (X ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))) : A ((E (X ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))) U (2 <= p150))) : A (G (A (X ((p135 <= 2))))) : A (F ((A (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p75))) AND ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p25) AND (p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92))))) : A ((A (F ((3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))) U E (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) AND A (F (((p110 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p146 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))) AND NOT(A (((p75 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U (3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)
lola: processed formula length: 104
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p110 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p146 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p110 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p146 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))
lola: processed formula: A (F (((p110 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108) AND (p146 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))
lola: processed formula length: 141
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + 1 <= p75) R (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p75 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U (3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))
lola: processed formula length: 117
lola: 8 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) AND (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))
lola: processed formula length: 199
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 52537 markings, 140986 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p75 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (2 <= p75))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 17 markings, 49 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= 0) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= 1) AND (p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= 0) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= 1) AND (p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p76))))
lola: processed formula: A (F (((1 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= 0) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= 1) AND (p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p76))))
lola: processed formula length: 328
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p109) OR ((2 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74) AND (2 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) OR (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)) AND (3 <= p145)) OR E (F (A (X ((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p109) OR ((2 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74) AND (2 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) OR (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)) AND (3 <= p145))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + 1 <= p109) OR ((2 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74) AND (2 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)) OR (p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)) AND (3 <= p145))
lola: processed formula length: 312
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: processed formula with 5 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((3 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p146 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (2 <= p146))))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 50 markings, 51 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((3 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (p150 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108))) U A (F ((3 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) OR ((3 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (p150 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108))) U A(TRUE U (3 <= p24)))
lola: processed formula length: 213
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((2 <= p150))) U E (G ((2 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (2 <= p150)) U NOT(A(TRUE U (p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 <= 1))))
lola: processed formula length: 102
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 18 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + 1 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (3 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66) OR ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 <= p75) AND (p109 <= 0))) OR A (F (((p149 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + 1 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (3 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66) OR ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 <= p75) AND (p109 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + 1 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126) OR (3 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66) OR ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 <= p75) AND (p109 <= 0)))
lola: processed formula length: 325
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: processed formula with 5 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p149 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (3 <= p136))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p149 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (3 <= p136))))
lola: processed formula: A (F (((p149 <= p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (3 <= p136))))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))))
lola: processed formula length: 74
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 52537 markings, 54601 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p110)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p110)))))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) AND NOT(E (F ((3 <= p58))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 1)
lola: processed formula length: 52
lola: 8 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-01-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 10489 markings, 12552 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74))))) AND E (X ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74)))
lola: processed formula: A (F ((1 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74)))
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.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: 10489 markings, 12552 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))
lola: processed formula length: 100
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))) U (2 <= p150)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166)) U (2 <= p150))
lola: processed formula length: 125
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((p135 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((p135 <= 2)))))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 52537 markings, 54600 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p75))) AND ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p25) AND (p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p75))) AND ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p25) AND (p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92)))))
lola: processed formula: A (F ((A (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p75))) AND ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158) AND (p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p25) AND (p100 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p90 + p89 + p88 + p87 + p86 + p85 + p91 + p92)))))
lola: processed formula length: 360
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 53177 markings, 76104 edges
lola: ========================================
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118))) U E (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)) U NOT(A(TRUE U (p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))
lola: processed formula length: 199
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 53 markings, 58 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes no no no no no yes no yes yes no
FORMULA PermAdmissibility-COL-01-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-01"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is PermAdmissibility-COL-01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666474000430"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;