About the Execution of LoLA for LamportFastMutEx-COL-4
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
829.840 | 107443.00 | 136617.00 | 42.00 | TFTFFFTTTTTTFFTF | 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 212K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-COL-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469000073
=====================================================================
--------------------
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 LamportFastMutEx-COL-4-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-4-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527010958576
info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-4 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 LamportFastMutEx-COL-4 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ LamportFastMutEx-COL-4 @ 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: 365/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 135
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 327 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-4-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 <= p125 + p126 + p127 + p128 + p129)
lola: after: (p0 + p1 + p2 + p3 + p4 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p130 + p131 + p132 + p133 + p134)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p125 + p126 + p127 + p128 + p129)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p130 + p131 + p132 + p133 + p134)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89 <= p55 + p56 + p57 + p58 + p59)
lola: after: (4 <= p55 + p56 + p57 + p58 + p59)
lola: place invariant simplifies atomic proposition
lola: before: (p120 + p121 + p122 + p123 + p124 <= p125 + p126 + p127 + p128 + p129)
lola: after: (p120 + p121 + p122 + p123 + p124 <= 1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p125 + p126 + p127 + p128 + p129 <= p64 + p63 + p60 + p61 + p62)
lola: after: (1 <= p64 + p63 + p60 + p61 + p62)
lola: place invariant simplifies atomic proposition
lola: before: (p125 + p126 + p127 + p128 + p129 <= p74 + p73 + p72 + p71 + p70)
lola: after: (1 <= p74 + p73 + p72 + p71 + p70)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89 <= p130 + p131 + p132 + p133 + p134)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p55 + p56 + p57 + p58 + p59 <= p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89)
lola: after: (p55 + p56 + p57 + p58 + p59 <= 4)
lola: LP says that atomic proposition is always true: (p55 + p56 + p57 + p58 + p59 <= 4)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89)
lola: after: (0 <= 1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89 <= p20 + p21 + p22 + p23 + p24 + p26 + p31 + p36 + p41 + p44 + p43 + p42 + p40 + p39 + p38 + p37 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p25)
lola: after: (4 <= p20 + p21 + p22 + p23 + p24 + p26 + p31 + p36 + p41 + p44 + p43 + p42 + p40 + p39 + p38 + p37 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p25)
lola: place invariant simplifies atomic proposition
lola: before: (p50 + p51 + p52 + p53 + p54 <= p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89)
lola: after: (p50 + p51 + p52 + p53 + p54 <= 4)
lola: LP says that atomic proposition is always true: (p50 + p51 + p52 + p53 + p54 <= 4)
lola: place invariant simplifies atomic proposition
lola: before: (p125 + p126 + p127 + p128 + p129 <= p15 + p16 + p17 + p18 + p19)
lola: after: (1 <= p15 + p16 + p17 + p18 + p19)
lola: place invariant simplifies atomic proposition
lola: before: (p130 + p131 + p132 + p133 + p134 <= p50 + p51 + p52 + p53 + p54)
lola: after: (1 <= p50 + p51 + p52 + p53 + p54)
lola: place invariant simplifies atomic proposition
lola: before: (p125 + p126 + p127 + p128 + p129 <= p15 + p16 + p17 + p18 + p19)
lola: after: (1 <= p15 + p16 + p17 + p18 + p19)
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89 <= p74 + p73 + p72 + p71 + p70)
lola: after: (4 <= p74 + p73 + p72 + p71 + p70)
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p86 + p84 + p82 + p80 + p81 + p83 + p85 + p87 + p89 <= p45 + p46 + p47 + p48 + p49)
lola: after: (4 <= p45 + p46 + p47 + p48 + p49)
lola: NOT(NOT(A (((p0 + p1 + p2 + p3 + p4 <= 1) U (1 <= p0 + p1 + p2 + p3 + p4))))) : E (F (A (G ((p5 + p6 + p7 + p8 + p9 <= 0))))) : (NOT(A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99 <= p74 + p73 + p72 + p71 + p70))))) AND NOT(A (F (())))) : (NOT(E (((2 <= p74 + p73 + p72 + p71 + p70) U (p10 + p11 + p12 + p13 + p14 <= p55 + p56 + p57 + p58 + p59)))) OR E (F (((4 <= p55 + p56 + p57 + p58 + p59) AND ((p120 + p121 + p122 + p123 + p124 <= 1) OR (p50 + p51 + p52 + p53 + p54 <= p5 + p6 + p7 + p8 + p9)))))) : E (F (A (F (FALSE)))) : NOT(E (F ((3 <= p90 + p91 + p92 + p93 + p94)))) : NOT(E (F (A (G ((1 <= p64 + p63 + p60 + p61 + p62)))))) : (E (F (A (X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99))))) OR NOT(((p74 + p73 + p72 + p71 + p70 <= 0) AND A (G (TRUE))))) : A (G (NOT(E (F (FALSE))))) : (E (F ((3 <= p45 + p46 + p47 + p48 + p49))) OR A (G (()))) : A (G (E (F (((p0 + p1 + p2 + p3 + p4 <= p74 + p73 + p72 + p71 + p70) AND (2 <= p120 + p121 + p122 + p123 + p124)))))) : E (F (A (G (())))) : (A (G (((p45 + p46 + p47 + p48 + p49 <= 1) OR (p15 + p16 + p17 + p18 + p19 <= 0)))) AND ((p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9) OR A (X (((1 <= p50 + p51 + p52 + p53 + p54) OR (1 <= p15 + p16 + p17 + p18 + p19)))))) : (((p90 + p91 + p92 + p93 + p94 <= p5 + p6 + p7 + p8 + p9) AND E (F (((1 <= p0 + p1 + p2 + p3 + p4) AND (4 <= p74 + p73 + p72 + p71 + p70))))) OR NOT(E (X ((p20 + p21 + p22 + p23 + p24 + p26 + p31 + p36 + p41 + p44 + p43 + p42 + p40 + p39 + p38 + p37 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p25 <= 1))))) : NOT(A (G (E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99 <= p90 + p91 + p92 + p93 + p94)))))) : E (F ((E (F ((4 <= p45 + p46 + p47 + p48 + p49))) AND ((p90 + p91 + p92 + p93 + p94 <= p10 + p11 + p12 + p13 + p14) AND (p64 + p63 + p60 + p61 + p62 <= p69 + p68 + p67 + p66 + p65)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:121
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:458
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 60 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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 LamportFastMutEx-COL-4-CTLCardinality-4 FALSE 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: 60 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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 LamportFastMutEx-COL-4-CTLCardinality-8 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: 60 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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 LamportFastMutEx-COL-4-CTLCardinality-11 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: (E (F (A (X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99))))) OR (1 <= p74 + p73 + p72 + p71 + p70))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p74 + p73 + p72 + p71 + p70)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p74 + p73 + p72 + p71 + p70)
lola: processed formula length: 34
lola: 60 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99)))))
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((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99)))
lola: processed formula length: 188
lola: 62 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: 1037 markings, 1395 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA LamportFastMutEx-COL-4-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: (A (G (((p45 + p46 + p47 + p48 + p49 <= 1) OR (p15 + p16 + p17 + p18 + p19 <= 0)))) AND ((p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9) OR A (X (((1 <= p50 + p51 + p52 + p53 + p54) OR (1 <= p15 + p16 + p17 + p18 + p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + p16 + p17 + p18 + p19 + 1 <= p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 59
lola: 60 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p45 + p46 + p47 + p48 + p49 <= 1) OR (p15 + p16 + p17 + p18 + p19 <= 0))))
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 (((p45 + p46 + p47 + p48 + p49 <= 1) OR (p15 + p16 + p17 + p18 + p19 <= 0))))
lola: processed formula length: 83
lola: 62 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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:694
lola: formula 0: ((2 <= p45 + p46 + p47 + p48 + p49) AND (1 <= p15 + p16 + p17 + p18 + p19))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 566 markings, 937 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-12 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: (((p90 + p91 + p92 + p93 + p94 <= p5 + p6 + p7 + p8 + p9) AND E (F (((1 <= p0 + p1 + p2 + p3 + p4) AND (4 <= p74 + p73 + p72 + p71 + p70))))) OR A (X ((2 <= p20 + p21 + p22 + p23 + p24 + p26 + p31 + p36 + p41 + p44 + p43 + p42 + p40 + p39 + p38 + p37 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p25))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p90 + p91 + p92 + p93 + p94 <= p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p90 + p91 + p92 + p93 + p94 <= p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 55
lola: 60 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0 + p1 + p2 + p3 + p4) AND (4 <= p74 + p73 + p72 + p71 + p70))))
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 (((1 <= p0 + p1 + p2 + p3 + p4) AND (4 <= p74 + p73 + p72 + p71 + p70))))
lola: processed formula length: 78
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: ((1 <= p0 + p1 + p2 + p3 + p4) AND (4 <= p74 + p73 + p72 + p71 + p70))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p20 + p21 + p22 + p23 + p24 + p26 + p31 + p36 + p41 + p44 + p43 + p42 + p40 + p39 + p38 + p37 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((2 <= p20 + p21 + p22 + p23 + p24 + p26 + p31 + p36 + p41 + p44 + p43 + p42 + p40 + p39 + p38 + p37 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p25))
lola: processed formula length: 158
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-13 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: E (F ((3 <= p45 + p46 + p47 + p48 + p49)))
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 ((3 <= p45 + p46 + p47 + p48 + p49)))
lola: processed formula length: 42
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: (3 <= p45 + p46 + p47 + p48 + p49)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1055 markings, 1772 edges
FORMULA LamportFastMutEx-COL-4-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p90 + p91 + p92 + p93 + p94 <= 2)))
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 ((p90 + p91 + p92 + p93 + p94 <= 2)))
lola: processed formula length: 42
lola: 62 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: (3 <= p90 + p91 + p92 + p93 + p94)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5977 markings, 10769 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-5 FALSE 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 (((p74 + p73 + p72 + p71 + p70 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99))))
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 (((p74 + p73 + p72 + p71 + p70 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99))))
lola: processed formula length: 214
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: ((p74 + p73 + p72 + p71 + p70 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p90 + p91 + p92 + p93 + p94 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99)))
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 ((p90 + p91 + p92 + p93 + p94 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99)))
lola: processed formula length: 212
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: (p90 + p91 + p92 + p93 + p94 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p95 + p96 + p97 + p98 + p99)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-9-0.sara.
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p64 + p63 + p60 + p61 + p62 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p64 + p63 + p60 + p61 + p62 <= 0)
lola: processed formula length: 34
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
sara: place or transition ordering is non-deterministic
lola: 814821 markings, 3377607 edges, 162964 markings/sec, 0 secs
lola: 1460742 markings, 6609124 edges, 129184 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1902312 markings, 8830370 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p5 + p6 + p7 + p8 + p9 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (1 <= p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 29
lola: 62 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 632861 markings, 1968011 edges, 126572 markings/sec, 0 secs
lola: 1133330 markings, 4249610 edges, 100094 markings/sec, 5 secs
lola: 1603871 markings, 6490784 edges, 94108 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 1899640 markings, 8519411 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p0 + p1 + p2 + p3 + p4 <= p74 + p73 + p72 + p71 + p70) AND (2 <= p120 + p121 + p122 + p123 + p124))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 <= p74 + p73 + p72 + p71 + p70) AND (2 <= p120 + p121 + p122 + p123 + p124))
lola: processed formula length: 101
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 542343 markings, 1720615 edges, 108469 markings/sec, 0 secs
lola: 1014818 markings, 3891397 edges, 94495 markings/sec, 5 secs
lola: 1477571 markings, 6152748 edges, 92551 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1830753 markings, 7874735 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((4 <= p45 + p46 + p47 + p48 + p49))) AND ((p90 + p91 + p92 + p93 + p94 <= p10 + p11 + p12 + p13 + p14) AND (p64 + p63 + p60 + p61 + p62 <= p69 + p68 + p67 + p66 + p65)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (E(TRUE U (4 <= p45 + p46 + p47 + p48 + p49)) AND ((p90 + p91 + p92 + p93 + p94 <= p10 + p11 + p12 + p13 + p14) AND (p64 + p63 + p60 + p61 + p62 <= p69 + p68 + p67 + p66 + p65))))
lola: processed formula length: 188
lola: 62 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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).
lola: 917718 markings, 3920510 edges, 183544 markings/sec, 0 secs
lola: 1738543 markings, 7859676 edges, 164165 markings/sec, 5 secs
lola: 1914784 markings, 11755635 edges, 35248 markings/sec, 10 secs
lola: 1914784 markings, 15882465 edges, 0 markings/sec, 15 secs
lola: 1914784 markings, 19434722 edges, 0 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1914784 markings, 20006880 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-15 FALSE 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)
lola: ========================================
lola: ...considering subproblem: A (((p0 + p1 + p2 + p3 + p4 <= 1) U (1 <= p0 + p1 + p2 + p3 + p4)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((p0 + p1 + p2 + p3 + p4 <= 1) U (1 <= p0 + p1 + p2 + p3 + p4)))
lola: processed formula length: 67
lola: 64 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 338907 markings, 1356478 edges, 67781 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 352534 markings, 1404941 edges
FORMULA LamportFastMutEx-COL-4-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p74 + p73 + p72 + p71 + p70 <= 1) R (p55 + p56 + p57 + p58 + p59 + 1 <= p10 + p11 + p12 + p13 + p14))) OR E (F (((4 <= p55 + p56 + p57 + p58 + p59) AND ((p120 + p121 + p122 + p123 + p124 <= 1) OR (p50 + p51 + p52 + p53 + p54 <= p5 + p6 + p7 + p8 + p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p74 + p73 + p72 + p71 + p70 <= 1) R (p55 + p56 + p57 + p58 + p59 + 1 <= p10 + p11 + p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((p74 + p73 + p72 + p71 + p70 <= 1) R (p55 + p56 + p57 + p58 + p59 + 1 <= p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 107
lola: 66 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
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 (((p74 + p73 + p72 + p71 + p70 <= 1) R (p55 + p56 + p57 + p58 + p59 + 1 <= p10 + p11 + p12 + p13 + p14))) OR E (F (((4 <= p55 + p56 + p57 + p58 + p59) AND ((p120 + p121 + p122 + p123 + p124 <= 1) OR (p50 + p51 + p52 + p53 + p54 <= p5 + p6 + p7 + p8 + p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((p74 + p73 + p72 + p71 + p70 <= 1) R (p55 + p56 + p57 + p58 + p59 + 1 <= p10 + p11 + p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((p74 + p73 + p72 + p71 + p70 <= 1) R (p55 + p56 + p57 + p58 + p59 + 1 <= p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 107
lola: 66 rewrites
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((4 <= p55 + p56 + p57 + p58 + p59) AND ((p120 + p121 + p122 + p123 + p124 <= 1) OR (p50 + p51 + p52 + p53 + p54 <= p5 + p6 + p7 + p8 + p9)))))
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 (((4 <= p55 + p56 + p57 + p58 + p59) AND ((p120 + p121 + p122 + p123 + p124 <= 1) OR (p50 + p51 + p52 + p53 + p54 <= p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 150
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-COL-4-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: ((4 <= p55 + p56 + p57 + p58 + p59) AND ((p120 + p121 + p122 + p123 + p124 <= 1) OR (p50 + p51 + p52 + p53 + p54 <= p5 + p6 + p7 + p8 + p9)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 447727 markings, 1152040 edges, 89545 markings/sec, 0 secs
lola: sara is running 5 secs || 897626 markings, 2715458 edges, 89980 markings/sec, 5 secs
lola: sara is running 10 secs || 1362674 markings, 4718420 edges, 93010 markings/sec, 10 secs
lola: sara is running 15 secs || 1797845 markings, 6628457 edges, 87034 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1858930 markings, 8027945 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA LamportFastMutEx-COL-4-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes yes yes yes yes yes no no yes no
lola:
preliminary result: yes no yes no no no yes yes yes yes yes yes no no yes no
lola: memory consumption: 20160 KB
lola: time consumption: 108 seconds
BK_STOP 1527011066019
--------------------
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="LamportFastMutEx-COL-4"
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/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 LamportFastMutEx-COL-4, 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 r112-csrt-152666469000073"
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 '
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 ;