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 200K
-rw-r--r-- 1 mcc users 3.8K 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.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 32K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732583000241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527441653340

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PhilosophersDyn-COL-10 @ 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: 2480/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-10-LTLCardinality.task
lola: A ((((1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) U F (G ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))))) : A ((3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) : A (X (G (F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))))) : A ((((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) U (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : A (F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) : A ((G ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) U (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : A (X ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) : A (F (F (G (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)))))) : A ((((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U G (G ((3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))) : A (G (F (G (G ((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)))))) : A (F ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))) : A (F ((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))) : A ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) : A ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) : A (X ((G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) U F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))) : A (G (G (F (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 74
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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
check_solution: Constraint R4 = 1e+30 is above its equality of 0
check_solution: Constraint R5 = 1e+30 is above its equality of 0
check_solution: Constraint R6 = 1e+30 is above its equality of 0
check_solution: Constraint R7 = 1e+30 is above its equality of 0
check_solution: Constraint R8 = 1e+30 is above its equality of 0
check_solution: Constraint R9 = 1e+30 is above its equality of 0
check_solution: Constraint R10 = 1e+30 is above its equality of 0
check_solution: Constraint R11 = 1e+30 is above its equality of 0
check_solution: Constraint R12 = 1e+30 is above its equality of 0
check_solution: Constraint R13 = 1e+30 is above its equality of 0

Seriously low accuracy found ||*|| = 1e+30 (rel. error 0.5)
check_solution: Constraint R22 = 0 is above its equality of -1
check_solution: Constraint R23 = 0 is above its equality of -1
check_solution: Constraint R24 = 0 is above its equality of -1
check_solution: Constraint R25 = 0 is above its equality of -1
check_solution: Constraint R26 = 0 is above its equality of -1
check_solution: Constraint R27 = 0 is above its equality of -1
check_solution: Constraint R28 = 0 is above its equality of -1
check_solution: Constraint R29 = 0 is above its equality of -1
check_solution: Constraint R30 = 0 is above its equality of -1
check_solution: Constraint R160 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 54
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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

FORMULA PhilosophersDyn-COL-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 54
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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 PhilosophersDyn-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
lola: processed formula length: 148
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 46 markings, 90 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) OR (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) AND F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)) OR (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) AND F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))))
lola: processed formula length: 301
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 91 markings, 180 edges
lola:
FORMULA PhilosophersDyn-COL-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))
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: (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= 2)
lola: processed formula length: 74
lola: 18 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
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: (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)
lola: processed formula length: 144
lola: 18 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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 PhilosophersDyn-COL-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)))
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: (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: processed formula length: 144
lola: 18 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.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 PhilosophersDyn-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: processed formula length: 86
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 712 markings, 1912 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139))))
lola: processed formula length: 86
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 12 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
lola: processed formula length: 86
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 6330 markings, 17521 edges, 1266 markings/sec, 0 secs
lola: 12339 markings, 34928 edges, 1202 markings/sec, 5 secs
lola: 18323 markings, 52601 edges, 1197 markings/sec, 10 secs
lola: 24205 markings, 70012 edges, 1176 markings/sec, 15 secs
lola: 29989 markings, 86891 edges, 1157 markings/sec, 20 secs
lola: 35816 markings, 104183 edges, 1165 markings/sec, 25 secs
lola: 41880 markings, 122212 edges, 1213 markings/sec, 30 secs
lola: 47578 markings, 139420 edges, 1140 markings/sec, 35 secs
lola: 54575 markings, 160632 edges, 1399 markings/sec, 40 secs
lola: 61243 markings, 181754 edges, 1334 markings/sec, 45 secs
lola: 67991 markings, 202461 edges, 1350 markings/sec, 50 secs
lola: 74873 markings, 224304 edges, 1376 markings/sec, 55 secs
lola: 81610 markings, 245017 edges, 1347 markings/sec, 60 secs
lola: 88470 markings, 266929 edges, 1372 markings/sec, 65 secs
lola: 95347 markings, 289157 edges, 1375 markings/sec, 70 secs
lola: 102162 markings, 310458 edges, 1363 markings/sec, 75 secs
lola: 108238 markings, 330255 edges, 1215 markings/sec, 80 secs
lola: 114251 markings, 349080 edges, 1203 markings/sec, 85 secs
lola: 120110 markings, 367825 edges, 1172 markings/sec, 90 secs
lola: 126148 markings, 386986 edges, 1208 markings/sec, 95 secs
lola: 132199 markings, 406313 edges, 1210 markings/sec, 100 secs
lola: 138072 markings, 425324 edges, 1175 markings/sec, 105 secs
lola: 143730 markings, 443056 edges, 1132 markings/sec, 110 secs
lola: 149421 markings, 461611 edges, 1138 markings/sec, 115 secs
lola: 155045 markings, 479344 edges, 1125 markings/sec, 120 secs
lola: 160784 markings, 497337 edges, 1148 markings/sec, 125 secs
lola: 166332 markings, 515445 edges, 1110 markings/sec, 130 secs
lola: 171637 markings, 532185 edges, 1061 markings/sec, 135 secs
lola: 176823 markings, 548377 edges, 1037 markings/sec, 140 secs
lola: 182489 markings, 566989 edges, 1133 markings/sec, 145 secs
lola: 187971 markings, 584341 edges, 1096 markings/sec, 150 secs
lola: 193590 markings, 601951 edges, 1124 markings/sec, 155 secs
lola: 199033 markings, 619698 edges, 1089 markings/sec, 160 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 199051 markings, 619843 edges

FORMULA PhilosophersDyn-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: processed formula length: 152
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 268 markings, 1086 edges

FORMULA PhilosophersDyn-COL-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160))))
lola: processed formula length: 152
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 268 markings, 1086 edges

FORMULA PhilosophersDyn-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U G ((3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) U (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U G ((3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149))))
lola: processed formula length: 220
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges

FORMULA PhilosophersDyn-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (G ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) AND F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (G ((2 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)) AND F ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 339
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================

FORMULA PhilosophersDyn-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) U (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (2 <= p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)) U (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 ... (shortened)
lola: processed formula length: 822
lola: 16 rewrites
lola: closed formula file PhilosophersDyn-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges

FORMULA PhilosophersDyn-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes yes no no no yes no no no yes yes
lola:
preliminary result: no no no no yes yes yes no no no yes no no no yes yes
lola: ========================================
lola: memory consumption: 47872 KB
lola: time consumption: 224 seconds

BK_STOP 1527441877728

--------------------
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="PhilosophersDyn-COL-10"
export BK_EXAMINATION="LTLCardinality"
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/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 PhilosophersDyn-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r256-csrt-152732583000241"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;