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 328K
-rw-r--r-- 1 mcc users 3.3K May 29 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 29 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 28 11:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 28 11:19 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 28 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 28 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 27 05:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 27 05:10 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:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 06:37 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 161K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145600333
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528046292558

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-17 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-17 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-17 @ 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: 1230/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 650
lola: finding significant places
lola: 650 places, 580 transitions, 542 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 716 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-17-ReachabilityFireability.task
lola: E (F ((FIREABLE(t329) AND NOT FIREABLE(t513)))) : A (G (NOT FIREABLE(t552))) : A (G ((FIREABLE(t113) OR FIREABLE(t136) OR (FIREABLE(t412) AND FIREABLE(t226)) OR FIREABLE(t358) OR FIREABLE(t175) OR (FIREABLE(t318) AND FIREABLE(t350)) OR FIREABLE(t484) OR FIREABLE(t252) OR NOT FIREABLE(t146)))) : A (G (((FIREABLE(t162) AND FIREABLE(t273)) OR NOT FIREABLE(t428)))) : E (F (((NOT FIREABLE(t457) AND FIREABLE(t413) AND (NOT FIREABLE(t510) OR NOT FIREABLE(t464))) OR FIREABLE(t109)))) : E (F (FIREABLE(t474))) : E (F (((FIREABLE(t42) OR FIREABLE(t399)) AND NOT FIREABLE(t508) AND (FIREABLE(t250) OR FIREABLE(t307)) AND NOT FIREABLE(t271) AND FIREABLE(t6) AND FIREABLE(t520) AND NOT FIREABLE(t270)))) : E (F ((FIREABLE(t216) AND FIREABLE(t38) AND (FIREABLE(t197) OR (NOT FIREABLE(t476) AND NOT FIREABLE(t13)))))) : E (F (FIREABLE(t288))) : A (G ((NOT FIREABLE(t417) OR (NOT FIREABLE(t453) AND NOT FIREABLE(t284) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t574)))))) : E (F (FIREABLE(t48))) : A (G (NOT FIREABLE(t370))) : E (F (FIREABLE(t222))) : E (F (((FIREABLE(t537) OR FIREABLE(t547)) AND (FIREABLE(t435) OR FIREABLE(t32))))) : E (F (FIREABLE(t40))) : E (F (FIREABLE(t559)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t552)))
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(t552)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t552)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12587 markings, 13943 edges
lola: ========================================

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

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

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-8 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(t48)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-2-0.sara.
lola: processed formula: E (F (FIREABLE(t48)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t48)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 360 markings, 375 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 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: A (G (NOT FIREABLE(t370)))
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(t370)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t370)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-4-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 not invariant.
lola: 12584 markings, 13940 edges

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t222)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t222)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t222)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 762 markings, 808 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 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-17-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: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 346 markings, 361 edges

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t559)))
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(t559)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t559)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-7-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: 12761 markings, 14141 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t329) AND NOT FIREABLE(t513))))
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(t329) AND NOT FIREABLE(t513))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t329) AND NOT FIREABLE(t513))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 360 markings, 375 edges

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t162) AND FIREABLE(t273)) OR NOT FIREABLE(t428))))
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(t162) AND FIREABLE(t273)) OR NOT FIREABLE(t428))))
lola: processed formula length: 68
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t162) OR NOT FIREABLE(t273)) AND FIREABLE(t428))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-9-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: 28 markings, 27 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t537) OR FIREABLE(t547)) AND (FIREABLE(t435) OR FIREABLE(t32)))))
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(t537) OR FIREABLE(t547)) AND (FIREABLE(t435) OR FIREABLE(t32)))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t537) OR FIREABLE(t547)) AND (FIREABLE(t435) OR FIREABLE(t32)))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-10-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-17-ReachabilityFireability-13 FALSE 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(t216) AND FIREABLE(t38) AND (FIREABLE(t197) OR (NOT FIREABLE(t476) AND NOT FIREABLE(t13))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t216) AND FIREABLE(t38) AND (FIREABLE(t197) OR (NOT FIREABLE(t476) AND NOT FIREABLE(t13))))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t38) AND (FIREABLE(t197) OR (NOT FIREABLE(t476) AND NOT FIREABLE(t13))))
lola: state equation: Generated DNF with 15 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 361 markings, 378 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-7 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 (((NOT FIREABLE(t457) AND FIREABLE(t413) AND (NOT FIREABLE(t510) OR NOT FIREABLE(t464))) OR FIREABLE(t109))))
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(t457) AND FIREABLE(t413) AND (NOT FIREABLE(t510) OR NOT FIREABLE(t464))) OR FIREABLE(t109))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t457) AND FIREABLE(t413) AND (NOT FIREABLE(t510) OR NOT FIREABLE(t464))) OR FIREABLE(t109))
lola: state equation: Generated DNF with 19 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-12-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: 37 markings, 36 edges

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-4 TRUE 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 ((NOT FIREABLE(t417) OR (NOT FIREABLE(t453) AND NOT FIREABLE(t284) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t574))))))
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(t417) OR (NOT FIREABLE(t453) AND NOT FIREABLE(t284) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t574))))))
lola: processed formula length: 124
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t417) AND (FIREABLE(t453) OR FIREABLE(t284) OR (FIREABLE(t273) AND FIREABLE(t574))))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 351 markings, 368 edges
lola:
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t42) OR FIREABLE(t399)) AND NOT FIREABLE(t508) AND (FIREABLE(t250) OR FIREABLE(t307)) AND NOT FIREABLE(t271) AND FIREABLE(t6) AND FIREABLE(t520) AND NOT FIREABLE(t270))))
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(t42) OR FIREABLE(t399)) AND NOT FIREABLE(t508) AND (FIREABLE(t250) OR FIREABLE(t307)) AND NOT FIREABLE(t271) AND FIREABLE(t6) AND FIREABLE(t520) AND NOT FIREABLE(t270))))
lola: processed formula length: 189
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t42) OR FIREABLE(t399)) AND NOT FIREABLE(t508) AND (FIREABLE(t250) OR FIREABLE(t307)) AND NOT FIREABLE(t271) AND FIREABLE(t6) AND FIREABLE(t520) AND NOT FIREABLE(t270))
lola: state equation: Generated DNF with 132 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-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-17-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t113) OR FIREABLE(t136) OR (FIREABLE(t412) AND FIREABLE(t226)) OR FIREABLE(t358) OR FIREABLE(t175) OR (FIREABLE(t318) AND FIREABLE(t350)) OR FIREABLE(t484) OR FIREABLE(t252) OR NOT FIREABLE(t146))))
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(t113) OR FIREABLE(t136) OR (FIREABLE(t412) AND FIREABLE(t226)) OR FIREABLE(t358) OR FIREABLE(t175) OR (FIREABLE(t318) AND FIREABLE(t350)) OR FIREABLE(t484) OR FIREABLE(t252) OR NOT FIREABLE(t146))))
lola: processed formula length: 222
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-17-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(t113) AND NOT FIREABLE(t136) AND (NOT FIREABLE(t412) OR NOT FIREABLE(t226)) AND NOT FIREABLE(t358) AND NOT FIREABLE(t175) AND (NOT FIREABLE(t318) OR NOT FIREABLE(t350)) AND NOT FIREABLE(t484) AND NOT FIREABLE(t252) AND FIREABLE(t146))
lola: state equation: Generated DNF with 108 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 817 markings, 869 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no yes no no yes no yes no yes yes
lola:
preliminary result: yes no no no yes yes no yes no no yes no yes no yes yes
lola: memory consumption: 15656 KB
lola: time consumption: 3 seconds

BK_STOP 1528046295278

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