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 176K
-rw-r--r-- 1 mcc users 3.6K 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.6K 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 6.2K 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 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.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-COL-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469800670
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527051561911

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-COL-000005 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-000005 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ Philosophers-COL-000005 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-ReachabilityCardinality.task
lola: always true
lola: LP says that atomic proposition is always true: (p5 + p6 + p7 + p8 + p9 <= p0 + p1 + p2 + p3 + p4)
lola: LP says that atomic proposition is always false: (3 <= p20 + p21 + p22 + p23 + p24)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p20 + p21 + p22 + p23 + p24)
lola: always true
lola: LP says that atomic proposition is always true: (p20 + p21 + p22 + p23 + p24 <= p0 + p1 + p2 + p3 + p4)
lola: A (G ((((p10 + p11 + p12 + p13 + p14 <= 0) OR (p20 + p21 + p22 + p23 + p24 <= 1)) AND (p15 + p16 + p17 + p18 + p19 <= 2)))) : A (G ((p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19))) : E (F (TRUE)) : E (F ((((p0 + p1 + p2 + p3 + p4 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= 2))))) : A (G (FALSE)) : E (F (((p15 + p16 + p17 + p18 + p19 <= 0) AND (p5 + p6 + p7 + p8 + p9 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19)))) : A (G (TRUE)) : E (F (((p20 + p21 + p22 + p23 + p24 <= 1)))) : E (F (((p0 + p1 + p2 + p3 + p4 <= 2) OR (p5 + p6 + p7 + p8 + p9 <= 2) OR ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (2 <= p20 + p21 + p22 + p23 + p24))))) : E (F ((((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (p5 + p6 + p7 + p8 + p9 + 1 <= p0 + p1 + p2 + p3 + p4)) OR (1 <= p20 + p21 + p22 + p23 + p24)))) : E (F (FALSE)) : A (G (((1 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 + 1 <= p10 + p11 + p12 + p13 + p14)))) : E (F (())) : A (G ((1 <= p5 + p6 + p7 + p8 + p9))) : E (F (((p20 + p21 + p22 + p23 + p24 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p10 + p11 + p12 + p13 + p14) AND (3 <= p15 + p16 + p17 + p18 + p19)))) : A (G (((2 <= p10 + p11 + p12 + p13 + p14) AND (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p10 + p11 + p12 + p13 + p14) AND (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: 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: 15 rewrites
lola: closed formula file Philosophers-COL-000005-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 Philosophers-COL-000005-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file Philosophers-COL-000005-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 Philosophers-COL-000005-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file Philosophers-COL-000005-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 Philosophers-COL-000005-ReachabilityCardinality-6 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file Philosophers-COL-000005-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

FORMULA Philosophers-COL-000005-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file Philosophers-COL-000005-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 Philosophers-COL-000005-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + p21 + p22 + p23 + p24 <= 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 (((p20 + p21 + p22 + p23 + p24 <= 1))))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p20 + p21 + p22 + p23 + p24 <= 1))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 37
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000005-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: (p5 + p6 + p7 + p8 + p9 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-6-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: 6 markings, 5 edges
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-13 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: E (F (((p15 + p16 + p17 + p18 + p19 <= 0) AND (p5 + p6 + p7 + p8 + p9 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19))))
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 (((p15 + p16 + p17 + p18 + p19 <= 0) AND (p5 + p6 + p7 + p8 + p9 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19))))
lola: processed formula length: 138
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-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: ((p15 + p16 + p17 + p18 + p19 <= 0) AND (p5 + p6 + p7 + p8 + p9 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= p15 + p16 + p17 + p18 + p19))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges

FORMULA Philosophers-COL-000005-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 + 1 <= p10 + p11 + p12 + p13 + p14))))
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 (((1 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 + 1 <= p10 + p11 + p12 + p13 + p14))))
lola: processed formula length: 103
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p0 + p1 + p2 + p3 + p4 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= 2)))))
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 ((((p0 + p1 + p2 + p3 + p4 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= 2)))))
lola: processed formula length: 75
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-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: (((p0 + p1 + p2 + p3 + p4 <= 1) AND (p5 + p6 + p7 + p8 + p9 <= 2)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-9-0.sara

FORMULA Philosophers-COL-000005-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 68
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: lola: state equation: calling and running sara
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: 3 markings, 2 edges
lola: ========================================
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-1 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: A (G ((((p10 + p11 + p12 + p13 + p14 <= 0) OR (p20 + p21 + p22 + p23 + p24 <= 1)) AND (p15 + p16 + p17 + p18 + p19 <= 2))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file Philosophers-COL-000005-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

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 ((((p10 + p11 + p12 + p13 + p14 <= 0) OR (p20 + p21 + p22 + p23 + p24 <= 1)) AND (p15 + p16 + p17 + p18 + p19 <= 2))))
lola: processed formula length: 124
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000005-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: (((1 <= p10 + p11 + p12 + p13 + p14) AND (2 <= p20 + p21 + p22 + p23 + p24)) OR (3 <= p15 + p16 + p17 + p18 + p19))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + p21 + p22 + p23 + p24 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p10 + p11 + p12 + p13 + p14) AND (3 <= p15 + p16 + p17 + p18 + p19))))
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 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p10 + p11 + p12 + p13 + p14) AND (3 <= p15 + p16 + p17 + p18 + p19))))
lola: processed formula length: 182
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p20 + p21 + p22 + p23 + p24 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 + 1 <= p10 + p11 + p12 + p13 + p14) AND (3 <= p15 + p16 + p17 + p18 + p19))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 243 markings, 945 edges
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-14 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 (F ((((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (p5 + p6 + p7 + p8 + p9 + 1 <= p0 + p1 + p2 + p3 + p4)) OR (1 <= p20 + p21 + p22 + p23 + p24))))
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 ((((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (p5 + p6 + p7 + p8 + p9 + 1 <= p0 + p1 + p2 + p3 + p4)) OR (1 <= p20 + p21 + p22 + p23 + p24))))
lola: processed formula length: 169
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
sara: try reading problem file Philosophers-COL-000005-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic


FORMULA Philosophers-COL-000005-ReachabilityCardinality-9 TRUE 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 (((p0 + p1 + p2 + p3 + p4 <= 2) OR (p5 + p6 + p7 + p8 + p9 <= 2) OR ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (2 <= p20 + p21 + p22 + p23 + p24)))))
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 (((p0 + p1 + p2 + p3 + p4 <= 2) OR (p5 + p6 + p7 + p8 + p9 <= 2) OR ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (2 <= p20 + p21 + p22 + p23 + p24)))))
lola: processed formula length: 178
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-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: ((p0 + p1 + p2 + p3 + p4 <= 2) OR (p5 + p6 + p7 + p8 + p9 <= 2) OR ((p5 + p6 + p7 + p8 + p9 + 1 <= p10 + p11 + p12 + p13 + p14) AND (2 <= p20 + p21 + p22 + p23 + p24)))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p10 + p11 + p12 + p13 + p14) AND (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p10 + p11 + p12 + p13 + p14) AND (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((2 <= p10 + p11 + p12 + p13 + p14) AND (p20 + p21 + p22 + p23 + p24 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p10 + p11 + p12 + p13 + p14) AND (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 203
lola: 17 rewrites
lola: closed formula file Philosophers-COL-000005-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p10 + p11 + p12 + p13 + p14 <= 1) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24) OR (p10 + p11 + p12 + p13 + p14 <= 1) OR (p5 + p6 + p7 + p8 + p9 + 1 <= p0 + p1 + p2 + p3 + p4))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000005-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: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + p21 + p22 + p23 + p24 <= 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 (((p20 + p21 + p22 + p23 + p24 <= 1))))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no yes yes yes yes yes no no no no no no
lola:
preliminary result: no no yes yes no yes yes yes yes yes no no no no no no
lola: memory consumption: 22288 KB
lola: time consumption: 0 seconds

BK_STOP 1527051562260

--------------------
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-000005"
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/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 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-000005, 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-152666469800670"
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 ;