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 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K 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 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 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-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500439
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527034749232

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-02 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ PermAdmissibility-COL-02 @ 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-02-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p180)
lola: LP says that atomic proposition is always false: (3 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)
lola: LP says that atomic proposition is always false: (3 <= p206)
lola: LP says that atomic proposition is always false: (3 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)
lola: LP says that atomic proposition is always false: (3 <= p85)
lola: LP says that atomic proposition is always true: (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)
lola: always true
lola: A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : A (G ((((p119 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189) AND (p119 <= p206) AND ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))) OR ((p181 <= p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99) AND (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))))) : E (F (((p43 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR ((1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (p179 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))) : E (F ((((p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 0) AND (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))))) : E (F (FALSE)) : E (F ((1 <= p85))) : E (F (())) : E (F ((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))) : E (F ((1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : E (F (FALSE)) : A (G ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109))) : E (F ((p120 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))) : A (G ((((3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160) OR (2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) OR ((p177 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (p119 <= p180))) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= 1) OR ((p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 <= p60) AND (3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118)))))) : E (F (((p110 + 1 <= p177) OR (p0 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168)))) : A (G (())) : E (F (((1 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND ((2 <= p85) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p110)))))
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: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file PermAdmissibility-COL-02-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-02-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file PermAdmissibility-COL-02-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-02-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file PermAdmissibility-COL-02-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-02-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file PermAdmissibility-COL-02-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-02-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p85)))
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 <= p85)))
lola: processed formula length: 18
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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 <= p85)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-4-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: 8 markings, 7 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)))
lola: processed formula length: 68
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)
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: 25 markings, 24 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-5-0.sara
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 52
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-5-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-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: 12 markings, 11 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p120 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + 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 ((p120 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)))
lola: processed formula length: 67
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: (p120 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-7-0.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-02-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p110 + 1 <= p177) OR (p0 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))))
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 (((p110 + 1 <= p177) OR (p0 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))))
lola: processed formula length: 98
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: ((p110 + 1 <= p177) OR (p0 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-8-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: 9 markings, 8 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
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 ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
lola: processed formula length: 112
lola: 14 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-9-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: 16 markings, 15 edges

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 0) AND (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
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 ((((p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 0) AND (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula length: 137
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: (((p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 <= 0) AND (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-10-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: 19 markings, 18 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))
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 ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)))
lola: processed formula length: 112
lola: 14 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: (p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + 1 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59)
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: 8 markings, 7 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND ((2 <= p85) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p110)))))
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 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND ((2 <= p85) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p110)))))
lola: processed formula length: 208
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND ((2 <= p85) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p110)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 302000 markings, 348946 edges, 60400 markings/sec, 0 secs
lola: sara is running 5 secs || 587766 markings, 741337 edges, 57153 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 696802 markings, 944068 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p43 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR ((1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (p179 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))))
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 (((p43 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR ((1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (p179 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))))
lola: processed formula length: 244
lola: 13 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: ((p43 + 1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR ((1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (p179 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-13-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p119 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189) AND (p119 <= p206) AND ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))) OR ((p181 <= p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99) AND (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
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 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189) AND (p119 <= p206) AND ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))) OR ((p181 <= p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99) AND (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula length: 334
lola: 14 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: (((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + 1 <= p119) OR (p206 + 1 <= p119) OR ((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 + 1 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197))) AND ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p181) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 <= 1)))
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160) OR (2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) OR ((p177 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (p119 <= p180))) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= 1) OR ((p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 <= p60) AND (3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((3 <= p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160) OR (2 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41) OR ((p177 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (p119 <= p180))) AND ((p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= 1) OR ((p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 <= p60) AND (3 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 +... (shortened)
lola: processed formula length: 411
lola: 14 rewrites
lola: closed formula file PermAdmissibility-COL-02-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: (((p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 <= 2) AND (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= 1) AND ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p177) OR (p180 + 1 <= p119))) OR ((2 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND ((p60 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168) OR (p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 <= 2))))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-15-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: 9 markings, 8 edges
lola:
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no yes no yes yes no no yes no yes yes no
lola:
preliminary result: no no yes yes no yes no yes yes no no yes no yes yes no
========================================
lola: memory consumption: 28560 KB
lola: time consumption: 47 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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-02"
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-02.tgz
mv PermAdmissibility-COL-02 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-02, 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-152666469500439"
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 ;