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 196K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 38K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-COL-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469000061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010727688

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-2 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-2 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-2 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 69
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-2-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p24 + p25 + p26)
lola: place invariant simplifies atomic proposition
lola: before: (p58 + p56 + p54 + p55 + p57 + p59 <= p48 + p49 + p50)
lola: after: (2 <= p48 + p49 + p50)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p3 + p4 + p5)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p3 + p4 + p5)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p44 + p43 + p42)
lola: LP says that atomic proposition is always false: (3 <= p66 + p67 + p68)
lola: place invariant simplifies atomic proposition
lola: before: (p9 + p10 + p11 <= p58 + p56 + p54 + p55 + p57 + p59)
lola: after: (p9 + p10 + p11 <= 2)
lola: LP says that atomic proposition is always true: (p9 + p10 + p11 <= 2)
lola: LP says that atomic proposition is always false: (3 <= p30 + p31 + p32)
lola: place invariant simplifies atomic proposition
lola: before: (p64 + p63 + p65 <= p12 + p13 + p14)
lola: after: (1 <= p12 + p13 + p14)
lola: place invariant simplifies atomic proposition
lola: before: (p64 + p63 + p65 <= p62 + p61 + p60)
lola: after: (1 <= p62 + p61 + p60)
lola: place invariant simplifies atomic proposition
lola: before: (p64 + p63 + p65 <= p44 + p43 + p42)
lola: after: (1 <= p44 + p43 + p42)
lola: place invariant simplifies atomic proposition
lola: before: (p12 + p13 + p14 <= p3 + p4 + p5)
lola: after: (p12 + p13 + p14 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p64 + p63 + p65)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 <= p58 + p56 + p54 + p55 + p57 + p59)
lola: after: (p0 + p1 + p2 <= 2)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 <= 2)
lola: LP says that atomic proposition is always false: (3 <= p45 + p46 + p47)
lola: E (F ((p45 + p46 + p47 + 1 <= p0 + p1 + p2))) : E (F ((1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33))) : A (G (((p66 + p67 + p68 + 1 <= p24 + p25 + p26) AND ((2 <= p48 + p49 + p50) OR (2 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)) AND ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR ((p0 + p1 + p2 <= p24 + p25 + p26) AND (2 <= p27 + p28 + p29)))))) : A (G ((p12 + p13 + p14 <= p53 + p52 + p51))) : E (F (TRUE)) : E (F (((p62 + p61 + p60 + 1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33) AND (p30 + p31 + p32 + 1 <= p66 + p67 + p68) AND (p62 + p61 + p60 <= 0) AND (p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 0)))) : A (G (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p24 + p25 + p26)))) : E (F (())) : E (F (((p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND (p27 + p28 + p29 <= p9 + p10 + p11) AND (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p6 + p7 + p8)))) : A (G ((1 <= p45 + p46 + p47))) : E (F (TRUE)) : A (G (((1 <= p12 + p13 + p14) AND ((p62 + p61 + p60 <= 0) OR (p44 + p43 + p42 <= 0))))) : E (F (((p24 + p25 + p26 <= 1) AND (2 <= p12 + p13 + p14) AND (2 <= p66 + p67 + p68)))) : A (G (((p0 + p1 + p2 + 1 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR (2 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)))) : E (F (TRUE)) : E (F (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: 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: 15 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-7 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: 15 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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-2-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-14 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-15 TRUE 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: A (G ((1 <= p45 + p46 + p47)))
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 ((1 <= p45 + p46 + p47)))
lola: processed formula length: 30
lola: 17 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: (p45 + p46 + p47 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p45 + p46 + p47 + 1 <= p0 + p1 + p2)))
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 ((p45 + p46 + p47 + 1 <= p0 + p1 + p2)))
lola: processed formula length: 45
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: (p45 + p46 + p47 + 1 <= p0 + p1 + p2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-6-0.sara
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-0 TRUE 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 ((p12 + p13 + p14 <= p53 + p52 + p51)))
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 ((p12 + p13 + p14 <= p53 + p52 + p51)))
lola: processed formula length: 44
lola: 17 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: (p53 + p52 + p51 + 1 <= p12 + p13 + p14)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 16 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-7-0.sara
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p24 + p25 + p26 <= 1) AND (2 <= p12 + p13 + p14) AND (2 <= p66 + p67 + p68))))
lola: ========================================
lola: SUBTASK
sara: lola: checking reachability
try reading problem file LamportFastMutEx-COL-2-ReachabilityCardinality-7-0.sara.
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p24 + p25 + p26 <= 1) AND (2 <= p12 + p13 + p14) AND (2 <= p66 + p67 + p68))))
lola: processed formula length: 86
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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)
sara: lola: RUNNING
place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p24 + p25 + p26 <= 1) AND (2 <= p12 + p13 + p14) AND (2 <= p66 + p67 + p68))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 364 markings, 661 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-12 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 ((1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)))
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 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)))
lola: processed formula length: 66
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-2-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 17 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-1 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 (((1 <= p12 + p13 + p14) AND ((p62 + p61 + p60 <= 0) OR (p44 + p43 + p42 <= 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 (((1 <= p12 + p13 + p14) AND ((p62 + p61 + p60 <= 0) OR (p44 + p43 + p42 <= 0)))))
lola: processed formula length: 88
lola: 17 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: formula 0: ((p12 + p13 + p14 <= 0) OR ((1 <= p62 + p61 + p60) AND (1 <= p44 + p43 + p42)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: 0 markings, 0 edges
lola:
FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-10-0.sara
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p24 + p25 + p26))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p24 + p25 + p26))))
lola: processed formula length: 145
lola: 17 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: ((p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 2) AND (p24 + p25 + p26 + 1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-11-0.sara
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + 1 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR (2 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33))))
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 (((p0 + p1 + p2 + 1 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR (2 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33))))
lola: processed formula length: 146
lola: 17 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= p0 + p1 + p2) AND (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-12-0.sara
FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p62 + p61 + p60 + 1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33) AND (p30 + p31 + p32 + 1 <= p66 + p67 + p68) AND (p62 + p61 + p60 <= 0) AND (p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 0))))
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 (((p62 + p61 + p60 + 1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33) AND (p30 + p31 + p32 + 1 <= p66 + p67 + p68) AND (p62 + p61 + p60 <= 0) AND (p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 0))))
lola: processed formula length: 221
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: ((p62 + p61 + p60 + 1 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33) AND (p30 + p31 + p32 + 1 <= p66 + p67 + p68) AND (p62 + p61 + p60 <= 0) AND (p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-13-0.sara
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND (p27 + p28 + p29 <= p9 + p10 + p11) AND (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p6 + p7 + p8))))
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 (((p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND (p27 + p28 + p29 <= p9 + p10 + p11) AND (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p6 + p7 + p8))))
lola: processed formula length: 196
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p12 + p13 + p14 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND (p27 + p28 + p29 <= p9 + p10 + p11) AND (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= p6 + p7 + p8))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-14-0.sara
FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p66 + p67 + p68 + 1 <= p24 + p25 + p26) AND ((2 <= p48 + p49 + p50) OR (2 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)) AND ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR ((p0 + p1 + p2 <= p24 + p25 + p26) AND (2 <= p27 + p28 + p29))))))
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 (((p66 + p67 + p68 + 1 <= p24 + p25 + p26) AND ((2 <= p48 + p49 + p50) OR (2 <= p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33)) AND ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) OR ((p0 + p1 + p2 <= p24 + p25 + p26) AND (2 <= p27 + p28 + p29))))))
lola: processed formula length: 274
lola: 17 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: ((p24 + p25 + p26 <= p66 + p67 + p68) OR ((p48 + p49 + p50 <= 1) AND (p34 + p37 + p40 + p41 + p39 + p38 + p36 + p35 + p33 <= 1)) OR ((p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 <= 1) AND ((p24 + p25 + p26 + 1 <= p0 + p1 + p2) OR (p27 + p28 + p29 <= 1))))
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-2-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no yes yes no yes no no no yes yes
lola:
preliminary result: yes yes no no yes yes no yes yes no yes no no no yes yes

lola: memory consumption: 21544 KB
lola: time consumption: 0 seconds

BK_STOP 1527012337910

--------------------
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-2"
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-2.tgz
mv LamportFastMutEx-COL-2 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-2, 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-152666469000061"
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 ;