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 168K
-rw-r--r-- 1 mcc users 3.2K 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 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-COL-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708742800010
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527104380781

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-COL-000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SharedMemory-COL-000010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ SharedMemory-COL-000010 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 361/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 220 transitions, 120 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 260 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000010-CTLCardinality.task
lola: LP says that atomic proposition is always false: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: LP says that atomic proposition is always false: (2 <= p100)
lola: LP says that atomic proposition is always true: (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: LP says that atomic proposition is always true: (p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: LP says that atomic proposition is always false: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always false: (2 <= p100)
lola: LP says that atomic proposition is always true: (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: A (G (A (G (TRUE)))) : A (((p100 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U A (G (TRUE)))) : A (G (A (((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131))))) : (((((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) OR (1 <= p100) OR ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)))) AND E (X (((p100 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) AND (2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120))))) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131) AND A (G (TRUE)))) : E (F (NOT(E (X ((p100 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)))))) : (E (((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p100) U FALSE)) OR E (X (A (G ((3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))))) : NOT(E (F (()))) : A (G ((() OR E (F (TRUE))))) : NOT(E (X (E (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))))) : E ((TRUE U A (X ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))) : NOT(NOT(E (F (FALSE)))) : E (F (A (G (FALSE)))) : NOT(A (X (A (G (TRUE))))) : NOT(NOT(E (F ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 <= p100))))) : NOT(E (F (FALSE))) : (A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p39 + p29 + p19 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120) OR (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 <= 1)))) AND E (X (A (G (TRUE)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:279
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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 SharedMemory-COL-000010-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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 SharedMemory-COL-000010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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 SharedMemory-COL-000010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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 SharedMemory-COL-000010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 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: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 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: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 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: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-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 SharedMemory-COL-000010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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 SharedMemory-COL-000010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)))
lola: processed formula length: 154
lola: 70 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 649595 markings, 2086157 edges, 129919 markings/sec, 0 secs
lola: 1348795 markings, 4221053 edges, 139840 markings/sec, 5 secs
lola: 1758906 markings, 6826191 edges, 82022 markings/sec, 10 secs
lola: 1819516 markings, 9407637 edges, 12122 markings/sec, 15 secs
lola: 1825738 markings, 11979506 edges, 1244 markings/sec, 20 secs
lola: 1828843 markings, 14540867 edges, 621 markings/sec, 25 secs
lola: 1830180 markings, 17141053 edges, 267 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1830519 markings, 19486170 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= 2))))
lola: processed formula length: 93
lola: 71 rewrites
lola: closed formula file SharedMemory-COL-000010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20 markings, 19 edges

FORMULA SharedMemory-COL-000010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) OR (1 <= p100) OR ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131)))) AND E (X (((p100 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) AND (2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) OR (1 <= p100) OR ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) OR (1 <= p100) OR ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131))))
lola: processed formula length: 241
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-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 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p100 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) AND (2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p100 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) AND (2 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))
lola: processed formula length: 162
lola: 69 rewrites
lola: closed formula file SharedMemory-COL-000010-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p... (shortened)
lola: processed formula length: 660
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 + 1 <= p100)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 + 1 <= p100)))
lola: processed formula length: 95
lola: 70 rewrites
lola: closed formula file SharedMemory-COL-000010-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: 762231 markings, 2436932 edges, 152446 markings/sec, 0 secs
lola: 1495765 markings, 4798843 edges, 146707 markings/sec, 5 secs
lola: 1801336 markings, 7522315 edges, 61114 markings/sec, 10 secs
lola: 1821508 markings, 10096964 edges, 4034 markings/sec, 15 secs
lola: 1826788 markings, 12665864 edges, 1056 markings/sec, 20 secs
lola: 1829355 markings, 15202463 edges, 513 markings/sec, 25 secs
lola: 1830364 markings, 17751564 edges, 202 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1830519 markings, 19486170 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)
lola: processed formula length: 140
lola: 70 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 <= p100)))
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 ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 <= p100)))
lola: processed formula length: 85
lola: 69 rewrites
lola: closed formula file SharedMemory-COL-000010-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: formula 0: (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p131 <= p100)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SharedMemory-COL-000010-CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.lola:
lola: 10 markings, 9 edges
state equation: calling and running sara
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1745 seconds at most (--localtimelimit=0)
sara: try reading problem file SharedMemory-COL-000010-CTLCardinality-13-0.sara.
lola: ========================================
lola: ...considering subproblem: A (G (A (((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p... (shortened)
lola: processed formula length: 760
lola: 70 rewrites
lola: closed formula file SharedMemory-COL-000010-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2163 markings, 9048 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 68 rewrites
lola: closed formula file SharedMemory-COL-000010-CTLCardinality.task
lola: processed formula with 0 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: ========================================
lola: ...considering subproblem: A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + ... (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: ((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p85 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p84 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52... (shortened)
lola: processed formula length: 745
lola: 70 rewrites
lola: closed formula file SharedMemory-COL-000010-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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SharedMemory-COL-000010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes yes no no no no no yes yes yes
lola:
preliminary result: yes yes no yes no no yes yes no no no no no yes yes yes
lola: memory consumption: 23540 KB
lola: time consumption: 79 seconds

BK_STOP 1527104459229

--------------------
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="SharedMemory-COL-000010"
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/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 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 SharedMemory-COL-000010, 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 r172-smll-152708742800010"
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 ;