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 336K
-rw-r--r-- 1 mcc users 4.0K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528300094
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526818939100


BK_STOP 1526819667819

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-COL-S06J04T04 as instance name.
Using PolyORBLF 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3842, 'Memory': 250.13, 'Tool': 'lola'}, {'Time': 11025, 'Memory': 418.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S06J04T04...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: A (((p86 + p85 + p84 + p87 <= p255 + p256 + p257 + p258) U ((1 <= p99) AND (1 <= p453) AND (3 <= p415) AND (p22 + p23 + p24 + p25 + p26 + p27 <= p386 + p387 + p388 + p389)))) : (((3 <= p274 + p275 + p276 + p277) OR (3 <= p83) OR (p82 + p81 + p80 + p79 + 1 <= p78)) AND E (G (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 <= p99) OR (p261 + p262 + p263 + p264 <= p18 + p19 + p20 + p21) OR (1 <= p445 + p446 + p447 + p448))))) : A (F ((A (G ((2 <= p146 + p145 + p144 + p143 + p142 + p141))) AND ((p202 + p203 + p204 + p205 <= 1) OR (p190 + p191 + p192 + p193 + 1 <= p146 + p145 + p144 + p143 + p142 + p141))))) : ((E (F ((p31 + p30 + p29 + p28 <= 2))) AND ((p394 <= 0) OR (p250 + p251 + p252 + p253 + p254 <= 2) OR (p260 <= 1))) AND A (G (A (G ((p445 + p446 + p447 + p448 <= p282 + p283 + p284 + p285)))))) : A (G ((p82 + p81 + p80 + p79 <= 2))) : A (G (E (G (((1 <= p2 + p3 + p4 + p5) OR (2 <= p269 + p268 + p267 + p266 + p265)))))) : A ((E (F ((3 <= p449 + p450 + p451 + p452))) U ((p94 <= 2) AND (p82 + p81 + p80 + p79 <= 0)))) : NOT(E (X (E (F ((1 <= p10 + p11 + p12 + p13)))))) : NOT((E (F (((1 <= p86 + p85 + p84 + p87) OR (3 <= p261 + p262 + p263 + p264)))) OR (3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249))) : A (F ((((p76 <= p198 + p199 + p200 + p201) AND ((1 <= p6 + p7 + p8 + p9) OR (p393 + p392 + p391 + p390 <= p198 + p199 + p200 + p201))) OR E (G ((3 <= p134)))))) : (NOT(E (((p202 + p203 + p204 + p205 <= p259) U (3 <= p415)))) AND (E (F (((3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249) AND (3 <= p94)))) OR (3 <= p22 + p23 + p24 + p25 + p26 + p27))) : A (F ((((p186 + p187 + p188 + p189 <= 0) AND (p445 + p446 + p447 + p448 <= 0)) AND E (X ((2 <= p369 + p370 + p371 + p372)))))) : (E (G ((p135 + p136 + p137 + p138 + p139 + p140 <= p177))) AND E (X ((2 <= p146 + p145 + p144 + p143 + p142 + p141)))) : NOT(A (F ((p94 <= p453)))) : NOT((((p77 <= 1) AND (1 <= p177)) AND A (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p2 + p3 + p4 + p5) AND (3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249)))))) : E (((p297 + p298 + p299 + p300 <= p76) U E (G ((p89 <= p449 + p450 + p451 + p452)))))
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 (((p86 + p85 + p84 + p87 <= p255 + p256 + p257 + p258) U ((1 <= p99) AND (1 <= p453) AND (3 <= p415) AND (p22 + p23 + p24 + p25 + p26 + p27 <= p386 + p387 + p388 + p389))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p86 + p85 + p84 + p87 <= p255 + p256 + p257 + p258) U ((1 <= p99) AND (1 <= p453) AND (3 <= p415) AND (p22 + p23 + p24 + p25 + p26 + p27 <= p386 + p387 + p388 + p389))))
lola: processed formula: A (((p86 + p85 + p84 + p87 <= p255 + p256 + p257 + p258) U ((1 <= p99) AND (1 <= p453) AND (3 <= p415) AND (p22 + p23 + p24 + p25 + p26 + p27 <= p386 + p387 + p388 + p389))))
lola: processed formula length: 174
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 164 markings, 164 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p274 + p275 + p276 + p277) OR (3 <= p83) OR (p82 + p81 + p80 + p79 + 1 <= p78)) AND E (G (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 <= p99) OR (p261 + p262 + p263 + p264 <= p18 + p19 + p20 + p21) OR (1 <= p445 + p446 + p447 + p448)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p274 + p275 + p276 + p277) OR (3 <= p83) OR (p82 + p81 + p80 + p79 + 1 <= p78))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p274 + p275 + p276 + p277) OR (3 <= p83) OR (p82 + p81 + p80 + p79 + 1 <= p78))
lola: processed formula length: 88
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 <= p99) OR (p261 + p262 + p263 + p264 <= p18 + p19 + p20 + p21) OR (1 <= p445 + p446 + p447 + p448))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p99 + 1 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348) AND (p18 + p19 + p20 + p21 + 1 <= p261 + p262 + p263 + p264) AND (p445 + p446 + p447 + p448 <= 0))))
lola: processed formula length: 293
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= p146 + p145 + p144 + p143 + p142 + p141))) AND ((p202 + p203 + p204 + p205 <= 1) OR (p190 + p191 + p192 + p193 + 1 <= p146 + p145 + p144 + p143 + p142 + p141)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= p146 + p145 + p144 + p143 + p142 + p141))) AND ((p202 + p203 + p204 + p205 <= 1) OR (p190 + p191 + p192 + p193 + 1 <= p146 + p145 + p144 + p143 + p142 + p141)))))
lola: processed formula: A (F ((A (G ((2 <= p146 + p145 + p144 + p143 + p142 + p141))) AND ((p202 + p203 + p204 + p205 <= 1) OR (p190 + p191 + p192 + p193 + 1 <= p146 + p145 + p144 + p143 + p142 + p141)))))
lola: processed formula length: 182
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 11115 markings, 11674 edges, 2223 markings/sec, 0 secs
lola: 22047 markings, 23333 edges, 2186 markings/sec, 5 secs
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: 25426 markings, 26954 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p31 + p30 + p29 + p28 <= 2))) AND ((p394 <= 0) OR (p250 + p251 + p252 + p253 + p254 <= 2) OR (p260 <= 1))) AND A (G (A (G ((p445 + p446 + p447 + p448 <= p282 + p283 + p284 + p285))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p31 + p30 + p29 + p28 <= 2)))
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 1616 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p394 <= 0) OR (p250 + p251 + p252 + p253 + p254 <= 2) OR (p260 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p394 <= 0) OR (p250 + p251 + p252 + p253 + p254 <= 2) OR (p260 <= 1))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p445 + p446 + p447 + p448 <= p282 + p283 + p284 + p285)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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 PolyORBLF-COL-S06J04T04-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 143 markings, 142 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p82 + p81 + p80 + p79 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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 PolyORBLF-COL-S06J04T04-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-4.sara.
lola: sara is running 0 secs || 15586 markings, 15725 edges, 3117 markings/sec, 0 secs
lola: sara is running 5 secs || 31370 markings, 31648 edges, 3157 markings/sec, 5 secs
lola: sara is running 10 secs || 47131 markings, 47551 edges, 3152 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 62833 markings, 63400 edges, 3140 markings/sec, 15 secs
lola: sara is running 20 secs || 78127 markings, 78865 edges, 3059 markings/sec, 20 secs
lola: sara is running 25 secs || 93335 markings, 94217 edges, 3042 markings/sec, 25 secs
lola: sara is running 30 secs || 109030 markings, 110064 edges, 3139 markings/sec, 30 secs
lola: sara is running 35 secs || 124970 markings, 126143 edges, 3188 markings/sec, 35 secs
lola: sara is running 40 secs || 140410 markings, 141809 edges, 3088 markings/sec, 40 secs
lola: sara is running 45 secs || 155969 markings, 157653 edges, 3112 markings/sec, 45 secs

