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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469000075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527011154165

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 ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ 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-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p30 + p31 + p32 + p33 + p34)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p2 + p4 + p6 + p8 + p9 + p7 + p5 + p3 + p1 <= p40 + p41 + p42 + p43 + p44)
lola: after: (4 <= p40 + p41 + p42 + p43 + p44)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p75 + p76 + p77 + p78 + p79 <= p30 + p31 + p32 + p33 + p34)
lola: after: (p75 + p76 + p77 + p78 + p79 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p2 + p4 + p6 + p8 + p9 + p7 + p5 + p3 + p1)
lola: after: (0 <= 2)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p68 + p67 + p66 + p65 + p69 <= p30 + p31 + p32 + p33 + p34)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p55 + p56 + p57 + p58 + p59 <= p0 + p2 + p4 + p6 + p8 + p9 + p7 + p5 + p3 + p1)
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: (2 <= p68 + p67 + p66 + p65 + p69)
lola: after: (1 <= 0)
lola: always false
lola: always true
lola: A (G ((((p73 + p72 + p71 + p70 + p74 <= p45 + p46 + p47 + p48 + p49) OR (p50 + p51 + p52 + p53 + p54 <= p40 + p41 + p42 + p43 + p44) OR (p45 + p46 + p47 + p48 + p49 <= p55 + p56 + p57 + p58 + p59))))) : E (F (((((2 <= p64 + p63 + p60 + p61 + p62) AND (1 <= p25 + p26 + p27 + p28 + p29)) OR ((1 <= p45 + p46 + p47 + p48 + p49) AND (1 <= p10 + p11 + p12 + p13 + p14))) AND ((3 <= p10 + p11 + p12 + p13 + p14) OR (4 <= p40 + p41 + p42 + p43 + p44))))) : E (F (((1 <= p50 + p51 + p52 + p53 + p54) AND (p35 + p36 + p37 + p38 + p39 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p20 + p21 + p22 + p23 + p24) OR (3 <= p10 + p11 + p12 + p13 + p14)) AND (p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p25 + p26 + p27 + p28 + p29 <= 2)))) : E (F ((3 <= p105 + p106 + p107 + p108 + p109))) : E (F (((p73 + p72 + p71 + p70 + p74 <= 2) AND (p35 + p36 + p37 + p38 + p39 <= 0) AND ((p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p10 + p11 + p12 + p13 + p14))))) : A (G (TRUE)) : E (F (((2 <= p35 + p36 + p37 + p38 + p39) AND (3 <= p20 + p21 + p22 + p23 + p24)))) : A (G ((p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14))) : A (G (((p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p50 + p51 + p52 + p53 + p54) AND ((p35 + p36 + p37 + p38 + p39 + 1 <= p64 + p63 + p60 + p61 + p62) OR (p55 + p56 + p57 + p58 + p59 <= 2))))) : E (F (((p20 + p21 + p22 + p23 + p24 <= p105 + p106 + p107 + p108 + p109) AND (3 <= p25 + p26 + p27 + p28 + p29) AND (1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) AND (2 <= p75 + p76 + p77 + p78 + p79)))) : A (G (((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) OR (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130 <= p105 + p106 + p107 + p108 + p109) OR ((2 <= p20 + p21 + p22 + p23 + p24) AND (3 <= p20 + p21 + p22 + p23 + p24)) OR (((3 <= p10 + p11 + p12 + p13 + p14) OR (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130 <= p55 + p56 + p57 + p58 + p59)) AND (p73 + p72 + p71 + p70 + p74 <= p45 + p46 + p47 + p48 + p49))))) : E (F (())) : E (F (())) : E (F (())) : A (G (((p15 + p16 + p17 + p18 + p19 <= 2) AND ((1 <= p50 + p51 + p52 + p53 + p54) OR (p75 + p76 + p77 + p78 + p79 <= 2))))) : E (F (((3 <= p50 + p51 + p52 + p53 + p54) AND (p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24) AND ((2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p75 + p76 + p77 + p78 + p79)) AND (p20 + p21 + p22 + p23 + p24 <= p40 + p41 + p42 + p43 + p44))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 12 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 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: 12 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 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: 12 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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-ReachabilityCardinality-12 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ========================================
lola: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-13 FALSE 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: E (F ((3 <= p105 + p106 + p107 + p108 + p109)))
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 <= p105 + p106 + p107 + p108 + p109)))
lola: processed formula length: 47
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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 <= p105 + p106 + p107 + p108 + p109)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 14 markings, 13 edges

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14)))
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 ((p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 68
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: (p10 + p11 + p12 + p13 + p14 + 1 <= p15 + p16 + p17 + p18 + p19)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-4-0.sara.
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-5-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-7 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 (((2 <= p35 + p36 + p37 + p38 + p39) AND (3 <= p20 + p21 + p22 + p23 + p24))))
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 (((2 <= p35 + p36 + p37 + p38 + p39) AND (3 <= p20 + p21 + p22 + p23 + p24))))
lola: processed formula length: 83
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ((2 <= p35 + p36 + p37 + p38 + p39) AND (3 <= p20 + p21 + p22 + p23 + p24))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-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: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-6 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: A (G (((p15 + p16 + p17 + p18 + p19 <= 2) AND ((1 <= p50 + p51 + p52 + p53 + p54) OR (p75 + p76 + p77 + p78 + p79 <= 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:694
lola: processed formula: A (G (((p15 + p16 + p17 + p18 + p19 <= 2) AND ((1 <= p50 + p51 + p52 + p53 + p54) OR (p75 + p76 + p77 + p78 + p79 <= 2)))))
lola: processed formula length: 124
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ((3 <= p15 + p16 + p17 + p18 + p19) OR ((p50 + p51 + p52 + p53 + p54 <= 0) AND (3 <= p75 + p76 + p77 + p78 + p79)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-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: 10051 markings, 17118 edges

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-14 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: A (G ((((p73 + p72 + p71 + p70 + p74 <= p45 + p46 + p47 + p48 + p49) OR (p50 + p51 + p52 + p53 + p54 <= p40 + p41 + p42 + p43 + p44) OR (p45 + p46 + p47 + p48 + p49 <= p55 + p56 + p57 + p58 + p59)))))
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 ((((p73 + p72 + p71 + p70 + p74 <= p45 + p46 + p47 + p48 + p49) OR (p50 + p51 + p52 + p53 + p54 <= p40 + p41 + p42 + p43 + p44) OR (p45 + p46 + p47 + p48 + p49 <= p55 + p56 + p57 + p58 + p59)))))
lola: processed formula length: 202
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: lola: ========================================
rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p45 + p46 + p47 + p48 + p49 + 1 <= p73 + p72 + p71 + p70 + p74) AND (p40 + p41 + p42 + p43 + p44 + 1 <= p50 + p51 + p52 + p53 + p54) AND (p55 + p56 + p57 + p58 + p59 + 1 <= p45 + p46 + p47 + p48 + p49)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((2 <= p64 + p63 + p60 + p61 + p62) AND (1 <= p25 + p26 + p27 + p28 + p29)) OR ((1 <= p45 + p46 + p47 + p48 + p49) AND (1 <= p10 + p11 + p12 + p13 + p14))) AND ((3 <= p10 + p11 + p12 + p13 + p14) OR (4 <= p40 + p41 + p42 + p43 + p44)))))
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 (((((2 <= p64 + p63 + p60 + p61 + p62) AND (1 <= p25 + p26 + p27 + p28 + p29)) OR ((1 <= p45 + p46 + p47 + p48 + p49) AND (1 <= p10 + p11 + p12 + p13 + p14))) AND ((3 <= p10 + p11 + p12 + p13 + p14) OR (4 <= p40 + p41 + p42 + p43 + p44)))))
lola: processed formula length: 247
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ((((2 <= p64 + p63 + p60 + p61 + p62) AND (1 <= p25 + p26 + p27 + p28 + p29)) OR ((1 <= p45 + p46 + p47 + p48 + p49) AND (1 <= p10 + p11 + p12 + p13 + p14))) AND ((3 <= p10 + p11 + p12 + p13 + p14) OR (4 <= p40 + p41 + p42 + p43 + p44)))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42622 markings, 58189 edges

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p50 + p51 + p52 + p53 + p54) AND (p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24) AND ((2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p75 + p76 + p77 + p78 + p79)) AND (p20 + p21 + p22 + p23 + p24 <= p40 + p41 + p42 + p43 + p44))))
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 <= p50 + p51 + p52 + p53 + p54) AND (p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24) AND ((2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p75 + p76 + p77 + p78 + p79)) AND (p20 + p21 + p22 + p23 + p24 <= p40 + p41 + p42 + p43 + p44))))
lola: processed formula length: 254
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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 <= p50 + p51 + p52 + p53 + p54) AND (p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24) AND ((2 <= p20 + p21 + p22 + p23 + p24) OR (1 <= p75 + p76 + p77 + p78 + p79)) AND (p20 + p21 + p22 + p23 + p24 <= p40 + p41 + p42 + p43 + p44))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 583670 markings, 1483359 edges, 116734 markings/sec, 0 secs
lola: sara is running 5 secs || 1096880 markings, 3761505 edges, 102642 markings/sec, 5 secs
lola: sara is running 10 secs || 1649853 markings, 5635209 edges, 110595 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1827899 markings, 7243687 edges

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + p21 + p22 + p23 + p24 <= p105 + p106 + p107 + p108 + p109) AND (3 <= p25 + p26 + p27 + p28 + p29) AND (1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) AND (2 <= p75 + p76 + p77 + p78 + p79))))
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 (((p20 + p21 + p22 + p23 + p24 <= p105 + p106 + p107 + p108 + p109) AND (3 <= p25 + p26 + p27 + p28 + p29) AND (1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) AND (2 <= p75 + p76 + p77 + p78 + p79))))
lola: processed formula length: 337
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ((p20 + p21 + p22 + p23 + p24 <= p105 + p106 + p107 + p108 + p109) AND (3 <= p25 + p26 + p27 + p28 + p29) AND (1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) AND (2 <= p75 + p76 + p77 + p78 + p79))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-11-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.

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p73 + p72 + p71 + p70 + p74 <= 2) AND (p35 + p36 + p37 + p38 + p39 <= 0) AND ((p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p10 + p11 + p12 + p13 + p14)))))
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 (((p73 + p72 + p71 + p70 + p74 <= 2) AND (p35 + p36 + p37 + p38 + p39 <= 0) AND ((p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (2 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula length: 323
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p50 + p51 + p52 + p53 + p54) AND ((p35 + p36 + p37 + p38 + p39 + 1 <= p64 + p63 + p60 + p61 + p62) OR (p55 + p56 + p57 + p58 + p59 <= 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:694
lola: processed formula: A (G (((p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p50 + p51 + p52 + p53 + p54) AND ((p35 + p36 + p37 + p38 + p39 + 1 <= p64 + p63 + p60 + p61 + p62) OR (p55 + p56 + p57 + p58 + p59 <= 2)))))
lola: processed formula length: 305
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ((p50 + p51 + p52 + p53 + p54 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR ((p64 + p63 + p60 + p61 + p62 <= p35 + p36 + p37 + p38 + p39) AND (3 <= p55 + p56 + p57 + p58 + p59)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-13-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) OR (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130 <= p105 + p106 + p107 + p108 + p109... (shortened)
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 (((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) OR (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130 <= p105 + p106 + p107 + p108 + p109... (shortened)
lola: processed formula length: 802
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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: ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130 <= 1) AND (p105 + p106 + p107 + p108 + p109 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130) AND ((p20 + p21 + p22 + p23 + p24 <= 1) OR (p20 + p21 + p22 + p23 + p24 <= 2)) AND (((p10 + p11 + p12 + p13 + p14 <= 2) AND (p55 + p56 + p57 + p58 + p59 + 1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p131 + p134 + p133 + p132 + p130)) OR (p45 + p46 + p47 + p48 + p49 + 1 <= p73 + p72 + p71 + p70 + p74)))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 480 markings, 593 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p50 + p51 + p52 + p53 + p54) AND (p35 + p36 + p37 + p38 + p39 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p20 + p21 + p22 + p23 + p24) OR (3 <= p10 + p11 + p12 + p13 + p14)) AND (p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p25 + p26... (shortened)
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 <= p50 + p51 + p52 + p53 + p54) AND (p35 + p36 + p37 + p38 + p39 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p20 + p21 + p22 + p23 + p24) OR (3 <= p10 + p11 + p12 + p13 + p14)) AND (p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p25 + p26... (shortened)
lola: processed formula length: 427
lola: 13 rewrites
lola: closed formula file LamportFastMutEx-COL-4-ReachabilityCardinality.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 <= p50 + p51 + p52 + p53 + p54) AND (p35 + p36 + p37 + p38 + p39 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p20 + p21 + p22 + p23 + p24) OR (3 <= p10 + p11 + p12 + p13 + p14)) AND (p105 + p106 + p107 + p108 + p109 + 1 <= p100 + p101 + p102 + p103 + p104 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND (p25 + p26 + p27 + p28 + p29 <= 2))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-4-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2783 markings, 4798 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no no no no no no no no no no
lola:
preliminary result: no yes yes yes yes yes no no no no no no no no no no
lola: memory consumption: 25728 KB
lola: time consumption: 20 seconds

BK_STOP 1527011174045

--------------------
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-152666469000075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;