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.5K May 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 28 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 28 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 28 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.2K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 27 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 06:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 85K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145400225
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527977081047

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-05 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 BusinessProcesses-PT-05 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-05 @ 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: 687/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 368
lola: finding significant places
lola: 368 places, 319 transitions, 311 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 401 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-05-ReachabilityFireability.task
lola: E (F ((FIREABLE(t183) OR FIREABLE(t2)))) : E (F ((FIREABLE(t96) AND FIREABLE(t218) AND FIREABLE(t46) AND FIREABLE(t99) AND FIREABLE(t217) AND FIREABLE(t275) AND (FIREABLE(t186) OR FIREABLE(t25)) AND FIREABLE(t78)))) : E (F ((FIREABLE(t15) AND FIREABLE(t99) AND FIREABLE(t150)))) : E (F ((FIREABLE(t226) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t175)) AND FIREABLE(t71)))) : E (F ((FIREABLE(t181) AND FIREABLE(t125) AND (NOT FIREABLE(t195) OR NOT FIREABLE(t174) OR FIREABLE(t37))))) : E (F ((NOT FIREABLE(t169) AND FIREABLE(t187) AND FIREABLE(t17)))) : A (G ((FIREABLE(t228) OR NOT FIREABLE(t93) OR (NOT FIREABLE(t108) AND NOT FIREABLE(t183) AND FIREABLE(t118))))) : E (F ((FIREABLE(t152) AND ((NOT FIREABLE(t50) AND FIREABLE(t286)) OR NOT FIREABLE(t179))))) : E (F ((NOT FIREABLE(t164) AND FIREABLE(t147) AND (FIREABLE(t154) OR FIREABLE(t105)) AND FIREABLE(t133)))) : E (F ((FIREABLE(t216) AND FIREABLE(t114) AND FIREABLE(t139) AND FIREABLE(t267)))) : E (F (FIREABLE(t308))) : A (G ((NOT FIREABLE(t211) OR FIREABLE(t312)))) : E (F (((FIREABLE(t300) OR FIREABLE(t13) OR FIREABLE(t217) OR FIREABLE(t127)) AND FIREABLE(t173)))) : A (G ((NOT FIREABLE(t274) OR NOT FIREABLE(t39) OR FIREABLE(t121) OR (NOT FIREABLE(t134) AND FIREABLE(t37))))) : A (G ((((NOT FIREABLE(t53) OR NOT FIREABLE(t172)) AND (NOT FIREABLE(t166) OR NOT FIREABLE(t43))) OR (FIREABLE(t200) AND FIREABLE(t132) AND NOT FIREABLE(t41))))) : A (G ((NOT FIREABLE(t131) OR NOT FIREABLE(t16) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t314)) OR FIREABLE(t36))))
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 (FIREABLE(t308)))
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(t308)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t308)
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: 56 markings, 55 edges
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-0.sara

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t183) OR FIREABLE(t2))))
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(t183) OR FIREABLE(t2))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t183) OR FIREABLE(t2))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-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: 20 markings, 19 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-0 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 ((NOT FIREABLE(t211) OR FIREABLE(t312))))
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(t211) OR FIREABLE(t312))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t211) AND NOT FIREABLE(t312))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-2-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: 104 markings, 103 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-11 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 ((FIREABLE(t15) AND FIREABLE(t99) AND FIREABLE(t150))))
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(t15) AND FIREABLE(t99) AND FIREABLE(t150))))
lola: processed formula length: 60
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t15) AND FIREABLE(t99) AND FIREABLE(t150))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 124 markings, 143 edges
lola:
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-2 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 ((NOT FIREABLE(t169) AND FIREABLE(t187) AND FIREABLE(t17))))
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 ((NOT FIREABLE(t169) AND FIREABLE(t187) AND FIREABLE(t17))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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: (NOT FIREABLE(t169) AND FIREABLE(t187) AND FIREABLE(t17))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-05-ReachabilityFireability-4-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 BusinessProcesses-PT-05-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t216) AND FIREABLE(t114) AND FIREABLE(t139) AND FIREABLE(t267))))
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(t216) AND FIREABLE(t114) AND FIREABLE(t139) AND FIREABLE(t267))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t216) AND FIREABLE(t114) AND FIREABLE(t139) AND FIREABLE(t267))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 37 markings, 37 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-9 FALSE 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: E (F ((FIREABLE(t226) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t175)) AND FIREABLE(t71))))
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(t226) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t175)) AND FIREABLE(t71))))
lola: processed formula length: 88
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t226) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t175)) AND FIREABLE(t71))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-05-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 54813 markings, 70817 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t152) AND ((NOT FIREABLE(t50) AND FIREABLE(t286)) OR NOT FIREABLE(t179)))))
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(t152) AND ((NOT FIREABLE(t50) AND FIREABLE(t286)) OR NOT FIREABLE(t179)))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t152) AND ((NOT FIREABLE(t50) AND FIREABLE(t286)) OR NOT FIREABLE(t179)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t228) OR NOT FIREABLE(t93) OR (NOT FIREABLE(t108) AND NOT FIREABLE(t183) AND FIREABLE(t118)))))
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(t228) OR NOT FIREABLE(t93) OR (NOT FIREABLE(t108) AND NOT FIREABLE(t183) AND FIREABLE(t118)))))
lola: processed formula length: 113
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t228) AND FIREABLE(t93) AND (FIREABLE(t108) OR FIREABLE(t183) OR NOT FIREABLE(t118)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-8-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: 81 markings, 80 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t181) AND FIREABLE(t125) AND (NOT FIREABLE(t195) OR NOT FIREABLE(t174) OR FIREABLE(t37)))))
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(t181) AND FIREABLE(t125) AND (NOT FIREABLE(t195) OR NOT FIREABLE(t174) OR FIREABLE(t37)))))
lola: processed formula length: 109
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t181) AND FIREABLE(t125) AND (NOT FIREABLE(t195) OR NOT FIREABLE(t174) OR FIREABLE(t37)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-9-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: 151 markings, 150 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t164) AND FIREABLE(t147) AND (FIREABLE(t154) OR FIREABLE(t105)) AND FIREABLE(t133))))
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 ((NOT FIREABLE(t164) AND FIREABLE(t147) AND (FIREABLE(t154) OR FIREABLE(t105)) AND FIREABLE(t133))))
lola: processed formula length: 106
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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: (NOT FIREABLE(t164) AND FIREABLE(t147) AND (FIREABLE(t154) OR FIREABLE(t105)) AND FIREABLE(t133))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-10-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: 30 markings, 29 edges

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t300) OR FIREABLE(t13) OR FIREABLE(t217) OR FIREABLE(t127)) AND FIREABLE(t173))))
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(t300) OR FIREABLE(t13) OR FIREABLE(t217) OR FIREABLE(t127)) AND FIREABLE(t173))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t300) OR FIREABLE(t13) OR FIREABLE(t217) OR FIREABLE(t127)) AND FIREABLE(t173))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-11-0.sara
lola: state equation: calling and running saralola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 139 markings, 138 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-12 TRUE 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(t274) OR NOT FIREABLE(t39) OR FIREABLE(t121) OR (NOT FIREABLE(t134) AND FIREABLE(t37)))))
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(t274) OR NOT FIREABLE(t39) OR FIREABLE(t121) OR (NOT FIREABLE(t134) AND FIREABLE(t37)))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t274) AND FIREABLE(t39) AND NOT FIREABLE(t121) AND (FIREABLE(t134) OR NOT FIREABLE(t37)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-05-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 635412 markings, 866770 edges, 127082 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1226323 markings, 1677857 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t131) OR NOT FIREABLE(t16) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t314)) OR FIREABLE(t36))))
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) OR NOT FIREABLE(t16) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t314)) OR FIREABLE(t36))))
lola: processed formula length: 115
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-05-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) AND FIREABLE(t16) AND (FIREABLE(t24) OR FIREABLE(t314)) AND NOT FIREABLE(t36))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 47 markings, 47 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t53) OR NOT FIREABLE(t172)) AND (NOT FIREABLE(t166) OR NOT FIREABLE(t43))) OR (FIREABLE(t200) AND FIREABLE(t132) AND NOT FIREABLE(t41)))))
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(t53) OR NOT FIREABLE(t172)) AND (NOT FIREABLE(t166) OR NOT FIREABLE(t43))) OR (FIREABLE(t200) AND FIREABLE(t132) AND NOT FIREABLE(t41)))))
lola: processed formula length: 163
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t53) AND FIREABLE(t172)) OR (FIREABLE(t166) AND FIREABLE(t43))) AND (NOT FIREABLE(t200) OR NOT FIREABLE(t132) OR FIREABLE(t41)))
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-14-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 151 markings, 150 edges
lola: ========================================

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t96) AND FIREABLE(t218) AND FIREABLE(t46) AND FIREABLE(t99) AND FIREABLE(t217) AND FIREABLE(t275) AND (FIREABLE(t186) OR FIREABLE(t25)) AND FIREABLE(t78))))
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(t96) AND FIREABLE(t218) AND FIREABLE(t46) AND FIREABLE(t99) AND FIREABLE(t217) AND FIREABLE(t275) AND (FIREABLE(t186) OR FIREABLE(t25)) AND FIREABLE(t78))))
lola: processed formula length: 173
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-05-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(t96) AND FIREABLE(t218) AND FIREABLE(t46) AND FIREABLE(t99) AND FIREABLE(t217) AND FIREABLE(t275) AND (FIREABLE(t186) OR FIREABLE(t25)) AND FIREABLE(t78))
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-05-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 66 markings, 72 edges

FORMULA BusinessProcesses-PT-05-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes yes no yes no yes yes no yes
lola:
preliminary result: yes no no no yes no no yes yes no yes no yes yes no yes
lola: memory consumption: 15100 KB
lola: time consumption: 10 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="BusinessProcesses-PT-05"
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/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 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 BusinessProcesses-PT-05, 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 r268-smll-152749145400225"
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 ;