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 216K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 15K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-COL-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500432
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527034659250

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-01 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-01 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ PermAdmissibility-COL-01 @ 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: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-01-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)
lola: LP says that atomic proposition is always false: (3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)
lola: LP says that atomic proposition is always false: (2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59)
lola: LP says that atomic proposition is always false: (3 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)
lola: LP says that atomic proposition is always false: (3 <= p93)
lola: LP says that atomic proposition is always false: (2 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p76)
lola: LP says that atomic proposition is always false: (3 <= p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: always true
lola: A (G (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p10) OR (p10 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59)))) : A (G ((((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (p199 + 1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)) OR (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 0)))) : A (G (())) : A (G ((p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92 <= p9))) : A (G (((p194 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)))) : A (G (())) : E (F ((p10 + 1 <= p192))) : E (F (((((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (1 <= p195))) AND (((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (1 <= p102)) OR (p199 <= 0))))) : E (F (FALSE)) : E (F ((1 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))) : E (F (FALSE)) : E (F (((p151 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p10 + 1 <= p195) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) AND (p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142)))) : A (G ((p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92))) : A (G ((p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= p197))) : A (G (((p197 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) OR (p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p8)))) : E (F (()))
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: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 221 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 PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 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 PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 253 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: 15 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 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: 15 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 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: 15 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p10 + 1 <= p192)))
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 ((p10 + 1 <= p192)))
lola: processed formula length: 25
lola: 16 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: (p10 + 1 <= p192)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))
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 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))
lola: processed formula length: 68
lola: 16 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92 <= p9)))
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 ((p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92 <= p9)))
lola: processed formula length: 61
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: (p9 + 1 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-7-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: 15 markings, 14 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= p197)))
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 ((p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 <= p197)))
lola: processed formula length: 71
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: (p197 + 1 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-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 not invariant.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p194 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75))))
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 (((p194 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75))))
lola: processed formula length: 65
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 + 1 <= p194))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-01-ReachabilityCardinality-9-0.sara.
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92)))
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 ((p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92)))
lola: processed formula length: 112
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: (p89 + p88 + p87 + p86 + p85 + p90 + p91 + p92 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-10-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: 14 markings, 13 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p10) OR (p10 <= p52 + p53 + p54 + 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 (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p10) OR (p10 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))))
lola: processed formula length: 123
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27) AND (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + 1 <= p10))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 105 markings, 104 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p197 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) OR (p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p8))))
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 (((p197 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) OR (p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p8))))
lola: processed formula length: 143
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: ((p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 <= p197) AND (p8 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (p199 + 1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)) OR (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 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 ((((p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (p199 + 1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)) OR (p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 <= 0))))
lola: processed formula length: 265
lola: 17 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: (((p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118) OR (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 <= p199)) AND (1 <= p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (1 <= p195))) AND (((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (1 <= p102)) OR (p199 <= 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 (((((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (1 <= p195))) AND (((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (1 <= p102)) OR (p199 <= 0)))))
lola: processed formula length: 263
lola: 16 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 + p25 + p26 + p27 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) AND (1 <= p195))) AND (((p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (1 <= p102)) OR (p199 <= 0)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-01-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA PermAdmissibility-COL-01-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p151 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p10 + 1 <= p195) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) AND (p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142))))
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 (((p151 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p10 + 1 <= p195) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) AND (p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142))))
lola: processed formula length: 333
lola: 16 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: ((p151 + 1 <= p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p10 + 1 <= p195) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134) AND (p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + 1 <= p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-01-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-01-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
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 PermAdmissibility-COL-01-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes yes no yes no no no no no no
lola:
preliminary result: yes no yes no no yes yes yes no yes no no no no no no
lola: memory consumption: 26360 KB
lola: time consumption: 23 seconds

BK_STOP 1527034682781

--------------------
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="PermAdmissibility-COL-01"
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/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 PermAdmissibility-COL-01, 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-152666469500432"
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 ;