About the Execution of LoLA for Philosophers-COL-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
181.880 | 1537.00 | 2931.00 | 19.20 | FFFTTFTTTFFFTTFT | normal |
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 180K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-COL-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469800675
=====================================================================
--------------------
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 Philosophers-COL-000010-CTLCardinality-00
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-01
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-02
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-03
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-04
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-05
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-06
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-07
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-08
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-09
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-10
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-11
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-12
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-13
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-14
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527051592990
info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-COL-000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Philosophers-COL-000010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ Philosophers-COL-000010 @ 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: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000010-CTLCardinality.task
lola: LP says that atomic proposition is always true: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: LP says that atomic proposition is always true: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: always true
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: always true
lola: (A (G ((((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND (A (G (((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND A (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) OR (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : (E (G (((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))) AND E (X (A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : (((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND A (G ((((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : A ((((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) U E (F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))) : E (X (NOT(A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND A (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) : A (G (E (F (())))) : ((E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND E (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) OR NOT(E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))) : E (F (A (X (((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))) : E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1)))) : (E (G (A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) OR E (F (A (G ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))) : A (G (E (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))) : (A (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1) AND (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND A (G (TRUE))) : (E (F (E (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) AND E ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) U ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : A (F (A (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : E (F ((E (G ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) AND ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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:115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 114
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 10 markings, 9 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))) AND E (X (A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))
lola: processed formula length: 193
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 133
lola: 19 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 155 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND E (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1))))
lola: processed formula length: 193
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + 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 (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 245
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 185
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: processed formula length: 139
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
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 + p28 + p29 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: processed formula length: 128
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000010-CTLCardinality-5-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: 6 markings, 5 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1))))
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 (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1))))
lola: processed formula length: 337
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000010-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-COL-000010-CTLCardinality-6-0.sara.
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 Philosophers-COL-000010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: processed formula length: 120
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 42301 markings, 143614 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 1) AND (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((2 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2))
lola: processed formula length: 135
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) AND ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p40 + p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2))) AND ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <... (shortened)
lola: processed formula length: 464
lola: 19 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8589 markings, 47917 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: processed formula length: 120
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND A (G ((((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))
lola: processed formula length: 66
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: processed formula length: 275
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1)) AND ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 0) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000010-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-COL-000010-CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
FORMULA Philosophers-COL-000010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND A (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 64
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 128
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) OR E (F (A (G ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 0)
lola: processed formula length: 64
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 59049 markings, 459270 edges
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 84
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) AND E ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) U ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 110
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) U ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) U ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: processed formula length: 371
lola: 19 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000010-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-COL-000010-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND (A (G (((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND A (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: processed formula length: 143
lola: 18 rewrites
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Philosophers-COL-000010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes yes yes no no no yes yes no yes
lola:
preliminary result: no no no yes yes no yes yes yes no no no yes yes no yes
lola: memory consumption: 24444 KB
lola: time consumption: 1 seconds
BK_STOP 1527051594527
--------------------
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="Philosophers-COL-000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 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 Philosophers-COL-000010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469800675"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;