lola: sara is running 50 secs || 171672 markings, 173633 edges, 3141 markings/sec, 50 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G (((1 <= p2 + p3 + p4 + p5) OR (2 <= p269 + p268 + p267 + p266 + p265))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U ((p2 + p3 + p4 + p5 <= 0) AND (p269 + p268 + p267 + p266 + p265 <= 1)))))
lola: processed formula length: 95
lola: 4 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 773387 markings, 1193329 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1212768 markings, 1942368 edges
lola: ========================================
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((3 <= p449 + p450 + p451 + p452))) U ((p94 <= 2) AND (p82 + p81 + p80 + p79 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (3 <= p449 + p450 + p451 + p452)) U ((p94 <= 2) AND (p82 + p81 + p80 + p79 <= 0)))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 342392 markings, 421031 edges, 3689329903141912576 markings/sec, 0 secs
lola: 689577 markings, 829455 edges, 69437 markings/sec, 5 secs
lola: 1051398 markings, 1236514 edges, 72364 markings/sec, 10 secs
lola: 1400525 markings, 1625995 edges, 69825 markings/sec, 15 secs
lola: 1728992 markings, 1979801 edges, 65693 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1728992 markings, 1979847 edges
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (E (F ((1 <= p10 + p11 + p12 + p13))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p10 + p11 + p12 + p13 <= 0)))))
lola: processed formula: A (X (A (G ((p10 + p11 + p12 + p13 <= 0)))))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 524 markings, 1160 edges
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((1 <= p86 + p85 + p84 + p87) OR (3 <= p261 + p262 + p263 + p264)))) OR (3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p86 + p85 + p84 + p87 <= 0) AND (p261 + p262 + p263 + p264 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p76 <= p198 + p199 + p200 + p201) AND ((1 <= p6 + p7 + p8 + p9) OR (p393 + p392 + p391 + p390 <= p198 + p199 + p200 + p201))) OR E (G ((3 <= p134))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p76 <= p198 + p199 + p200 + p201) AND ((1 <= p6 + p7 + p8 + p9) OR (p393 + p392 + p391 + p390 <= p198 + p199 + p200 + p201))) OR NOT(A(TRUE U (p134 <= 2)))))
lola: processed formula length: 170
lola: 3 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 13530 markings, 30164 edges
lola: ========================================
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((p202 + p203 + p204 + p205 <= p259) U (3 <= p415)))) AND (E (F (((3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249) AND (3 <= p94)))) OR (3 <= p22 + p23 + p24 + p25 + p26 + p27)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p259 + 1 <= p202 + p203 + p204 + p205) R (p415 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p259 + 1 <= p202 + p203 + p204 + p205) R (p415 <= 2)))
lola: processed formula: A (((p259 + 1 <= p202 + p203 + p204 + p205) R (p415 <= 2)))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 10323 markings, 13930 edges, 2065 markings/sec, 0 secs
lola: 21638 markings, 29022 edges, 2263 markings/sec, 5 secs
lola: 33097 markings, 44549 edges, 2292 markings/sec, 10 secs
lola: 44796 markings, 61002 edges, 2340 markings/sec, 15 secs
lola: 56642 markings, 77650 edges, 2369 markings/sec, 20 secs
lola: 68494 markings, 94246 edges, 2370 markings/sec, 25 secs
lola: 80514 markings, 111240 edges, 2404 markings/sec, 30 secs
lola: 92156 markings, 128336 edges, 2328 markings/sec, 35 secs
lola: 103792 markings, 144294 edges, 2327 markings/sec, 40 secs
lola: 114163 markings, 161945 edges, 2074 markings/sec, 45 secs
lola: 126942 markings, 180372 edges, 2556 markings/sec, 50 secs
lola: 139435 markings, 198239 edges, 2499 markings/sec, 55 secs
lola: 150147 markings, 215397 edges, 2142 markings/sec, 60 secs
lola: 163383 markings, 234914 edges, 2647 markings/sec, 65 secs
lola: 176089 markings, 254343 edges, 2541 markings/sec, 70 secs
lola: 189097 markings, 273474 edges, 2602 markings/sec, 75 secs
lola: 201390 markings, 293591 edges, 2459 markings/sec, 80 secs
lola: 215277 markings, 313975 edges, 2777 markings/sec, 85 secs
lola: 228805 markings, 334095 edges, 2706 markings/sec, 90 secs
lola: 240861 markings, 354170 edges, 2411 markings/sec, 95 secs
lola: 253848 markings, 373305 edges, 2597 markings/sec, 100 secs
lola: 266483 markings, 392287 edges, 2527 markings/sec, 105 secs
lola: 276910 markings, 410306 edges, 2085 markings/sec, 110 secs
lola: 286372 markings, 430527 edges, 1892 markings/sec, 115 secs
lola: 299839 markings, 449995 edges, 2693 markings/sec, 120 secs
lola: 311961 markings, 468692 edges, 2424 markings/sec, 125 secs
lola: 323488 markings, 486219 edges, 2305 markings/sec, 130 secs
lola: 335245 markings, 505294 edges, 2351 markings/sec, 135 secs
lola: 348805 markings, 525290 edges, 2712 markings/sec, 140 secs
lola: 362645 markings, 545782 edges, 2768 markings/sec, 145 secs
lola: 374924 markings, 566238 edges, 2456 markings/sec, 150 secs
lola: 388887 markings, 587008 edges, 2793 markings/sec, 155 secs
lola: 403016 markings, 608060 edges, 2826 markings/sec, 160 secs
lola: 414944 markings, 628413 edges, 2386 markings/sec, 165 secs
lola: 427724 markings, 647325 edges, 2556 markings/sec, 170 secs
lola: 440809 markings, 666570 edges, 2617 markings/sec, 175 secs
lola: 451201 markings, 684834 edges, 2078 markings/sec, 180 secs
lola: 460844 markings, 705351 edges, 1929 markings/sec, 185 secs
lola: 474455 markings, 725119 edges, 2722 markings/sec, 190 secs
lola: 487010 markings, 744224 edges, 2511 markings/sec, 195 secs
lola: 498384 markings, 762503 edges, 2275 markings/sec, 200 secs
lola: 511897 markings, 782540 edges, 2703 markings/sec, 205 secs
lola: 524986 markings, 802585 edges, 2618 markings/sec, 210 secs
lola: 537881 markings, 822414 edges, 2579 markings/sec, 215 secs
lola: 550866 markings, 843457 edges, 2597 markings/sec, 220 secs
lola: 566139 markings, 866335 edges, 3055 markings/sec, 225 secs
lola: 579518 markings, 887406 edges, 2676 markings/sec, 230 secs
lola: 592224 markings, 907350 edges, 2541 markings/sec, 235 secs
lola: 604953 markings, 927012 edges, 2546 markings/sec, 240 secs
lola: 617131 markings, 946100 edges, 2436 markings/sec, 245 secs
lola: 627379 markings, 966584 edges, 2050 markings/sec, 250 secs
lola: 640219 markings, 988176 edges, 2568 markings/sec, 255 secs
lola: 652983 markings, 1007739 edges, 2553 markings/sec, 260 secs
lola: 665484 markings, 1026675 edges, 2500 markings/sec, 265 secs
lola: 678071 markings, 1047165 edges, 2517 markings/sec, 270 secs
lola: 692053 markings, 1068085 edges, 2796 markings/sec, 275 secs
lola: 705742 markings, 1088804 edges, 2738 markings/sec, 280 secs
lola: 718807 markings, 1110304 edges, 2613 markings/sec, 285 secs
lola: 733445 markings, 1132522 edges, 2928 markings/sec, 290 secs
lola: 747235 markings, 1153633 edges, 2758 markings/sec, 295 secs
lola: 759832 markings, 1173804 edges, 2519 markings/sec, 300 secs
lola: 772572 markings, 1193701 edges, 2548 markings/sec, 305 secs
lola: 784644 markings, 1212704 edges, 2414 markings/sec, 310 secs
lola: 795059 markings, 1233509 edges, 2083 markings/sec, 315 secs
lola: 806533 markings, 1253753 edges, 2295 markings/sec, 320 secs
lola: 818235 markings, 1271527 edges, 2340 markings/sec, 325 secs
lola: 830331 markings, 1289193 edges, 2419 markings/sec, 330 secs
lola: 839817 markings, 1305903 edges, 1897 markings/sec, 335 secs
lola: 851456 markings, 1323425 edges, 2328 markings/sec, 340 secs
lola: 863687 markings, 1341639 edges, 2446 markings/sec, 345 secs
lola: 874683 markings, 1359073 edges, 2199 markings/sec, 350 secs
lola: 886328 markings, 1377463 edges, 2329 markings/sec, 355 secs
lola: 898111 markings, 1396005 edges, 2357 markings/sec, 360 secs
lola: 910641 markings, 1414751 edges, 2506 markings/sec, 365 secs
lola: 921899 markings, 1433847 edges, 2252 markings/sec, 370 secs
lola: 933416 markings, 1451681 edges, 2303 markings/sec, 375 secs
lola: 945306 markings, 1469668 edges, 2378 markings/sec, 380 secs
lola: 955229 markings, 1487633 edges, 1985 markings/sec, 385 secs
lola: 964695 markings, 1507846 edges, 1893 markings/sec, 390 secs
lola: 973948 markings, 1528237 edges, 1851 markings/sec, 395 secs
lola: 983510 markings, 1549420 edges, 1912 markings/sec, 400 secs
lola: 993309 markings, 1571010 edges, 1960 markings/sec, 405 secs
lola: 1003431 markings, 1593215 edges, 2024 markings/sec, 410 secs
lola: 1013004 markings, 1614332 edges, 1915 markings/sec, 415 secs
lola: 1023035 markings, 1637786 edges, 2006 markings/sec, 420 secs
lola: 1035339 markings, 1655550 edges, 2461 markings/sec, 425 secs
lola: 1047434 markings, 1673488 edges, 2419 markings/sec, 430 secs
lola: 1058000 markings, 1690598 edges, 2113 markings/sec, 435 secs
lola: 1070489 markings, 1708693 edges, 2498 markings/sec, 440 secs
lola: 1082518 markings, 1727492 edges, 2406 markings/sec, 445 secs
lola: 1094739 markings, 1745873 edges, 2444 markings/sec, 450 secs
lola: 1106407 markings, 1765002 edges, 2334 markings/sec, 455 secs
lola: 1119121 markings, 1784244 edges, 2543 markings/sec, 460 secs
lola: 1131946 markings, 1803405 edges, 2565 markings/sec, 465 secs
lola: 1143379 markings, 1822713 edges, 2287 markings/sec, 470 secs
lola: 1155059 markings, 1840512 edges, 2336 markings/sec, 475 secs
lola: 1167242 markings, 1858802 edges, 2437 markings/sec, 480 secs
lola: 1177548 markings, 1876312 edges, 2061 markings/sec, 485 secs
lola: 1186995 markings, 1896137 edges, 1889 markings/sec, 490 secs
lola: 1199633 markings, 1915242 edges, 2528 markings/sec, 495 secs
lola: 1210866 markings, 1932832 edges, 2247 markings/sec, 500 secs
lola: 1222451 markings, 1949896 edges, 2317 markings/sec, 505 secs
lola: 1232744 markings, 1967795 edges, 2059 markings/sec, 510 secs
lola: 1245460 markings, 1986627 edges, 2543 markings/sec, 515 secs
lola: 1258617 markings, 2006204 edges, 2631 markings/sec, 520 secs
lola: 1269633 markings, 2024637 edges, 2203 markings/sec, 525 secs
lola: 1282350 markings, 2043610 edges, 2543 markings/sec, 530 secs
lola: 1295931 markings, 2064116 edges, 2716 markings/sec, 535 secs
lola: 1307378 markings, 2083004 edges, 2289 markings/sec, 540 secs
lola: 1319308 markings, 2100882 edges, 2386 markings/sec, 545 secs
lola: 1331262 markings, 2119723 edges, 2391 markings/sec, 550 secs
lola: 1342024 markings, 2136485 edges, 2152 markings/sec, 555 secs
lola: 1351467 markings, 2155127 edges, 1889 markings/sec, 560 secs
lola: 1361778 markings, 2174771 edges, 2062 markings/sec, 565 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p186 + p187 + p188 + p189 <= 0) AND (p445 + p446 + p447 + p448 <= 0)) AND E (X ((2 <= p369 + p370 + p371 + p372))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p186 + p187 + p188 + p189 <= 0) AND (p445 + p446 + p447 + p448 <= 0)) AND EX((2 <= p369 + p370 + p371 + p372))))
lola: processed formula length: 124
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 37 markings, 36 edges
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p135 + p136 + p137 + p138 + p139 + p140 <= p177))) AND E (X ((2 <= p146 + p145 + p144 + p143 + p142 + p141))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p135 + p136 + p137 + p138 + p139 + p140 <= p177)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p177 + 1 <= p135 + p136 + p137 + p138 + p139 + p140)))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 20 markings, 54 edges
lola: ========================================
lola: subprocess 13 will run for 952 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p146 + p145 + p144 + p143 + p142 + p141)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p146 + p145 + p144 + p143 + p142 + p141))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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 13 will run for 952 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((p94 <= p453))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p94 <= p453)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 37 markings, 36 edges
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p77 <= 1) AND (1 <= p177)) AND A (F (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p2 + p3 + p4 + p5) AND (3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p77) OR (p177 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p77) OR (p177 <= 0))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2 + p3 + p4 + p5 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123) OR (p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 <= p2 + p3 + p4 + p5) AND (3 <= p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249))))
lola: processed formula length: 354
lola: 7 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p297 + p298 + p299 + p300 <= p76) U E (G ((p89 <= p449 + p450 + p451 + p452)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p297 + p298 + p299 + p300 <= p76) U NOT(A(TRUE U (p449 + p450 + p451 + p452 + 1 <= p89))))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: 37 markings, 37 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no unknown no yes yes yes yes
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PolyORBLF-COL-S06J04T04, 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 r126-smll-152673528300094"
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 ;