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 248K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 4.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 73K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhaseVariation-PT-D02CS010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469700602
=====================================================================

--------------------
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 PhaseVariation-PT-D02CS010-ReachabilityFireability-00
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-01
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-02
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-03
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-04
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-05
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-06
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-07
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-08
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-09
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-10
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-11
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-12
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-13
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-14
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527047857939

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhaseVariation-PT-D02CS010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhaseVariation-PT-D02CS010 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ PhaseVariation-PT-D02CS010 @ 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: 79/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 65 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D02CS010-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(division1_replicate_2_2_B) OR NOT FIREABLE(division2_mutate_1_1_A_2_1) OR FIREABLE(division2_replicate_1_1_A_2_1) OR NOT FIREABLE(division2_mutate_1_1_B_1_2) OR NOT FIREABLE(division2_mutate_1_2_B_2_2) OR NOT FIREABLE(division1_mutate_2_2_A) OR NOT FIREABLE(division2_replicate_1_2_A_2_2)))) : E (F ((FIREABLE(division2_replicate_1_1_A_1_2) AND (FIREABLE(division2_replicate_2_2_B_2_1) OR FIREABLE(division2_mutate_1_2_B_2_1)) AND NOT FIREABLE(division2_mutate_2_2_A_2_1) AND NOT FIREABLE(division1_mutate_2_2_A) AND NOT FIREABLE(division2_mutate_1_1_A_1_2) AND NOT FIREABLE(division2_replicate_2_1_A_2_2) AND FIREABLE(division2_replicate_2_2_A_1_2)))) : A (G ((FIREABLE(division2_replicate_1_2_A_1_1) OR FIREABLE(division2_replicate_1_1_B_1_2) OR NOT FIREABLE(division2_mutate_1_2_A_1_1)))) : E (F ((FIREABLE(division2_mutate_1_1_B_2_2) AND FIREABLE(division2_replicate_1_2_A_2_1) AND FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_1_B_1_2) AND FIREABLE(division2_replicate_2_1_A_1_2) AND NOT FIREABLE(division1_mutate_1_1_A) AND FIREABLE(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_mutate_1_2_B_1_1)))) : E (F (())) : A (G ((NOT FIREABLE(division2_mutate_2_2_A_1_1) OR NOT FIREABLE(stop_constant)))) : A (G (())) : E (F (())) : E (F ((FIREABLE(stop_constant) AND FIREABLE(division2_mutate_1_2_A_2_1)))) : E (F (((FIREABLE(division2_mutate_2_1_B_1_2) AND FIREABLE(division1_replicate_2_2_B) AND FIREABLE(division2_replicate_2_1_A_2_2) AND NOT FIREABLE(division2_replicate_1_2_A_1_1) AND NOT FIREABLE(division2_mutate_1_1_A_2_2)) OR NOT FIREABLE(division2_mutate_2_2_B_1_1)))) : A (G (NOT FIREABLE(division2_mutate_1_1_B_2_2))) : A (G ((FIREABLE(division2_mutate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_B_1_2) AND (FIREABLE(division2_mutate_2_1_B_1_1) OR FIREABLE(division1_mutate_1_2_B)) AND FIREABLE(division2_mutate_2_1_B_2_2) AND (NOT FIREABLE(division2_mutate_2_1_B_2_2) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_mutate_1_2_A_1_1) AND (FIREABLE(division2_replicate_1_2_A_2_2) OR FIREABLE(division1_replicate_1_1_A))))))) : E (F (FIREABLE(division2_replicate_1_2_A_2_2))) : E (F ((FIREABLE(division2_replicate_1_1_B_2_2) OR FIREABLE(division2_replicate_1_1_B_1_2) OR (FIREABLE(division2_replicate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_A_1_1)) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_2_B_1_2)) OR FIREABLE(division1_replicate_2_2_B)))) : A (G ((NOT FIREABLE(division1_mutate_2_2_B) OR FIREABLE(division2_mutate_1_1_B_1_2) OR FIREABLE(division1_replicate_1_2_A) OR ((FIREABLE(division2_mutate_2_2_B_1_1) OR FIREABLE(division2_replicate_1_1_A_2_2) OR NOT FIREABLE(division2_replicate_2_1_A_2_2)) AND FIREABLE(division2_mutate_2_1_A_1_1))))) : E (F (FIREABLE(division1_replicate_1_1_B)))
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: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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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 PhaseVariation-PT-D02CS010-ReachabilityFireability-4 FALSE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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 PhaseVariation-PT-D02CS010-ReachabilityFireability-6 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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 PhaseVariation-PT-D02CS010-ReachabilityFireability-7 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: A (G (NOT FIREABLE(division2_mutate_1_1_B_2_2)))
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 (NOT FIREABLE(division2_mutate_1_1_B_2_2)))
lola: processed formula length: 48
lola: 11 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: FIREABLE(division2_mutate_1_1_B_2_2)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-3-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: 2 markings, 1 edges
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-10 FALSE 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 (FIREABLE(division2_replicate_1_2_A_2_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 (FIREABLE(division2_replicate_1_2_A_2_2)))
lola: processed formula length: 47
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: FIREABLE(division2_replicate_1_2_A_2_2)
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: 2 markings, 1 edges
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-12 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 (FIREABLE(division1_replicate_1_1_B)))
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 (FIREABLE(division1_replicate_1_1_B)))
lola: processed formula length: 43
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: FIREABLE(division1_replicate_1_1_B)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(stop_constant) AND FIREABLE(division2_mutate_1_2_A_2_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 ((FIREABLE(stop_constant) AND FIREABLE(division2_mutate_1_2_A_2_1))))
lola: processed formula length: 74
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: (FIREABLE(stop_constant) AND FIREABLE(division2_mutate_1_2_A_2_1))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-6-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: 14 markings, 22 edges
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_2_2_A_1_1) OR NOT FIREABLE(stop_constant))))
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 ((NOT FIREABLE(division2_mutate_2_2_A_1_1) OR NOT FIREABLE(stop_constant))))
lola: processed formula length: 82
lola: 11 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: (FIREABLE(division2_mutate_2_2_A_1_1) AND FIREABLE(stop_constant))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 25 edges

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division2_replicate_1_2_A_1_1) OR FIREABLE(division2_replicate_1_1_B_1_2) OR NOT FIREABLE(division2_mutate_1_2_A_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(division2_replicate_1_2_A_1_1) OR FIREABLE(division2_replicate_1_1_B_1_2) OR NOT FIREABLE(division2_mutate_1_2_A_1_1))))
lola: processed formula length: 138
lola: 11 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(division2_replicate_1_2_A_1_1) AND NOT FIREABLE(division2_replicate_1_1_B_1_2) AND FIREABLE(division2_mutate_1_2_A_1_1))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
sara: try reading problem file PhaseVariation-PT-D02CS010-ReachabilityFireability-5-0.sara.
sara: try reading problem file PhaseVariation-PT-D02CS010-ReachabilityFireability-7-0.sara.
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-2 TRUE 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 (((FIREABLE(division2_mutate_2_1_B_1_2) AND FIREABLE(division1_replicate_2_2_B) AND FIREABLE(division2_replicate_2_1_A_2_2) AND NOT FIREABLE(division2_replicate_1_2_A_1_1) AND NOT FIREABLE(division2_mutate_1_1_A_2_2)) OR NOT FIREABLE(division2_mutate_2_2_B_1_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 (((FIREABLE(division2_mutate_2_1_B_1_2) AND FIREABLE(division1_replicate_2_2_B) AND FIREABLE(division2_replicate_2_1_A_2_2) AND NOT FIREABLE(division2_replicate_1_2_A_1_1) AND NOT FIREABLE(division2_mutate_1_1_A_2_2)) OR NOT FIREABLE(division2_mutate_2_2_B_1_1))))
lola: processed formula length: 270
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: SUBRESULT
lola: result: yes
lola: formula 0: ((FIREABLE(division2_mutate_2_1_B_1_2) AND FIREABLE(division1_replicate_2_2_B) AND FIREABLE(division2_replicate_2_1_A_2_2) AND NOT FIREABLE(division2_replicate_1_2_A_1_1) AND NOT FIREABLE(division2_mutate_1_1_A_2_2)) OR NOT FIREABLE(division2_mutate_2_2_B_1_1))
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_replicate_1_1_B_2_2) OR FIREABLE(division2_replicate_1_1_B_1_2) OR (FIREABLE(division2_replicate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_A_1_1)) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_2_B_1_2)) OR FIREABLE(division1_replicate_2_2_B))))
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 ((FIREABLE(division2_replicate_1_1_B_2_2) OR FIREABLE(division2_replicate_1_1_B_1_2) OR (FIREABLE(division2_replicate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_A_1_1)) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_2_B_1_2)) OR FIREABLE(division1_replicate_2_2_B))))
lola: processed formula length: 307
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: (FIREABLE(division2_replicate_1_1_B_2_2) OR FIREABLE(division2_replicate_1_1_B_1_2) OR (FIREABLE(division2_replicate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_A_1_1)) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_2_B_1_2)) OR FIREABLE(division1_replicate_2_2_B))
lola: state equation: Generated DNF with 21 literals and 5 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-13 TRUE 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 ((NOT FIREABLE(division1_mutate_2_2_B) OR FIREABLE(division2_mutate_1_1_B_1_2) OR FIREABLE(division1_replicate_1_2_A) OR ((FIREABLE(division2_mutate_2_2_B_1_1) OR FIREABLE(division2_replicate_1_1_A_2_2) OR NOT FIREABLE(division2_replicate_2_1_A_2_2)) AND FIREABLE(division2_mutate_2_1_A_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(division1_mutate_2_2_B) OR FIREABLE(division2_mutate_1_1_B_1_2) OR FIREABLE(division1_replicate_1_2_A) OR ((FIREABLE(division2_mutate_2_2_B_1_1) OR FIREABLE(division2_replicate_1_1_A_2_2) OR NOT FIREABLE(division2_replicate_2_1_A_2_2)) AND FIREABLE(division2_mutate_2_1_A_1_1)))))
lola: processed formula length: 305
lola: 11 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.task
lola: ========================================
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: (FIREABLE(division1_mutate_2_2_B) AND NOT FIREABLE(division2_mutate_1_1_B_1_2) AND NOT FIREABLE(division1_replicate_1_2_A) AND ((NOT FIREABLE(division2_mutate_2_2_B_1_1) AND NOT FIREABLE(division2_replicate_1_1_A_2_2) AND FIREABLE(division2_replicate_2_1_A_2_2)) OR NOT FIREABLE(division2_mutate_2_1_A_1_1)))
lola: state equation: calling and running sara
lola: state equation: Generated DNF with 88 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D02CS010-ReachabilityFireability-11-0.sara.
sara: try reading problem file PhaseVariation-PT-D02CS010-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 13 edges
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-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 ((NOT FIREABLE(division1_replicate_2_2_B) OR NOT FIREABLE(division2_mutate_1_1_A_2_1) OR FIREABLE(division2_replicate_1_1_A_2_1) OR NOT FIREABLE(division2_mutate_1_1_B_1_2) OR NOT FIREABLE(division2_mutate_1_2_B_2_2) OR NOT FIREABLE(division1_mutate_2_2_A) OR NOT FIREABLE(division2_replicate_1_2_A_2_2))))
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 ((NOT FIREABLE(division1_replicate_2_2_B) OR NOT FIREABLE(division2_mutate_1_1_A_2_1) OR FIREABLE(division2_replicate_1_1_A_2_1) OR NOT FIREABLE(division2_mutate_1_1_B_1_2) OR NOT FIREABLE(division2_mutate_1_2_B_2_2) OR NOT FIREABLE(division1_mutate_2_2_A) OR NOT FIREABLE(division2_replicate_1_2_A_2_2))))
lola: processed formula length: 317
lola: 11 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(division1_replicate_2_2_B) AND FIREABLE(division2_mutate_1_1_A_2_1) AND NOT FIREABLE(division2_replicate_1_1_A_2_1) AND FIREABLE(division2_mutate_1_1_B_1_2) AND FIREABLE(division2_mutate_1_2_B_2_2) AND FIREABLE(division1_mutate_2_2_A) AND FIREABLE(division2_replicate_1_2_A_2_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-0 TRUE 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 ((FIREABLE(division2_mutate_1_1_B_2_2) AND FIREABLE(division2_replicate_1_2_A_2_1) AND FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_1_B_1_2) AND FIREABLE(division2_replicate_2_1_A_1_2) AND NOT FIREABLE(division1_mutate_1_1_A) AND FIREABLE(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_mutate_1_2_B_1_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 ((FIREABLE(division2_mutate_1_1_B_2_2) AND FIREABLE(division2_replicate_1_2_A_2_1) AND FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_1_B_1_2) AND FIREABLE(division2_replicate_2_1_A_1_2) AND NOT FIREABLE(division1_mutate_1_1_A) AND FIREABLE(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_mutate_1_2_B_1_1))))
lola: processed formula length: 345
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: (FIREABLE(division2_mutate_1_1_B_2_2) AND FIREABLE(division2_replicate_1_2_A_2_1) AND FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_replicate_2_1_B_1_2) AND FIREABLE(division2_replicate_2_1_A_1_2) AND NOT FIREABLE(division1_mutate_1_1_A) AND FIREABLE(division2_replicate_2_1_B_1_1) AND FIREABLE(division2_mutate_1_2_B_1_1))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_replicate_1_1_A_1_2) AND (FIREABLE(division2_replicate_2_2_B_2_1) OR FIREABLE(division2_mutate_1_2_B_2_1)) AND NOT FIREABLE(division2_mutate_2_2_A_2_1) AND NOT FIREABLE(division1_mutate_2_2_A) AND NOT FIREABLE(division2_mutate_1_1_A_1_2) AND NOT FIREABLE(division2_replicate_2_1_A_2_2) AND FIREABLE(division2_replicate_2_2_A_1_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 ((FIREABLE(division2_replicate_1_1_A_1_2) AND (FIREABLE(division2_replicate_2_2_B_2_1) OR FIREABLE(division2_mutate_1_2_B_2_1)) AND NOT FIREABLE(division2_mutate_2_2_A_2_1) AND NOT FIREABLE(division1_mutate_2_2_A) AND NOT FIREABLE(division2_mutate_1_1_A_1_2) AND NOT FIREABLE(division2_replicate_2_1_A_2_2) AND FIREABLE(division2_replicate_2_2_A_1_2))))
lola: processed formula length: 359
lola: 10 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: (FIREABLE(division2_replicate_1_1_A_1_2) AND (FIREABLE(division2_replicate_2_2_B_2_1) OR FIREABLE(division2_mutate_1_2_B_2_1)) AND NOT FIREABLE(division2_mutate_2_2_A_2_1) AND NOT FIREABLE(division1_mutate_2_2_A) AND NOT FIREABLE(division2_mutate_1_1_A_1_2) AND NOT FIREABLE(division2_replicate_2_1_A_2_2) AND FIREABLE(division2_replicate_2_2_A_1_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-1 FALSE 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 ((FIREABLE(division2_mutate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_B_1_2) AND (FIREABLE(division2_mutate_2_1_B_1_1) OR FIREABLE(division1_mutate_1_2_B)) AND FIREABLE(division2_mutate_2_1_B_2_2) AND (NOT FIREABLE(division2_mutate_2_1_B_2_2) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_mutate_1_2_A_1_1) AND (FIREABLE(division2_replicate_1_2_A_2_2) OR FIREABLE(divisio... (shortened)
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 ((FIREABLE(division2_mutate_2_2_A_2_1) AND FIREABLE(division2_mutate_2_2_B_1_2) AND (FIREABLE(division2_mutate_2_1_B_1_1) OR FIREABLE(division1_mutate_1_2_B)) AND FIREABLE(division2_mutate_2_1_B_2_2) AND (NOT FIREABLE(division2_mutate_2_1_B_2_2) OR (FIREABLE(division2_mutate_2_1_A_1_1) AND FIREABLE(division2_mutate_1_2_A_1_1) AND (FIREABLE(division2_replicate_1_2_A_2_2) OR FIREABLE(divisio... (shortened)
lola: processed formula length: 425
lola: 11 rewrites
lola: closed formula file PhaseVariation-PT-D02CS010-ReachabilityFireability.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: (NOT FIREABLE(division2_mutate_2_2_A_2_1) OR NOT FIREABLE(division2_mutate_2_2_B_1_2) OR (NOT FIREABLE(division2_mutate_2_1_B_1_1) AND NOT FIREABLE(division1_mutate_1_2_B)) OR NOT FIREABLE(division2_mutate_2_1_B_2_2) OR (FIREABLE(division2_mutate_2_1_B_2_2) AND (NOT FIREABLE(division2_mutate_2_1_A_1_1) OR NOT FIREABLE(division2_mutate_1_2_A_1_1) OR (NOT FIREABLE(division2_replicate_1_2_A_2_2) AND NOT FIREABLE(division1_replicate_1_1_A)))))
lola: state equation: Generated DNF with 59 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D02CS010-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhaseVariation-PT-D02CS010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes no yes yes no no yes yes no yes
lola:
preliminary result: yes no yes no no no yes no yes yes no no yes yes no yes
sara: place or transition ordering is non-deterministic
lola: memory consumption: 14504 KB
lola: time consumption: 0 seconds




BK_STOP 1527047860937

--------------------
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="PhaseVariation-PT-D02CS010"
export BK_EXAMINATION="ReachabilityFireability"
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/PhaseVariation-PT-D02CS010.tgz
mv PhaseVariation-PT-D02CS010 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 PhaseVariation-PT-D02CS010, examination is ReachabilityFireability"
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-152666469700602"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;