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 4.2K May 29 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 28 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.4K May 28 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 28 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 2.8K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.5K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 79K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145400216
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527969719635

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-04 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-04 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-04 @ 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: 571/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 288 places, 283 transitions, 244 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 335 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-04-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t84) AND NOT FIREABLE(t264) AND FIREABLE(t148) AND (FIREABLE(t7) OR (FIREABLE(t151) AND FIREABLE(t270)) OR FIREABLE(t92))))) : E (F (FIREABLE(t140))) : E (F (((FIREABLE(t234) AND FIREABLE(t180) AND NOT FIREABLE(t45) AND (FIREABLE(t243) OR FIREABLE(t252) OR NOT FIREABLE(t190))) OR FIREABLE(t171)))) : E (F (FIREABLE(t40))) : A (G ((NOT FIREABLE(t23) OR NOT FIREABLE(t67) OR FIREABLE(t124) OR NOT FIREABLE(t5)))) : A (G (((NOT FIREABLE(t270) OR NOT FIREABLE(t212)) AND (NOT FIREABLE(t28) OR NOT FIREABLE(t8) OR NOT FIREABLE(t16))))) : A (G ((NOT FIREABLE(t14) OR NOT FIREABLE(t78) OR FIREABLE(t86) OR NOT FIREABLE(t119)))) : A (G (NOT FIREABLE(t116))) : E (F (((FIREABLE(t50) OR FIREABLE(t68)) AND (FIREABLE(t151) OR FIREABLE(t280)) AND (NOT FIREABLE(t61) OR FIREABLE(t232)) AND FIREABLE(t55)))) : A (G ((NOT FIREABLE(t95) OR (NOT FIREABLE(t278) AND NOT FIREABLE(t149) AND FIREABLE(t216))))) : E (F (((FIREABLE(t140) AND ((FIREABLE(t195) AND FIREABLE(t62)) OR (FIREABLE(t169) AND FIREABLE(t51)))) OR FIREABLE(t142)))) : E (F (FIREABLE(t144))) : E (F (FIREABLE(t187))) : E (F (FIREABLE(t275))) : A (G ((NOT FIREABLE(t112) OR NOT FIREABLE(t275) OR FIREABLE(t238) OR NOT FIREABLE(t124)))) : E (F (FIREABLE(t9)))
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(t140)))
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(t140)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t140)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t40)))
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(t40)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t40)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-0.sara
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-3 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(t116)))
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(t116)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-04-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: 12 markings, 11 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-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: E (F (FIREABLE(t144)))
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(t144)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t144)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-3-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-11 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(t187)))
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(t187)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t187)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-4-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: 202 markings, 278 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-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(t275)))
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(t275)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t275)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-5-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 BusinessProcesses-PT-04-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t9)))
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(t9)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t9)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-15 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(t23) OR NOT FIREABLE(t67) OR FIREABLE(t124) OR NOT FIREABLE(t5))))
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(t23) OR NOT FIREABLE(t67) OR FIREABLE(t124) OR NOT FIREABLE(t5))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t23) AND FIREABLE(t67) AND NOT FIREABLE(t124) AND FIREABLE(t5))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-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 BusinessProcesses-PT-04-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t95) OR (NOT FIREABLE(t278) AND NOT FIREABLE(t149) AND FIREABLE(t216)))))
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(t95) OR (NOT FIREABLE(t278) AND NOT FIREABLE(t149) AND FIREABLE(t216)))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t95) AND (FIREABLE(t278) OR FIREABLE(t149) OR NOT FIREABLE(t216)))
lola: state equation: Generated DNF with 12 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-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: 45 markings, 44 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-9 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(t112) OR NOT FIREABLE(t275) OR FIREABLE(t238) OR NOT FIREABLE(t124))))
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(t112) OR NOT FIREABLE(t275) OR FIREABLE(t238) OR NOT FIREABLE(t124))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t112) AND FIREABLE(t275) AND NOT FIREABLE(t238) AND FIREABLE(t124))
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-9-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 BusinessProcesses-PT-04-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t14) OR NOT FIREABLE(t78) OR FIREABLE(t86) OR NOT FIREABLE(t119))))
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(t14) OR NOT FIREABLE(t78) OR FIREABLE(t86) OR NOT FIREABLE(t119))))
lola: processed formula length: 90
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t14) AND FIREABLE(t78) AND NOT FIREABLE(t86) AND FIREABLE(t119))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-10-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 BusinessProcesses-PT-04-ReachabilityFireability-6 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(t270) OR NOT FIREABLE(t212)) AND (NOT FIREABLE(t28) OR NOT FIREABLE(t8) OR NOT FIREABLE(t16)))))
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(t270) OR NOT FIREABLE(t212)) AND (NOT FIREABLE(t28) OR NOT FIREABLE(t8) OR NOT FIREABLE(t16)))))
lola: processed formula length: 120
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t270) AND FIREABLE(t212)) OR (FIREABLE(t28) AND FIREABLE(t8) AND FIREABLE(t16)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-11-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 BusinessProcesses-PT-04-ReachabilityFireability-5 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: E (F (((FIREABLE(t140) AND ((FIREABLE(t195) AND FIREABLE(t62)) OR (FIREABLE(t169) AND FIREABLE(t51)))) OR FIREABLE(t142))))
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(t140) AND ((FIREABLE(t195) AND FIREABLE(t62)) OR (FIREABLE(t169) AND FIREABLE(t51)))) OR FIREABLE(t142))))
lola: processed formula length: 125
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t140) AND ((FIREABLE(t195) AND FIREABLE(t62)) OR (FIREABLE(t169) AND FIREABLE(t51)))) OR FIREABLE(t142))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3878 markings, 6872 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-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 ((NOT FIREABLE(t84) AND NOT FIREABLE(t264) AND FIREABLE(t148) AND (FIREABLE(t7) OR (FIREABLE(t151) AND FIREABLE(t270)) OR 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 ((NOT FIREABLE(t84) AND NOT FIREABLE(t264) AND FIREABLE(t148) AND (FIREABLE(t7) OR (FIREABLE(t151) AND FIREABLE(t270)) OR FIREABLE(t92)))))
lola: processed formula length: 146
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t84) AND NOT FIREABLE(t264) AND FIREABLE(t148) AND (FIREABLE(t7) OR (FIREABLE(t151) AND FIREABLE(t270)) OR FIREABLE(t92)))
lola: state equation: Generated DNF with 45 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-0 TRUE 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(t50) OR FIREABLE(t68)) AND (FIREABLE(t151) OR FIREABLE(t280)) AND (NOT FIREABLE(t61) OR FIREABLE(t232)) AND FIREABLE(t55))))
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(t50) OR FIREABLE(t68)) AND (FIREABLE(t151) OR FIREABLE(t280)) AND (NOT FIREABLE(t61) OR FIREABLE(t232)) AND FIREABLE(t55))))
lola: processed formula length: 144
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t50) OR FIREABLE(t68)) AND (FIREABLE(t151) OR FIREABLE(t280)) AND (NOT FIREABLE(t61) OR FIREABLE(t232)) AND FIREABLE(t55))
lola: state equation: Generated DNF with 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-14-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-04-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t234) AND FIREABLE(t180) AND NOT FIREABLE(t45) AND (FIREABLE(t243) OR FIREABLE(t252) OR NOT FIREABLE(t190))) OR FIREABLE(t171))))
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(t234) AND FIREABLE(t180) AND NOT FIREABLE(t45) AND (FIREABLE(t243) OR FIREABLE(t252) OR NOT FIREABLE(t190))) OR FIREABLE(t171))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-04-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(t234) AND FIREABLE(t180) AND NOT FIREABLE(t45) AND (FIREABLE(t243) OR FIREABLE(t252) OR NOT FIREABLE(t190))) OR FIREABLE(t171))
lola: state equation: Generated DNF with 23 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-04-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA BusinessProcesses-PT-04-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes yes no no no yes yes yes no yes yes
lola:
preliminary result: yes yes yes yes yes yes yes no no no yes yes yes no yes yes
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-04-ReachabilityFireability-15-0.sara.
lola: memory consumption: 15024 KB
lola: time consumption: 2 seconds
sara: place or transition ordering is non-deterministic


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-04"
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-04.tgz
mv BusinessProcesses-PT-04 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-04, 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-152749145400216"
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 ;