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 196K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 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.0K 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 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 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.9K 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 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GlobalResAllocation-COL-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998400362
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526763113827

info: Time: 3600 - MCC
===========================================================================================
prep: translating GlobalResAllocation-COL-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GlobalResAllocation-COL-03 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ GlobalResAllocation-COL-03 @ 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: 4824/65536 symbol table entries, 1224 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p9 + p10 + p11 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: after: (0 <= 0)
lola: always true
lola: A (G (())) : A (G (())) : A (G ((((p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p0 + p1 + p2 <= p30 + p31 + p32)) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) : A (G (())) : E (F (())) : A (G (())) : E (F (((p30 + p31 + p32 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0) AND (p30 + p31 + p32 <= 2)))) : A (G (TRUE)) : A (G (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) : E (F (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8) AND ((p30 + p31 + p32 <= p9 + p10 + p11) OR (1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND (p0 + p1 + p2 <= 0)))) : A (G (((3 <= p3 + p4 + p5 + p6 + p7 + p8) OR (3 <= p9 + p10 + p11) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR ((2 <= p9 + p10 + p11) AND (1 <= p30 + p31 + p32) AND ((p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2) OR (3 <= p0 + p1 + p2)))))) : E (F (FALSE)) : E (F (())) : A (G (TRUE)) : E (F (((p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2) AND (1 <= p30 + p31 + p32) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (3 <= p0 + p1 + p2)))) : E (F (((p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p0 + p1 + p2) AND (p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k: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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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 GlobalResAllocation-COL-03-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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 GlobalResAllocation-COL-03-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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 GlobalResAllocation-COL-03-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ========================================
lola: ========================================

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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 GlobalResAllocation-COL-03-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 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: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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 GlobalResAllocation-COL-03-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 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: 27 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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 GlobalResAllocation-COL-03-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p0 + p1 + p2) AND (p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8))))
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 (((p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p0 + p1 + p2) AND (p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8))))
lola: processed formula length: 112
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ((p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p0 + p1 + p2) AND (p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6320 markings, 116178 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p3 + p4 + p5 + p6 + p7 + p8) OR (3 <= p9 + p10 + p11) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR ((2 <= p9 + p10 + p11) AND (1 <= p30 + p31 + p32) AND ((p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2) OR (3 <= p0 + p1 + p2))))))
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 <= p3 + p4 + p5 + p6 + p7 + p8) OR (3 <= p9 + p10 + p11) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR ((2 <= p9 + p10 + p11) AND (1 <= p30 + p31 + p32) AND ((p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2) OR (3 <= p0 + p1 + p2))))))
lola: processed formula length: 253
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ((p3 + p4 + p5 + p6 + p7 + p8 <= 2) AND (p9 + p10 + p11 <= 2) AND (p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p9 + p10 + p11) AND ((p9 + p10 + p11 <= 1) OR (p30 + p31 + p32 <= 0) OR ((p0 + p1 + p2 + 1 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p0 + p1 + p2 <= 2))))
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6320 markings, 116178 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p30 + p31 + p32 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0) AND (p30 + p31 + p32 <= 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 (((p30 + p31 + p32 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0) AND (p30 + p31 + p32 <= 2))))
lola: processed formula length: 284
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ((p30 + p31 + p32 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0) AND (p30 + p31 + p32 <= 2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6320 markings, 116152 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2) AND (1 <= p30 + p31 + p32) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (3 <= p0 + p1 + p2))))
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 (((p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2) AND (1 <= p30 + p31 + p32) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (3 <= p0 + p1 + p2))))
lola: processed formula length: 342
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ((p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2) AND (1 <= p30 + p31 + p32) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (3 <= p0 + p1 + p2))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6320 markings, 116178 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + 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 (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p30 + p31 + p32 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: processed formula length: 396
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ((p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p30 + p31 + p32) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6320 markings, 116028 edges

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p0 + p1 + p2 <= p30 + p31 + p32)) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + 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 ((((p30 + p31 + p32 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p0 + p1 + p2 <= p30 + p31 + p32)) OR (p9 + p10 + p11 <= p3 + p4 + p5 + p6 + p7 + p8) OR (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))
lola: processed formula length: 267
lola: 29 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: (((p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p30 + p31 + p32) OR (p30 + p31 + p32 + 1 <= p0 + p1 + p2)) AND (p3 + p4 + p5 + p6 + p7 + p8 + 1 <= p9 + p10 + p11) AND (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6320 markings, 116028 edges
lola:
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8) AND ((p30 + p31 + p32 <= p9 + p10 + p11) OR (1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND (p0 + p1 + p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8) AND ((p30 + p31 + p32 <= p9 + p10 + p11) OR (1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND (p0 + p1 + p2 <= 0))))
lola: processed formula length: 358
lola: 28 rewrites
lola: closed formula file GlobalResAllocation-COL-03-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: ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8) AND ((p30 + p31 + p32 <= p9 + p10 + p11) OR (1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) AND (p0 + p1 + p2 <= 0))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no yes yes yes yes no no yes no no
lola:
preliminary result: yes yes yes yes no yes no yes yes yes yes no no yes no no
lola: memory consumption: 124864 KB
lola: time consumption: 38 seconds

BK_STOP 1526763152442

--------------------
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="GlobalResAllocation-COL-03"
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/GlobalResAllocation-COL-03.tgz
mv GlobalResAllocation-COL-03 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 GlobalResAllocation-COL-03, 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 r088-blw7-152649998400362"
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 ;