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 260K
-rw-r--r-- 1 mcc users 3.7K May 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K 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.5K 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:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 28 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.2K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.8K 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-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145500234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527984437492

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-06 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-06 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-06 @ 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: 673/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 376
lola: finding significant places
lola: 376 places, 297 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 381 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-06-ReachabilityFireability.task
lola: A (G ((FIREABLE(t195) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t174)) OR (NOT FIREABLE(t250) AND NOT FIREABLE(t256) AND NOT FIREABLE(t104) AND NOT FIREABLE(t32))))) : A (G (((FIREABLE(t159) AND FIREABLE(t169)) OR NOT FIREABLE(t231)))) : A (G ((NOT FIREABLE(t196) OR NOT FIREABLE(t148) OR (NOT FIREABLE(t188) AND NOT FIREABLE(t251)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t243) AND NOT FIREABLE(t144))))) : E (F (FIREABLE(t209))) : A (G ((NOT FIREABLE(t226) OR NOT FIREABLE(t106) OR (NOT FIREABLE(t204) AND (FIREABLE(t172) OR FIREABLE(t178))) OR (FIREABLE(t65) AND (NOT FIREABLE(t293) OR NOT FIREABLE(t228)))))) : E (F (((FIREABLE(t84) OR FIREABLE(t113)) AND FIREABLE(t24)))) : A (G (((NOT FIREABLE(t180) AND NOT FIREABLE(t127)) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t283)) OR NOT FIREABLE(t182)))) : E (F ((FIREABLE(t167) AND FIREABLE(t221) AND NOT FIREABLE(t203)))) : A (G ((NOT FIREABLE(t12) OR FIREABLE(t157)))) : E (F ((FIREABLE(t281) AND FIREABLE(t167)))) : E (F (((FIREABLE(t210) OR FIREABLE(t193) OR FIREABLE(t134)) AND (FIREABLE(t124) OR NOT FIREABLE(t50)) AND FIREABLE(t7)))) : E (F ((FIREABLE(t151) AND (FIREABLE(t36) OR (FIREABLE(t56) AND FIREABLE(t90) AND FIREABLE(t267)))))) : A (G ((((NOT FIREABLE(t213) OR NOT FIREABLE(t216)) AND (NOT FIREABLE(t293) OR NOT FIREABLE(t121))) OR NOT FIREABLE(t133)))) : A (G (NOT FIREABLE(t75))) : E (F ((FIREABLE(t259) OR FIREABLE(t264)))) : A (G ((NOT FIREABLE(t19) AND (FIREABLE(t247) OR FIREABLE(t43) OR FIREABLE(t140) OR NOT FIREABLE(t11) OR (FIREABLE(t67) AND FIREABLE(t212))))))
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(t209)))
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(t209)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t209)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-3 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: A (G (NOT FIREABLE(t75)))
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(t75)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t75)
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 invariant.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-13 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: E (F ((FIREABLE(t281) AND FIREABLE(t167))))
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(t281) AND FIREABLE(t167))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t281) AND FIREABLE(t167))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-2-0.sara
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t12) OR FIREABLE(t157))))
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(t12) OR FIREABLE(t157))))
lola: processed formula length: 46
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t12) AND NOT FIREABLE(t157))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-06-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 777 markings, 867 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t259) OR FIREABLE(t264))))
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(t259) OR FIREABLE(t264))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t259) OR FIREABLE(t264))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-14 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(t84) OR FIREABLE(t113)) AND FIREABLE(t24))))
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(t84) OR FIREABLE(t113)) AND FIREABLE(t24))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t84) OR FIREABLE(t113)) AND FIREABLE(t24))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-5-0.sara
sara: try reading problem file BusinessProcesses-PT-06-ReachabilityFireability-4-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-06-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 13528 markings, 16955 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-5 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(t167) AND FIREABLE(t221) AND NOT FIREABLE(t203))))
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(t167) AND FIREABLE(t221) AND NOT FIREABLE(t203))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t167) AND FIREABLE(t221) AND NOT FIREABLE(t203))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-7 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: A (G (((FIREABLE(t159) AND FIREABLE(t169)) OR NOT FIREABLE(t231))))
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(t159) AND FIREABLE(t169)) OR NOT FIREABLE(t231))))
lola: processed formula length: 68
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t159) OR NOT FIREABLE(t169)) AND FIREABLE(t231))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-7-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: 98 markings, 97 edges

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-1 FALSE 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 ((((NOT FIREABLE(t213) OR NOT FIREABLE(t216)) AND (NOT FIREABLE(t293) OR NOT FIREABLE(t121))) OR NOT FIREABLE(t133))))
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(t213) OR NOT FIREABLE(t216)) AND (NOT FIREABLE(t293) OR NOT FIREABLE(t121))) OR NOT FIREABLE(t133))))
lola: processed formula length: 126
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t213) AND FIREABLE(t216)) OR (FIREABLE(t293) AND FIREABLE(t121))) 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-06-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-06-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 862 markings, 1105 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t180) AND NOT FIREABLE(t127)) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t283)) OR NOT FIREABLE(t182))))
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(t180) AND NOT FIREABLE(t127)) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t283)) OR NOT FIREABLE(t182))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t180) OR FIREABLE(t127)) AND (FIREABLE(t48) OR FIREABLE(t283)) AND FIREABLE(t182))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-06-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.

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t151) AND (FIREABLE(t36) OR (FIREABLE(t56) AND FIREABLE(t90) 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(t151) AND (FIREABLE(t36) OR (FIREABLE(t56) AND FIREABLE(t90) AND FIREABLE(t267))))))
lola: processed formula length: 101
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t151) AND (FIREABLE(t36) OR (FIREABLE(t56) AND FIREABLE(t90) AND FIREABLE(t267))))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-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: 111 markings, 110 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-11 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(t210) OR FIREABLE(t193) OR FIREABLE(t134)) AND (FIREABLE(t124) OR NOT FIREABLE(t50)) AND FIREABLE(t7))))
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 FIREABLE(t193) OR FIREABLE(t134)) AND (FIREABLE(t124) OR NOT FIREABLE(t50)) AND FIREABLE(t7))))
lola: processed formula length: 124
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t210) OR FIREABLE(t193) OR FIREABLE(t134)) AND (FIREABLE(t124) OR NOT FIREABLE(t50)) AND FIREABLE(t7))
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-11-0.sara
sara: try reading problem file BusinessProcesses-PT-06-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: 26 markings, 25 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-10 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(t196) OR NOT FIREABLE(t148) OR (NOT FIREABLE(t188) AND NOT FIREABLE(t251)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t243) AND NOT FIREABLE(t144)))))
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(t196) OR NOT FIREABLE(t148) OR (NOT FIREABLE(t188) AND NOT FIREABLE(t251)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t243) AND NOT FIREABLE(t144)))))
lola: processed formula length: 168
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t196) AND FIREABLE(t148) AND (FIREABLE(t188) OR FIREABLE(t251)) AND (FIREABLE(t3) OR FIREABLE(t243) OR FIREABLE(t144)))
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 53 markings, 52 edges

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t195) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t174)) OR (NOT FIREABLE(t250) AND NOT FIREABLE(t256) AND NOT FIREABLE(t104) AND NOT FIREABLE(t32)))))
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(t195) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t174)) OR (NOT FIREABLE(t250) AND NOT FIREABLE(t256) AND NOT FIREABLE(t104) AND NOT FIREABLE(t32)))))
lola: processed formula length: 163
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t195) AND (FIREABLE(t0) OR FIREABLE(t174)) AND (FIREABLE(t250) OR FIREABLE(t256) OR FIREABLE(t104) OR FIREABLE(t32)))
lola: state equation: Generated DNF with 52 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-0 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(t19) AND (FIREABLE(t247) OR FIREABLE(t43) OR FIREABLE(t140) OR NOT FIREABLE(t11) OR (FIREABLE(t67) AND FIREABLE(t212))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: 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
state equation: calling and running saralola: processed formula: A (G ((NOT FIREABLE(t19) AND (FIREABLE(t247) OR FIREABLE(t43) OR FIREABLE(t140) OR NOT FIREABLE(t11) OR (FIREABLE(t67) AND FIREABLE(t212))))))
lola: processed formula length: 146
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t19) OR (NOT FIREABLE(t247) AND NOT FIREABLE(t43) AND NOT FIREABLE(t140) AND FIREABLE(t11) AND (NOT FIREABLE(t67) OR NOT FIREABLE(t212))))
lola: state equation: Generated DNF with 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 234 markings, 256 edges
sara: try reading problem file BusinessProcesses-PT-06-ReachabilityFireability-13-0.sara.
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t226) OR NOT FIREABLE(t106) OR (NOT FIREABLE(t204) AND (FIREABLE(t172) OR FIREABLE(t178))) OR (FIREABLE(t65) AND (NOT FIREABLE(t293) OR NOT FIREABLE(t228))))))
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(t226) OR NOT FIREABLE(t106) OR (NOT FIREABLE(t204) AND (FIREABLE(t172) OR FIREABLE(t178))) OR (FIREABLE(t65) AND (NOT FIREABLE(t293) OR NOT FIREABLE(t228))))))
lola: processed formula length: 184
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-06-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(t226) AND FIREABLE(t106) AND (FIREABLE(t204) OR (NOT FIREABLE(t172) AND NOT FIREABLE(t178))) AND (NOT FIREABLE(t65) OR (FIREABLE(t293) AND FIREABLE(t228))))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityFireability-15-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: 17 markings, 16 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no no no yes yes no yes yes no
lola:
preliminary result: no no no yes no no yes no no no yes yes no yes yes no
lola: memory consumption: 15124 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic
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-06"
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-06.tgz
mv BusinessProcesses-PT-06 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-06, 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-152749145500234"
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 ;