fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r088-blw7-152649998400374
Last Updated
June 26, 2018

About the Execution of LoLA for GlobalResAllocation-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5343.250 3600000.00 3043615.00 282.00 F?FT?FTTF?TTTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GlobalResAllocation-COL-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998400374
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526771417851

info: Time: 3600 - MCC
===========================================================================================
prep: translating GlobalResAllocation-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GlobalResAllocation-COL-06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ GlobalResAllocation-COL-06 @ 2698 seconds
lola: LoLA will run for 2698 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 136764/65536 symbol table entries, 111398 collisions
lola: preprocessing...
lola: Size of bit vector: 3264
lola: finding significant places
lola: 102 places, 136662 transitions, 78 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5250 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-06-CTLCardinality.task
lola: always true
lola: always true
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R2 = 1e+30 is above its equality of -1
check_solution: Constraint R3 = 1e+30 is above its equality of -1
check_solution: Constraint R4 = 1e+30 is above its equality of -1
check_solution: Constraint R5 = 1e+30 is above its equality of -1
check_solution: Constraint R6 = 1e+30 is above its equality of -1
check_solution: Constraint R7 = 1e+30 is above its equality of -1
check_solution: Constraint R8 = 1e+30 is above its equality of -1
check_solution: Constraint R9 = 1e+30 is above its equality of -1
check_solution: Constraint R10 = 1e+30 is above its equality of -1
check_solution: Constraint R11 = 1e+30 is above its equality of -1

