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 264K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 94K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526652323700

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-PT-10a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating FlexibleBarrier-PT-10a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-10a @ 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: 457/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 123
lola: finding significant places
lola: 123 places, 334 transitions, 111 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 274 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-10a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t299) AND FIREABLE(t131) AND FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t257) OR (FIREABLE(t218) AND FIREABLE(t213))) AND (FIREABLE(t183) OR FIREABLE(t230) OR (FIREABLE(t193) AND FIREABLE(t145))) AND FIREABLE(t222)))) : A (G ((NOT FIREABLE(t191) OR NOT FIREABLE(t146) OR NOT FIREABLE(t35) OR (FIREABLE(t288) AND FIREABLE(t238))))) : A (G (NOT FIREABLE(t131))) : A (G ((NOT FIREABLE(t127) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t159)) OR (FIREABLE(t316) AND FIREABLE(t12) AND FIREABLE(t273) AND FIREABLE(t137) AND (NOT FIREABLE(t195) OR FIREABLE(t17)))))) : A (G (((NOT FIREABLE(t10) AND NOT FIREABLE(t206)) OR NOT FIREABLE(t98) OR FIREABLE(t209)))) : A (G (NOT FIREABLE(t130))) : E (F ((FIREABLE(t153) AND FIREABLE(t3) AND FIREABLE(t68) AND FIREABLE(t319) AND (FIREABLE(t36) OR FIREABLE(t199)) AND ((FIREABLE(t315) AND FIREABLE(t294)) OR FIREABLE(t77))))) : A (G (((NOT FIREABLE(t259) OR NOT FIREABLE(t135)) AND (NOT FIREABLE(t54) OR NOT FIREABLE(t202)) AND (FIREABLE(t298) OR NOT FIREABLE(t3))))) : E (F (((FIREABLE(t210) OR NOT FIREABLE(t187)) AND FIREABLE(t181) AND FIREABLE(t34)))) : E (F (FIREABLE(t125))) : E (F (((FIREABLE(t190) OR FIREABLE(t300) OR (FIREABLE(t264) AND FIREABLE(t228)) OR (FIREABLE(t112) AND FIREABLE(t98) AND FIREABLE(t50) AND FIREABLE(t221))) AND FIREABLE(t111)))) : E (F ((FIREABLE(t295) AND FIREABLE(t4) AND NOT FIREABLE(t58) AND FIREABLE(t96) AND NOT FIREABLE(t259)))) : E (F (((FIREABLE(t22) AND FIREABLE(t188) AND FIREABLE(t285) AND (FIREABLE(t157) OR FIREABLE(t54) OR NOT FIREABLE(t200))) OR FIREABLE(t13)))) : E (F ((FIREABLE(t258) AND FIREABLE(t68) AND NOT FIREABLE(t227) AND (FIREABLE(t110) OR FIREABLE(t86) OR (FIREABLE(t135) AND FIREABLE(t35))) AND FIREABLE(t128)))) : E (F (FIREABLE(t101))) : E (F (FIREABLE(t92)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t131)))
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(t131)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t131)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-0.sara
lola: lola: state equation: calling and running sara
========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-2 FALSE 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: A (G (NOT FIREABLE(t130)))
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(t130)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t130)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-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: 10 markings, 9 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t125)))
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(t125)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t125)
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: 10 markings, 9 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t101)))
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(t101)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t101)
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: 7 markings, 6 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-14 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 (FIREABLE(t92)))
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(t92)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t92)
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: 7 markings, 6 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-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 (((FIREABLE(t210) OR NOT FIREABLE(t187)) AND FIREABLE(t181) AND FIREABLE(t34))))
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(t210) OR NOT FIREABLE(t187)) AND FIREABLE(t181) AND FIREABLE(t34))))
lola: processed formula length: 86
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-ReachabilityFireability.tasksara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-0.sara.

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(t210) OR NOT FIREABLE(t187)) AND FIREABLE(t181) AND FIREABLE(t34))
lola: state equation: Generated DNF with 17 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-5-0.sara
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t10) AND NOT FIREABLE(t206)) OR NOT FIREABLE(t98) OR FIREABLE(t209))))
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(t10) AND NOT FIREABLE(t206)) OR NOT FIREABLE(t98) OR FIREABLE(t209))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 14 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: sara: place or transition ordering is non-deterministic
========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t191) OR NOT FIREABLE(t146) OR NOT FIREABLE(t35) OR (FIREABLE(t288) AND FIREABLE(t238)))))
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(t191) OR NOT FIREABLE(t146) OR NOT FIREABLE(t35) OR (FIREABLE(t288) AND FIREABLE(t238)))))
lola: processed formula length: 113
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t191) AND FIREABLE(t146) AND FIREABLE(t35) AND (NOT FIREABLE(t288) OR NOT FIREABLE(t238)))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-7-0.sara.

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-1 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: E (F ((FIREABLE(t295) AND FIREABLE(t4) AND NOT FIREABLE(t58) AND FIREABLE(t96) AND NOT FIREABLE(t259))))
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(t295) AND FIREABLE(t4) AND NOT FIREABLE(t58) AND FIREABLE(t96) AND NOT FIREABLE(t259))))
lola: processed formula length: 104
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t295) AND FIREABLE(t4) AND NOT FIREABLE(t58) AND FIREABLE(t96) AND NOT FIREABLE(t259))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t259) OR NOT FIREABLE(t135)) AND (NOT FIREABLE(t54) OR NOT FIREABLE(t202)) AND (FIREABLE(t298) OR NOT FIREABLE(t3)))))
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(t259) OR NOT FIREABLE(t135)) AND (NOT FIREABLE(t54) OR NOT FIREABLE(t202)) AND (FIREABLE(t298) OR NOT FIREABLE(t3)))))
lola: processed formula length: 142
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t259) AND FIREABLE(t135)) OR (FIREABLE(t54) AND FIREABLE(t202)) OR (NOT FIREABLE(t298) AND FIREABLE(t3)))
lola: state equation: Generated DNF with 15 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 9 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t22) AND FIREABLE(t188) AND FIREABLE(t285) AND (FIREABLE(t157) OR FIREABLE(t54) OR NOT FIREABLE(t200))) OR FIREABLE(t13))))
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(t22) AND FIREABLE(t188) AND FIREABLE(t285) AND (FIREABLE(t157) OR FIREABLE(t54) OR NOT FIREABLE(t200))) OR FIREABLE(t13))))
lola: processed formula length: 143
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t22) AND FIREABLE(t188) AND FIREABLE(t285) AND (FIREABLE(t157) OR FIREABLE(t54) OR NOT FIREABLE(t200))) OR FIREABLE(t13))
lola: state equation: Generated DNF with 27 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 15 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-12 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: E (F ((FIREABLE(t258) AND FIREABLE(t68) AND NOT FIREABLE(t227) AND (FIREABLE(t110) OR FIREABLE(t86) OR (FIREABLE(t135) AND FIREABLE(t35))) AND FIREABLE(t128))))
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(t258) AND FIREABLE(t68) AND NOT FIREABLE(t227) AND (FIREABLE(t110) OR FIREABLE(t86) OR (FIREABLE(t135) AND FIREABLE(t35))) AND FIREABLE(t128))))
lola: processed formula length: 162
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t258) AND FIREABLE(t68) AND NOT FIREABLE(t227) AND (FIREABLE(t110) OR FIREABLE(t86) OR (FIREABLE(t135) AND FIREABLE(t35))) AND FIREABLE(t128))
lola: state equation: Generated DNF with 56 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 287 markings, 355 edges

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t190) OR FIREABLE(t300) OR (FIREABLE(t264) AND FIREABLE(t228)) OR (FIREABLE(t112) AND FIREABLE(t98) AND FIREABLE(t50) AND FIREABLE(t221))) AND FIREABLE(t111))))
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(t190) OR FIREABLE(t300) OR (FIREABLE(t264) AND FIREABLE(t228)) OR (FIREABLE(t112) AND FIREABLE(t98) AND FIREABLE(t50) AND FIREABLE(t221))) AND FIREABLE(t111))))
lola: processed formula length: 180
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t190) OR FIREABLE(t300) OR (FIREABLE(t264) AND FIREABLE(t228)) OR (FIREABLE(t112) AND FIREABLE(t98) AND FIREABLE(t50) AND FIREABLE(t221))) AND FIREABLE(t111))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-10 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(t153) AND FIREABLE(t3) AND FIREABLE(t68) AND FIREABLE(t319) AND (FIREABLE(t36) OR FIREABLE(t199)) AND ((FIREABLE(t315) AND FIREABLE(t294)) OR FIREABLE(t77)))))
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(t153) AND FIREABLE(t3) AND FIREABLE(t68) AND FIREABLE(t319) AND (FIREABLE(t36) OR FIREABLE(t199)) AND ((FIREABLE(t315) AND FIREABLE(t294)) OR FIREABLE(t77)))))
lola: processed formula length: 177
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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:625
lola: formula 0: (FIREABLE(t153) AND FIREABLE(t3) AND FIREABLE(t68) AND FIREABLE(t319) AND (FIREABLE(t36) OR FIREABLE(t199)) AND ((FIREABLE(t315) AND FIREABLE(t294)) OR FIREABLE(t77)))
lola: state equation: Generated DNF with 42 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-13-0.sara
sara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-12-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-6 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: A (G ((NOT FIREABLE(t127) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t159)) OR (FIREABLE(t316) AND FIREABLE(t12) AND FIREABLE(t273) AND FIREABLE(t137) AND (NOT FIREABLE(t195) OR FIREABLE(t17))))))
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(t127) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t159)) OR (FIREABLE(t316) AND FIREABLE(t12) AND FIREABLE(t273) AND FIREABLE(t137) AND (NOT FIREABLE(t195) OR FIREABLE(t17))))))
lola: processed formula length: 194
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t127) AND (FIREABLE(t4) OR FIREABLE(t159)) AND (NOT FIREABLE(t316) OR NOT FIREABLE(t12) OR NOT FIREABLE(t273) OR NOT FIREABLE(t137) OR (FIREABLE(t195) AND NOT FIREABLE(t17))))
lola: state equation: Generated DNF with 68 literals and 13 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-3 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: E (F ((FIREABLE(t299) AND FIREABLE(t131) AND FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t257) OR (FIREABLE(t218) AND FIREABLE(t213))) AND (FIREABLE(t183) OR FIREABLE(t230) OR (FIREABLE(t193) AND FIREABLE(t145))) AND FIREABLE(t222))))
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(t299) AND FIREABLE(t131) AND FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t257) OR (FIREABLE(t218) AND FIREABLE(t213))) AND (FIREABLE(t183) OR FIREABLE(t230) OR (FIREABLE(t193) AND FIREABLE(t145))) AND FIREABLE(t222))))
lola: processed formula length: 240
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-10a-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(t299) AND FIREABLE(t131) AND FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t257) OR (FIREABLE(t218) AND FIREABLE(t213))) AND (FIREABLE(t183) OR FIREABLE(t230) OR (FIREABLE(t193) AND FIREABLE(t145))) AND FIREABLE(t222))
lola: state equation: Generated DNF with 162 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-10a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-10a-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA FlexibleBarrier-PT-10a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no no yes yes yes no yes yes yes yes
lola:
preliminary result: no yes no no no no no no yes yes yes no yes yes yes yes
lola: ========================================
lola: memory consumption: 15032 KB
lola: time consumption: 1 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="FlexibleBarrier-PT-10a"
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/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a 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 FlexibleBarrier-PT-10a, 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 r088-blw7-152649998100147"
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 ;