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

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

=== Now, execution of the tool begins

BK_START 1527010722070

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ LamportFastMutEx-COL-2 @ 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: 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-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p66 + p67 + p68 <= p21 + p23 + p25 + p26 + p24 + p22)
lola: after: (p66 + p67 + p68 <= 2)
lola: LP says that atomic proposition is always true: (p66 + p67 + p68 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (p21 + p23 + p25 + p26 + p24 + p22 <= p36 + p37 + p38)
lola: after: (2 <= p36 + p37 + p38)
lola: LP says that atomic proposition is always false: (3 <= p66 + p67 + p68)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p48 + p49 + p50)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p30 + p31 + p32 <= p52 + p51 + p53)
lola: after: (p30 + p31 + p32 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p42 + p43 + p44)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p52 + p51 + p53)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= p45 + p46 + p47)
lola: place invariant simplifies atomic proposition
lola: before: (p21 + p23 + p25 + p26 + p24 + p22 <= p36 + p37 + p38)
lola: after: (2 <= p36 + p37 + p38)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p52 + p51 + p53)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p21 + p23 + p25 + p26 + p24 + p22)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p36 + p37 + p38 <= p52 + p51 + p53)
lola: after: (p36 + p37 + p38 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p48 + p49 + p50)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p21 + p23 + p25 + p26 + p24 + p22)
lola: after: (0 <= 1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p21 + p23 + p25 + p26 + p24 + p22 <= p30 + p31 + p32)
lola: after: (2 <= p30 + p31 + p32)
lola: LP says that atomic proposition is always false: (3 <= p66 + p67 + p68)
lola: place invariant simplifies atomic proposition
lola: before: (p18 + p19 + p20 <= p21 + p23 + p25 + p26 + p24 + p22)
lola: after: (p18 + p19 + p20 <= 2)
lola: LP says that atomic proposition is always true: (p18 + p19 + p20 <= 2)
lola: LP says that atomic proposition is always false: (3 <= p42 + p43 + p44)
lola: place invariant simplifies atomic proposition
lola: before: (p21 + p23 + p25 + p26 + p24 + p22 <= p27 + p28 + p29)
lola: after: (2 <= p27 + p28 + p29)
lola: A (F ((1 <= p27 + p28 + p29))) : (NOT(NOT(A (F (TRUE)))) OR (p45 + p46 + p47 + 1 <= p15 + p16 + p17)) : (p36 + p37 + p38 <= 1) : (FALSE AND (E (G (TRUE)) OR E (F (((p30 + p31 + p32 <= 1) OR (p15 + p16 + p17 <= p42 + p43 + p44)))))) : (FALSE OR ((FALSE OR E (X (FALSE))) OR (p66 + p67 + p68 <= p3 + p4 + p5))) : (2 <= p45 + p46 + p47) : NOT(E (F (A (X ((2 <= p36 + p37 + p38)))))) : A (F ((p45 + p46 + p47 <= p42 + p43 + p44))) : ((1 <= p15 + p16 + p17) AND (p27 + p28 + p29 <= p65 + p64 + p63)) : NOT(((((p66 + p67 + p68 + 1 <= p18 + p19 + p20) OR ((p27 + p28 + p29 <= p3 + p4 + p5))) AND E (X ((p39 + p40 + p41 <= p30 + p31 + p32)))) AND E (G (FALSE)))) : E (G (E (F (((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 <= p15 + p16 + p17) OR (p33 + p34 + p35 <= p65 + p64 + p63)))))) : (A ((((p30 + p31 + p32 <= p66 + p67 + p68) OR (p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 <= p3 + p4 + p5)) U ((p36 + p37 + p38 <= 1) AND (p45 + p46 + p47 <= p33 + p34 + p35)))) AND A (F (A (G (FALSE))))) : A (F (((p3 + p4 + p5 <= p18 + p19 + p20)))) : (A (G ((p30 + p31 + p32 <= 1))) AND E (X (((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p45 + p46 + p47) OR ((p0 + p1 + p2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62)))))) : FALSE : NOT(E (F ((2 <= p27 + p28 + p29))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 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: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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-2-CTLCardinality-1 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: (p36 + p37 + p38 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p36 + p37 + p38 <= 1)
lola: processed formula length: 22
lola: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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

FORMULA LamportFastMutEx-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
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: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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-2-CTLCardinality-3 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: (p66 + p67 + p68 <= p3 + p4 + p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p66 + p67 + p68 <= p3 + p4 + p5)
lola: processed formula length: 33
lola: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-4 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: (2 <= p45 + p46 + p47)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p45 + p46 + p47)
lola: processed formula length: 22
lola: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-5 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: ((1 <= p15 + p16 + p17) AND (p27 + p28 + p29 <= p65 + p64 + p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15 + p16 + p17) AND (p27 + p28 + p29 <= p65 + p64 + p63))
lola: processed formula length: 65
lola: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 2 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-2-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 357 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: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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-2-CTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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-2-CTLCardinality-11 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p30 + p31 + p32 <= 1))) AND E (X (((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p45 + p46 + p47) OR ((p0 + p1 + p2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p30 + p31 + p32 <= 1)))
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 ((p30 + p31 + p32 <= 1)))
lola: processed formula length: 30
lola: 43 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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 <= p30 + p31 + p32)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-2-CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 365 markings, 651 edges
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p45 + p46 + p47) OR ((p0 + p1 + p2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: ========================================
lola: processed formula: EX(((p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p45 + p46 + p47) OR ((p0 + p1 + p2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62))))
lola: processed formula length: 150
lola: 42 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p36 + p37 + p38 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p36 + p37 + p38 <= 1)))))
lola: processed formula length: 46
lola: 43 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: 380 markings, 716 edges

lola: ========================================
FORMULA LamportFastMutEx-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p27 + p28 + p29 <= 1)))
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 ((p27 + p28 + p29 <= 1)))
lola: processed formula length: 30
lola: 43 rewrites
lola: closed formula file LamportFastMutEx-COL-2-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: (2 <= p27 + p28 + p29)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-2-CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-15 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 (F ((1 <= p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p27 + p28 + p29 <= 0)
lola: processed formula length: 22
lola: 43 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p3 + p4 + p5 <= p18 + p19 + p20))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p18 + p19 + p20 + 1 <= p3 + p4 + p5))
lola: processed formula length: 39
lola: 43 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p45 + p46 + p47 <= p42 + p43 + p44)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p42 + p43 + p44 + 1 <= p45 + p46 + p47)
lola: processed formula length: 40
lola: 43 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 <= p15 + p16 + p17) OR (p33 + p34 + p35 <= p65 + p64 + p63))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 <= p15 + p16 + p17) OR (p33 + p34 + p35 <= p65 + p64 + p63))
lola: processed formula length: 115
lola: 42 rewrites
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 17 markings, 17 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes no yes yes no yes yes no no
lola:
preliminary result: yes yes yes no yes no yes yes no yes yes no yes yes no no
lola: memory consumption: 20372 KB
lola: time consumption: 0 seconds

BK_STOP 1527010722464

--------------------
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="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-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 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-152666469000059"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;