Seriously low accuracy found ||*|| = 1e+30 (rel. error 0.000720981)
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R1 = 0 is below its lower bound 1
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)
check_solution: Constraint R2 = 0 is alola: (A (X (E (G ((2 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95))))) AND A (G ((3 <= p100 + p101 + p96 + p97 + p98 + p99)))) : (NOT((E (F ((p0 + p1 + p2 + p3 + p4 + p5 <= p100 + p101 + p96 + p97 + p98 + p99))) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5))) OR (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p0 + p1 + p2 + p3 + p4 + p5)) : (2 <= p18 + p19 + p20 + p23 + p22 + p21) : A ((E (X ((p0 + p1 + p2 + p3 + p4 + p5 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95))) U ((3 <= p0 + p1 + p2 + p3 + p4 + p5) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5)))) : E (F (NOT(A (F ((3 <= p100 + p101 + p96 + p97 + p98 + p99)))))) : (2 <= p100 + p101 + p96 + p97 + p98 + p99) : (((E (X ((p0 + p1 + p2 + p3 + p4 + p5 <= p18 + p19 + p20 + p23 + p22 + p21))) OR E (X ((1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))) OR (2 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)) OR E (F ((p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))) : (2 <= p0 + p1 + p2 + p3 + p4 + p5) : A ((E (G ((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))) U ())) : NOT(NOT((E (G ((2 <= p18 + p19 + p20 + p23 + p22 + p21))) AND (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 0)))) : (p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) : (A (X (((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (3 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5)))) OR NOT(E (F ((p0 + p1 + p2 + p3 + p4 + p5 <= p100 + p101 + p96 + p97 + p98 + p99))))) : (A (F ((1 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95))) OR E (X (((p0 + p1 + p2 + p3 + p4 + p5 + 1 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) AND ((p100 + p101 + p96 + p97 + p98 + p99 <= p18 + p19 + p20 + p23 + p22 + p21) OR (p0 + p1 + p2 + p3 + p4 + p5 <= p18 + p19 + p20 + p23 + p22 + p21)))))) : E (X (E (X (((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (1 <= p18 + p19 + p20 + p23 + p22 + p21)))))) : E (X ((((p18 + p19 + p20 + p23 + p22 + p21 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (p100 + p101 + p96 + p97 + p98 + p99 + 1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) OR (p0 + p1 + p2 + p3 + p4 + p5 <= 1)))) : E (X (((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95) AND E (X ((1 <= p100 + p101 + p96 + p97 + p98 + p99))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p18 + p19 + p20 + p23 + p22 + p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p18 + p19 + p20 + p23 + p22 + p21)
lola: processed formula length: 40
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: ========================================
bove its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1
check_solution: Constraint R4 = 0 is above its equality of -1
check_solution: Constraint R5 = 0 is above its equality of -1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R11 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA GlobalResAllocation-COL-06-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p100 + p101 + p96 + p97 + p98 + p99)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p100 + p101 + p96 + p97 + p98 + p99)
lola: processed formula length: 42
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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:
FORMULA GlobalResAllocation-COL-06-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p0 + p1 + p2 + p3 + p4 + p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0 + p1 + p2 + p3 + p4 + p5)
lola: processed formula length: 34
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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:
FORMULA GlobalResAllocation-COL-06-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 3 will run for 183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
lola: processed formula length: 98
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-06-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: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p0 + p1 + p2 + p3 + p4 + p5 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(EX((p0 + p1 + p2 + p3 + p4 + p5 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84... (shortened)
lola: processed formula length: 547
lola: 30 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1 markings, 0 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((2 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p100 + p101 + p96 + p97 + p98 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= p100 + p101 + p96 + p97 + p98 + p99)))
lola: processed formula length: 50
lola: 30 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p100 + p101 + p96 + p97 + p98 + p99 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-06-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola:
FORMULA GlobalResAllocation-COL-06-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: ========================================
lola: subprocess 7 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((p0 + p1 + p2 + p3 + p4 + p5 <= p18 + p19 + p20 + p23 + p22 + p21))) OR (E (X ((1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))) OR ((2 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
lola: processed formula length: 106
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
formula 0: (p0 + p1 + p2 + p3 + p4 + p5 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas

FORMULA GlobalResAllocation-COL-06-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (3 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5)))) OR A (G ((p100 + p101 + p96 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p100 + p101 + p96 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((p100 + p101 + p96 + p97 + p98 + p99 + 1 <= p0 + p1 + p2 + p3 + p4 + p5)))
lola: processed formula length: 80
lola: 30 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (p0 + p1 + p2 + p3 + p4 + p5 <= p100 + p101 + p96 + p97 + p98 + p99)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-06-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-06-CTLCardinality-8-0.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (3 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (3 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5)))
lola: processed formula length: 194
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: 0 markings, 0 edges, 0 markings/sec, 30 secs
lola: 0 markings, 0 edges, 0 markings/sec, 35 secs
lola: 0 markings, 0 edges, 0 markings/sec, 40 secs
lola: 0 markings, 0 edges, 0 markings/sec, 45 secs
lola: 0 markings, 0 edges, 0 markings/sec, 50 secs
lola: 0 markings, 0 edges, 0 markings/sec, 55 secs
lola: 0 markings, 0 edges, 0 markings/sec, 60 secs
lola: 0 markings, 0 edges, 0 markings/sec, 65 secs
lola: 0 markings, 0 edges, 0 markings/sec, 70 secs
lola: 0 markings, 0 edges, 0 markings/sec, 75 secs
lola: 0 markings, 0 edges, 0 markings/sec, 80 secs
lola: 0 markings, 0 edges, 0 markings/sec, 85 secs
lola: 0 markings, 0 edges, 0 markings/sec, 90 secs
lola: 0 markings, 0 edges, 0 markings/sec, 95 secs
lola: 0 markings, 0 edges, 0 markings/sec, 100 secs
lola: 0 markings, 0 edges, 0 markings/sec, 105 secs
lola: 0 markings, 0 edges, 0 markings/sec, 110 secs
lola: 0 markings, 0 edges, 0 markings/sec, 115 secs
lola: 0 markings, 0 edges, 0 markings/sec, 120 secs
lola: 0 markings, 0 edges, 0 markings/sec, 125 secs
lola: 0 markings, 0 edges, 0 markings/sec, 130 secs
lola: 0 markings, 0 edges, 0 markings/sec, 135 secs
lola: 0 markings, 0 edges, 0 markings/sec, 140 secs
lola: 0 markings, 0 edges, 0 markings/sec, 145 secs
lola: 0 markings, 0 edges, 0 markings/sec, 150 secs
lola: 0 markings, 0 edges, 0 markings/sec, 155 secs
lola: 0 markings, 0 edges, 0 markings/sec, 160 secs
lola: 0 markings, 0 edges, 0 markings/sec, 165 secs
lola: 0 markings, 0 edges, 0 markings/sec, 170 secs
lola: 0 markings, 0 edges, 0 markings/sec, 175 secs
lola: 0 markings, 0 edges, 0 markings/sec, 180 secs
lola: 0 markings, 0 edges, 0 markings/sec, 185 secs
lola: 0 markings, 0 edges, 0 markings/sec, 190 secs
lola: 0 markings, 0 edges, 0 markings/sec, 195 secs
lola: 0 markings, 0 edges, 0 markings/sec, 200 secs
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: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p75 + p71 + p59 + p47 + p35 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90... (shortened)
lola: processed formula length: 436
lola: 30 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 1 markings, 0 edges, 0 markings/sec, 10 secs
lola: 1 markings, 0 edges, 0 markings/sec, 15 secs
lola: 1 markings, 0 edges, 0 markings/sec, 20 secs
lola: 1 markings, 0 edges, 0 markings/sec, 25 secs
lola: 1 markings, 0 edges, 0 markings/sec, 30 secs
lola: 1 markings, 0 edges, 0 markings/sec, 35 secs
lola: 1 markings, 0 edges, 0 markings/sec, 40 secs
lola: 1 markings, 0 edges, 0 markings/sec, 45 secs
lola: 1 markings, 0 edges, 0 markings/sec, 50 secs
lola: 1 markings, 0 edges, 0 markings/sec, 55 secs
lola: 1 markings, 0 edges, 0 markings/sec, 60 secs
lola: 1 markings, 0 edges, 0 markings/sec, 65 secs
lola: 1 markings, 0 edges, 0 markings/sec, 70 secs
lola: 1 markings, 0 edges, 0 markings/sec, 75 secs
lola: 1 markings, 0 edges, 0 markings/sec, 80 secs
lola: 1 markings, 0 edges, 0 markings/sec, 85 secs
lola: 1 markings, 0 edges, 0 markings/sec, 90 secs
lola: 1 markings, 0 edges, 0 markings/sec, 95 secs
lola: 1 markings, 0 edges, 0 markings/sec, 100 secs
lola: 1 markings, 0 edges, 0 markings/sec, 105 secs
lola: 1 markings, 0 edges, 0 markings/sec, 110 secs
lola: 1 markings, 0 edges, 0 markings/sec, 115 secs
lola: 1 markings, 0 edges, 0 markings/sec, 120 secs
lola: 1 markings, 0 edges, 0 markings/sec, 125 secs
lola: 1 markings, 0 edges, 0 markings/sec, 130 secs
lola: 1 markings, 0 edges, 0 markings/sec, 135 secs
lola: 1 markings, 0 edges, 0 markings/sec, 140 secs
lola: 1 markings, 0 edges, 0 markings/sec, 145 secs
lola: 1 markings, 0 edges, 0 markings/sec, 150 secs
lola: 1 markings, 0 edges, 0 markings/sec, 155 secs
lola: 1 markings, 0 edges, 0 markings/sec, 160 secs
lola: 1 markings, 0 edges, 0 markings/sec, 165 secs
lola: 1 markings, 0 edges, 0 markings/sec, 170 secs
lola: 1 markings, 0 edges, 0 markings/sec, 175 secs
lola: 1 markings, 0 edges, 0 markings/sec, 180 secs
lola: 1 markings, 0 edges, 0 markings/sec, 185 secs
lola: 1 markings, 0 edges, 0 markings/sec, 190 secs
lola: 1 markings, 0 edges, 0 markings/sec, 195 secs
lola: 1 markings, 0 edges, 0 markings/sec, 200 secs
lola: 1 markings, 0 edges, 0 markings/sec, 205 secs
lola: 1 markings, 0 edges, 0 markings/sec, 210 secs
lola: 1 markings, 0 edges, 0 markings/sec, 215 secs
lola: 1 markings, 0 edges, 0 markings/sec, 220 secs
lola: 1 markings, 0 edges, 0 markings/sec, 225 secs
lola: 1 markings, 0 edges, 0 markings/sec, 230 secs
lola: 1 markings, 0 edges, 0 markings/sec, 235 secs
lola: 1 markings, 0 edges, 0 markings/sec, 240 secs
lola: 1 markings, 0 edges, 0 markings/sec, 245 secs
lola: 1 markings, 0 edges, 0 markings/sec, 250 secs
lola: 1 markings, 0 edges, 0 markings/sec, 255 secs
lola: 1 markings, 0 edges, 0 markings/sec, 260 secs
lola: 1 markings, 0 edges, 0 markings/sec, 265 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (1 <= p18 + p19 + p20 + p23 + p22 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX(((2 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (1 <= p18 + p19 + p20 + p23 + p22 + p21))))
lola: processed formula length: 127
lola: 30 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p18 + p19 + p20 + p23 + p22 + p21 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (p100 + p101 + p96 + p97 + p98 + p99 + 1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) OR (p0 + p1 + p2 + p3 + p4 + p5 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((((p18 + p19 + p20 + p23 + p22 + p21 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (p100 + p101 + p96 + p97 + p98 + p99 + 1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) OR (p0 + p1 + p2 + p3 + p4 + p5 <= 1)))
lola: processed formula length: 232
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p82 + p81 + p80 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p79 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p78 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p77 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 + p72 + p73 + p74 + p7... (shortened)
lola: processed formula length: 557
lola: 30 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: 0 markings, 0 edges, 0 markings/sec, 30 secs
lola: 0 markings, 0 edges, 0 markings/sec, 35 secs
lola: 0 markings, 0 edges, 0 markings/sec, 40 secs
lola: 0 markings, 0 edges, 0 markings/sec, 45 secs
lola: 0 markings, 0 edges, 0 markings/sec, 50 secs
lola: 0 markings, 0 edges, 0 markings/sec, 55 secs
lola: 0 markings, 0 edges, 0 markings/sec, 60 secs
lola: 0 markings, 0 edges, 0 markings/sec, 65 secs
lola: 0 markings, 0 edges, 0 markings/sec, 70 secs
lola: 0 markings, 0 edges, 0 markings/sec, 75 secs
lola: 0 markings, 0 edges, 0 markings/sec, 80 secs
lola: 0 markings, 0 edges, 0 markings/sec, 85 secs
lola: 0 markings, 0 edges, 0 markings/sec, 90 secs
lola: 0 markings, 0 edges, 0 markings/sec, 95 secs
lola: 0 markings, 0 edges, 0 markings/sec, 100 secs
lola: 0 markings, 0 edges, 0 markings/sec, 105 secs
lola: 0 markings, 0 edges, 0 markings/sec, 110 secs
lola: 0 markings, 0 edges, 0 markings/sec, 115 secs
lola: 0 markings, 0 edges, 0 markings/sec, 120 secs
lola: 0 markings, 0 edges, 0 markings/sec, 125 secs
lola: 0 markings, 0 edges, 0 markings/sec, 130 secs
lola: 0 markings, 0 edges, 0 markings/sec, 135 secs
lola: 0 markings, 0 edges, 0 markings/sec, 140 secs
lola: 0 markings, 0 edges, 0 markings/sec, 145 secs
lola: 0 markings, 0 edges, 0 markings/sec, 150 secs
lola: 0 markings, 0 edges, 0 markings/sec, 155 secs
lola: 0 markings, 0 edges, 0 markings/sec, 160 secs
lola: 0 markings, 0 edges, 0 markings/sec, 165 secs
lola: 0 markings, 0 edges, 0 markings/sec, 170 secs
lola: 0 markings, 0 edges, 0 markings/sec, 175 secs
lola: 0 markings, 0 edges, 0 markings/sec, 180 secs
lola: 0 markings, 0 edges, 0 markings/sec, 185 secs
lola: 0 markings, 0 edges, 0 markings/sec, 190 secs
lola: 0 markings, 0 edges, 0 markings/sec, 195 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p100 + p101 + p96 + p97 + p98 + p99 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p100 + p101 + p96 + p97 + p98 + p99 <= 2)
lola: processed formula length: 42
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 1 markings, 0 edges, 0 markings/sec, 10 secs
lola: 1 markings, 0 edges, 0 markings/sec, 15 secs
lola: 1 markings, 0 edges, 0 markings/sec, 20 secs
lola: 1 markings, 0 edges, 0 markings/sec, 25 secs
lola: 1 markings, 0 edges, 0 markings/sec, 30 secs
lola: 1 markings, 0 edges, 0 markings/sec, 35 secs
lola: 1 markings, 0 edges, 0 markings/sec, 40 secs
lola: 1 markings, 0 edges, 0 markings/sec, 45 secs
lola: 1 markings, 0 edges, 0 markings/sec, 50 secs
lola: 1 markings, 0 edges, 0 markings/sec, 55 secs
lola: 241 markings, 321 edges, 48 markings/sec, 60 secs
lola: 520 markings, 705 edges, 56 markings/sec, 65 secs
lola: 665 markings, 914 edges, 29 markings/sec, 70 secs
lola: 851 markings, 1176 edges, 37 markings/sec, 75 secs
lola: 1109 markings, 1551 edges, 52 markings/sec, 80 secs
lola: 1401 markings, 1962 edges, 58 markings/sec, 85 secs
lola: 1720 markings, 2413 edges, 64 markings/sec, 90 secs
lola: 1994 markings, 2800 edges, 55 markings/sec, 95 secs
lola: 2291 markings, 3221 edges, 59 markings/sec, 100 secs
lola: 2583 markings, 3649 edges, 58 markings/sec, 105 secs
lola: 2842 markings, 4019 edges, 52 markings/sec, 110 secs
lola: 3129 markings, 4435 edges, 57 markings/sec, 115 secs
lola: 3440 markings, 4933 edges, 62 markings/sec, 120 secs
lola: 3701 markings, 5323 edges, 52 markings/sec, 125 secs
lola: 3994 markings, 5778 edges, 59 markings/sec, 130 secs
lola: 4310 markings, 6276 edges, 63 markings/sec, 135 secs
lola: 4611 markings, 6760 edges, 60 markings/sec, 140 secs
lola: 4846 markings, 7157 edges, 47 markings/sec, 145 secs
lola: 5110 markings, 7560 edges, 53 markings/sec, 150 secs
lola: 5412 markings, 8006 edges, 60 markings/sec, 155 secs
lola: 5588 markings, 8268 edges, 35 markings/sec, 160 secs
lola: 5849 markings, 8654 edges, 52 markings/sec, 165 secs
lola: 6123 markings, 9076 edges, 55 markings/sec, 170 secs
lola: 6397 markings, 9515 edges, 55 markings/sec, 175 secs
lola: 6661 markings, 9944 edges, 53 markings/sec, 180 secs
lola: 6939 markings, 10397 edges, 56 markings/sec, 185 secs
lola: 7258 markings, 10873 edges, 64 markings/sec, 190 secs
lola: 7530 markings, 11263 edges, 54 markings/sec, 195 secs
lola: 7810 markings, 11675 edges, 56 markings/sec, 200 secs
lola: 8094 markings, 12105 edges, 57 markings/sec, 205 secs
lola: 8376 markings, 12527 edges, 56 markings/sec, 210 secs
lola: 8645 markings, 12908 edges, 54 markings/sec, 215 secs
lola: 8928 markings, 13312 edges, 57 markings/sec, 220 secs
lola: 9182 markings, 13697 edges, 51 markings/sec, 225 secs
lola: 9431 markings, 14086 edges, 50 markings/sec, 230 secs
lola: 9692 markings, 14461 edges, 52 markings/sec, 235 secs
lola: 9951 markings, 14853 edges, 52 markings/sec, 240 secs
lola: 10222 markings, 15268 edges, 54 markings/sec, 245 secs
lola: 10495 markings, 15678 edges, 55 markings/sec, 250 secs
lola: 10763 markings, 16073 edges, 54 markings/sec, 255 secs
lola: 11020 markings, 16482 edges, 51 markings/sec, 260 secs
lola: 11289 markings, 16885 edges, 54 markings/sec, 265 secs
lola: 11554 markings, 17353 edges, 53 markings/sec, 270 secs
lola: 11826 markings, 17734 edges, 54 markings/sec, 275 secs
lola: 12129 markings, 18157 edges, 61 markings/sec, 280 secs
lola: 12397 markings, 18573 edges, 54 markings/sec, 285 secs
lola: 12703 markings, 19029 edges, 61 markings/sec, 290 secs
lola: 12930 markings, 19371 edges, 45 markings/sec, 295 secs
lola: 13207 markings, 19780 edges, 55 markings/sec, 300 secs
lola: 13520 markings, 20244 edges, 63 markings/sec, 305 secs
lola: 13829 markings, 20742 edges, 62 markings/sec, 310 secs
lola: 14093 markings, 21152 edges, 53 markings/sec, 315 secs
lola: 14382 markings, 21586 edges, 58 markings/sec, 320 secs
lola: 14683 markings, 22052 edges, 60 markings/sec, 325 secs
lola: 15002 markings, 22523 edges, 64 markings/sec, 330 secs
lola: 15303 markings, 23027 edges, 60 markings/sec, 335 secs
lola: 15588 markings, 23451 edges, 57 markings/sec, 340 secs
lola: 15892 markings, 23932 edges, 61 markings/sec, 345 secs
lola: 16177 markings, 24353 edges, 57 markings/sec, 350 secs
lola: 16491 markings, 24808 edges, 63 markings/sec, 355 secs
lola: 16793 markings, 25241 edges, 60 markings/sec, 360 secs
lola: 17099 markings, 25711 edges, 61 markings/sec, 365 secs
lola: 17273 markings, 25956 edges, 35 markings/sec, 370 secs
lola: 17439 markings, 26192 edges, 33 markings/sec, 375 secs
lola: 17720 markings, 26582 edges, 56 markings/sec, 380 secs
lola: 18027 markings, 27026 edges, 61 markings/sec, 385 secs
lola: 18336 markings, 27465 edges, 62 markings/sec, 390 secs
lola: 18612 markings, 27872 edges, 55 markings/sec, 395 secs
lola: 18892 markings, 28317 edges, 56 markings/sec, 400 secs
lola: 19069 markings, 28575 edges, 35 markings/sec, 405 secs
lola: 19281 markings, 28881 edges, 42 markings/sec, 410 secs
lola: 19516 markings, 29266 edges, 47 markings/sec, 415 secs
lola: 19777 markings, 29650 edges, 52 markings/sec, 420 secs
lola: 20016 markings, 30006 edges, 48 markings/sec, 425 secs
lola: 20202 markings, 30310 edges, 37 markings/sec, 430 secs
lola: 20445 markings, 30681 edges, 49 markings/sec, 435 secs
lola: 20686 markings, 31059 edges, 48 markings/sec, 440 secs
lola: 20915 markings, 31404 edges, 46 markings/sec, 445 secs
lola: 21175 markings, 31789 edges, 52 markings/sec, 450 secs
lola: 21438 markings, 32191 edges, 53 markings/sec, 455 secs
lola: 21671 markings, 32560 edges, 47 markings/sec, 460 secs
lola: 21926 markings, 32931 edges, 51 markings/sec, 465 secs
lola: 22175 markings, 33296 edges, 50 markings/sec, 470 secs
lola: 22434 markings, 33723 edges, 52 markings/sec, 475 secs
lola: 22662 markings, 34116 edges, 46 markings/sec, 480 secs
lola: 22928 markings, 34532 edges, 53 markings/sec, 485 secs
lola: 23214 markings, 34958 edges, 57 markings/sec, 490 secs
lola: 23444 markings, 35301 edges, 46 markings/sec, 495 secs
lola: 23643 markings, 35587 edges, 40 markings/sec, 500 secs
lola: 23785 markings, 35816 edges, 28 markings/sec, 505 secs
lola: 23822 markings, 35867 edges, 7 markings/sec, 510 secs
lola: 23963 markings, 36054 edges, 28 markings/sec, 515 secs
lola: 24077 markings, 36209 edges, 23 markings/sec, 520 secs
lola: 24189 markings, 36365 edges, 22 markings/sec, 525 secs
lola: 24329 markings, 36566 edges, 28 markings/sec, 530 secs
lola: 24574 markings, 36919 edges, 49 markings/sec, 535 secs
lola: 24840 markings, 37305 edges, 53 markings/sec, 540 secs
lola: 25045 markings, 37580 edges, 41 markings/sec, 545 secs
lola: 25284 markings, 37915 edges, 48 markings/sec, 550 secs
lola: 25477 markings, 38209 edges, 39 markings/sec, 555 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no yes unknown no yes yes no unknown yes yes yes yes yes no
lola: memory consumption: 4874708 KB
lola: time consumption: 1570 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((2 <= p18 + p19 + p20 + p23 + p22 + p21))) AND (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no yes unknown no yes yes no unknown yes yes yes yes yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 4869872 KB
lola: time consumption: 2135 seconds
lola: time limit reached - aborting
lola:
preliminary result: no unknown no yes unknown no yes yes no unknown yes yes yes yes yes no
lola:
preliminary result: no unknown no yes unknown no yes yes no unknown yes yes yes yes yes no
lola: memory consumption: 4869872 KB
lola: time consumption: 2698 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="GlobalResAllocation-COL-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/GlobalResAllocation-COL-06.tgz
mv GlobalResAllocation-COL-06 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 lola"
echo " Input is GlobalResAllocation-COL-06, 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 r088-blw7-152649998400374"
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 ;