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 192K
-rw-r--r-- 1 mcc users 3.2K May 30 22:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 28 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 05:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 05:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 14K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-005006, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300655
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527822552372

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-005006 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-005006 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RefineWMG-PT-005006 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 928
lola: finding significant places
lola: 29 places, 23 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 29 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-005-006-ReachabilityCardinality.task
lola: always true
lola: E (F (((p10 + 1 <= p9) AND (p8 <= p11)))) : E (F ((3 <= p6))) : E (F ((p3 + 1 <= p25))) : E (F ((((p9 <= 1) OR ((2 <= p10) AND (p22 <= p21))) AND (p18 <= p25)))) : A (G (((3 <= p18) OR ((p17 <= 2) AND (1 <= p18))))) : E (F (((p8 <= 2) AND (p5 <= 0) AND (1 <= p1)))) : A (G (((p13 <= 2) OR ((p7 <= p21) AND (p2 <= pterce)) OR ((p17 <= 2) AND ((2 <= p13) OR (3 <= p2)))))) : A (G (((p25 <= p3) OR (1 <= p4) OR (p9 <= 0) OR (3 <= p6)))) : E (F ((p14 + 1 <= p1))) : E (F (((3 <= p18) AND (2 <= p5) AND (2 <= p2) AND (p19 <= p7)))) : A (G (((2 <= p11) OR (1 <= pterce) OR (p20 <= psecond) OR (3 <= pprime) OR ((2 <= p14) AND (3 <= p8) AND (p4 <= p16))))) : E (F ((((p18 + 1 <= p20) OR (p23 + 1 <= p15)) AND (((p21 <= p12) AND (p1 <= p4)) OR ((3 <= p) AND (2 <= p21)))))) : A (G (((p22 + 1 <= p18) OR (p20 + 1 <= p21) OR ((p24 <= 1) AND (3 <= p12))))) : E (F (((p19 <= p18) AND (2 <= p7) AND (p2 <= p24) AND (psecond <= p5) AND ((p14 + 1 <= p6) OR (1 <= p7))))) : A (G ((((p2 <= p17)) OR ((2 <= p21) AND (p22 <= p17)) OR (p3 <= p1)))) : E (F ((p18 + 1 <= p16)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= p6)))
lola: processed formula length: 17
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p6)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-1 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 (F ((p3 + 1 <= p25)))
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 + 1 <= p25)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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 + 1 <= p25)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 37 edges

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-2 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: A (G (((3 <= p18) OR ((p17 <= 2) AND (1 <= p18)))))
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 <= p18) OR ((p17 <= 2) AND (1 <= p18)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p18 <= 2) AND ((3 <= p17) OR (p18 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-4 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 (F ((p14 + 1 <= p1)))
lola: ========================================
lola: SUBTASKlola: ========================================

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 ((p14 + 1 <= p1)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: (p14 + 1 <= p1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-3-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 22 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-8 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 ((p18 + 1 <= p16)))
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 ((p18 + 1 <= p16)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: (p18 + 1 <= p16)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-15 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 (((p8 <= 2) AND (p5 <= 0) AND (1 <= p1))))
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 (((p8 <= 2) AND (p5 <= 0) AND (1 <= p1))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: ((p8 <= 2) AND (p5 <= 0) AND (1 <= p1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-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: 21 markings, 20 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: sara: try reading problem file RefineWMG-PT-005-006-ReachabilityCardinality-3-0.sara.subprocess 6 will run for 357 seconds at most (--localtimelimit=0)

lola: ========================================
lola: ...considering subproblem: E (F (((p10 + 1 <= p9) AND (p8 <= p11))))
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 + 1 <= p9) AND (p8 <= p11))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: ((p10 + 1 <= p9) AND (p8 <= p11))
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: 23 markings, 22 edges

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-6-0.sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p18) AND (2 <= p5) AND (2 <= p2) AND (p19 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= p18) AND (2 <= p5) AND (2 <= p2) AND (p19 <= p7))))
lola: processed formula length: 64
lola:
1 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= p18) AND (2 <= p5) AND (2 <= p2) AND (p19 <= p7))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-005-006-ReachabilityCardinality-7-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-9 TRUE 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 (G (((p25 <= p3) OR (1 <= p4) OR (p9 <= 0) OR (3 <= p6))))
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 (((p25 <= p3) OR (1 <= p4) OR (p9 <= 0) OR (3 <= p6))))
lola: processed formula length: 63
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-005-006-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 + 1 <= p25) AND (p4 <= 0) AND (1 <= p9) AND (p6 <= 2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-005-006-ReachabilityCardinality-8-0.sara.

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 47 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-7 FALSE 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 ((((p9 <= 1) OR ((2 <= p10) AND (p22 <= p21))) AND (p18 <= p25))))
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 ((((p9 <= 1) OR ((2 <= p10) AND (p22 <= p21))) AND (p18 <= p25))))
lola: processed formula length: 72
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: (((p9 <= 1) OR ((2 <= p10) AND (p22 <= p21))) AND (p18 <= p25))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-3 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 (G (((p22 + 1 <= p18) OR (p20 + 1 <= p21) OR ((p24 <= 1) AND (3 <= p12)))))
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 + 1 <= p18) OR (p20 + 1 <= p21) OR ((p24 <= 1) AND (3 <= p12)))))
lola: processed formula length: 79
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p18 <= p22) AND (p21 <= p20) AND ((2 <= p24) OR (p12 <= 2)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2 <= p17)) OR ((2 <= p21) AND (p22 <= p17)) OR (p3 <= p1))))
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 ((((p2 <= p17)) OR ((2 <= p21) AND (p22 <= p17)) OR (p3 <= p1))))
lola: processed formula length: 72
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 11 markings, 10 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-14 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: A (G (((p13 <= 2) OR ((p7 <= p21) AND (p2 <= pterce)) OR ((p17 <= 2) AND ((2 <= p13) OR (3 <= 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 (((p13 <= 2) OR ((p7 <= p21) AND (p2 <= pterce)) OR ((p17 <= 2) AND ((2 <= p13) OR (3 <= p2))))))
lola: processed formula length: 105
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 12 markings, 11 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p19 <= p18) AND (2 <= p7) AND (p2 <= p24) AND (psecond <= p5) AND ((p14 + 1 <= p6) OR (1 <= p7)))))
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 (((p19 <= p18) AND (2 <= p7) AND (p2 <= p24) AND (psecond <= p5) AND ((p14 + 1 <= p6) OR (1 <= p7)))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 13 markings, 12 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p18 + 1 <= p20) OR (p23 + 1 <= p15)) AND (((p21 <= p12) AND (p1 <= p4)) OR ((3 <= p) AND (2 <= p21))))))
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 ((((p18 + 1 <= p20) OR (p23 + 1 <= p15)) AND (((p21 <= p12) AND (p1 <= p4)) OR ((3 <= p) AND (2 <= p21))))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 31 markings, 33 edges

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p11) OR (1 <= pterce) OR (p20 <= psecond) OR (3 <= pprime) OR ((2 <= p14) AND (3 <= p8) AND (p4 <= p16)))))
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 <= p11) OR (1 <= pterce) OR (p20 <= psecond) OR (3 <= pprime) OR ((2 <= p14) AND (3 <= p8) AND (p4 <= p16)))))
lola: processed formula length: 124
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 12 markings, 11 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityCardinality-10 FALSE 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 no yes yes no yes no yes no yes
lola:
preliminary result: yes yes yes yes no yes no no yes yes no yes no yes no yes
sara: try reading problem file RefineWMG-PT-005-006-ReachabilityCardinality-9-0.sara.

lola: memory consumption: 25288 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-005006"
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/RefineWMG-PT-005006.tgz
mv RefineWMG-PT-005006 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 RefineWMG-PT-005006, 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 r280-csrt-152749170300655"
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 ;