About the Execution of LoLA for BusinessProcesses-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1985.680 | 443022.00 | 449144.00 | 973.70 | TFTFTTTTFTTTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.5K May 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 28 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 28 09:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 28 09:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 28 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.8K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 91K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145500252
=====================================================================
--------------------
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-08-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527998963520
info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-08 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-08 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ BusinessProcesses-PT-08 @ 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: 737/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 393
lola: finding significant places
lola: 393 places, 344 transitions, 335 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 425 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-08-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t155) AND FIREABLE(t306) AND ((FIREABLE(t330) AND FIREABLE(t165)) OR FIREABLE(t137))) OR ((FIREABLE(t45) OR FIREABLE(t55)) AND (FIREABLE(t289) OR FIREABLE(t55)) AND NOT FIREABLE(t220))))) : A (G (((NOT FIREABLE(t125) AND NOT FIREABLE(t7)) OR (NOT FIREABLE(t56) AND NOT FIREABLE(t269)) OR (NOT FIREABLE(t234) AND NOT FIREABLE(t209)) OR (FIREABLE(t107) AND FIREABLE(t232) AND FIREABLE(t215))))) : E (F (FIREABLE(t125))) : A (G ((NOT FIREABLE(t221) OR NOT FIREABLE(t251) OR (NOT FIREABLE(t156) AND NOT FIREABLE(t166)) OR NOT FIREABLE(t131)))) : A (G ((NOT FIREABLE(t235) OR FIREABLE(t88) OR FIREABLE(t307) OR NOT FIREABLE(t311) OR ((NOT FIREABLE(t23) OR NOT FIREABLE(t153)) AND ((FIREABLE(t99) AND FIREABLE(t151)) OR NOT FIREABLE(t277)))))) : E (F (FIREABLE(t169))) : E (F (FIREABLE(t340))) : E (F (FIREABLE(t213))) : A (G (((FIREABLE(t254) AND FIREABLE(t19)) OR NOT FIREABLE(t263) OR FIREABLE(t11) OR FIREABLE(t13)))) : E (F ((((NOT FIREABLE(t223) AND FIREABLE(t124)) OR FIREABLE(t14)) AND FIREABLE(t284)))) : A (G ((NOT FIREABLE(t296) OR FIREABLE(t302) OR (FIREABLE(t271) AND FIREABLE(t177))))) : A (G (NOT FIREABLE(t196))) : A (G ((FIREABLE(t45) OR FIREABLE(t46) OR NOT FIREABLE(t297) OR FIREABLE(t53) OR FIREABLE(t338) OR FIREABLE(t236) OR (NOT FIREABLE(t33) AND NOT FIREABLE(t298) AND (NOT FIREABLE(t122) OR NOT FIREABLE(t20)))))) : E (F (((FIREABLE(t92) OR FIREABLE(t133) OR NOT FIREABLE(t264)) AND FIREABLE(t123) AND FIREABLE(t81) AND FIREABLE(t227) AND FIREABLE(t98) AND FIREABLE(t299) AND NOT FIREABLE(t194)))) : E (F (FIREABLE(t161))) : E (F (((FIREABLE(t42) OR NOT FIREABLE(t200)) AND FIREABLE(t291))))
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(t125)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t125)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t125)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 95 markings, 94 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-2 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(t169)))
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(t169)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t169)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 113 markings, 112 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-5 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(t340)))
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(t340)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t340)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 66 markings, 65 edges
lola:
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t213)))
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(t213)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t213)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-3-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: 75 markings, 74 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-7 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(t196)))
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)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-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 invariant.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-11 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(t161)))
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(t161)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t161)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-08-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 785 markings, 803 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t42) OR NOT FIREABLE(t200)) AND FIREABLE(t291))))
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 NOT FIREABLE(t200)) AND FIREABLE(t291))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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 NOT FIREABLE(t200)) AND FIREABLE(t291))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 528 markings, 538 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-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(t296) OR FIREABLE(t302) OR (FIREABLE(t271) AND FIREABLE(t177)))))
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(t296) OR FIREABLE(t302) OR (FIREABLE(t271) AND FIREABLE(t177)))))
lola: processed formula length: 87
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t296) AND NOT FIREABLE(t302) AND (NOT FIREABLE(t271) OR NOT FIREABLE(t177)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-7-0.sara
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t223) AND FIREABLE(t124)) OR FIREABLE(t14)) AND FIREABLE(t284))))
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(t223) AND FIREABLE(t124)) OR FIREABLE(t14)) AND FIREABLE(t284))))
lola: processed formula length: 88
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t223) AND FIREABLE(t124)) OR FIREABLE(t14)) AND FIREABLE(t284))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-08-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 566175 markings, 783403 edges, 113235 markings/sec, 0 secs
lola: sara is running 5 secs || 1152057 markings, 1620131 edges, 117176 markings/sec, 5 secs
lola: sara is running 10 secs || 1728474 markings, 2465395 edges, 115283 markings/sec, 10 secs
lola: sara is running 15 secs || 2308050 markings, 3304199 edges, 115915 markings/sec, 15 secs
lola: sara is running 20 secs || 2889363 markings, 4135964 edges, 116263 markings/sec, 20 secs
lola: sara is running 25 secs || 3467840 markings, 4968191 edges, 115695 markings/sec, 25 secs
lola: sara is running 30 secs || 4039271 markings, 5803896 edges, 114286 markings/sec, 30 secs
lola: sara is running 35 secs || 4625217 markings, 6632488 edges, 117189 markings/sec, 35 secs
lola: sara is running 40 secs || 5202186 markings, 7465263 edges, 115394 markings/sec, 40 secs
lola: sara is running 45 secs || 5728565 markings, 8245070 edges, 105276 markings/sec, 45 secs
lola: sara is running 50 secs || 6278815 markings, 9013936 edges, 110050 markings/sec, 50 secs
lola: sara is running 55 secs || 6851097 markings, 9836099 edges, 114456 markings/sec, 55 secs
lola: sara is running 60 secs || 7423834 markings, 10672147 edges, 114547 markings/sec, 60 secs
lola: sara is running 65 secs || 8001743 markings, 11507487 edges, 115582 markings/sec, 65 secs
lola: sara is running 70 secs || 8582242 markings, 12334401 edges, 116100 markings/sec, 70 secs
lola: sara is running 75 secs || 9157136 markings, 13167498 edges, 114979 markings/sec, 75 secs
lola: sara is running 80 secs || 9712030 markings, 13980129 edges, 110979 markings/sec, 80 secs
lola: sara is running 85 secs || 10286956 markings, 14794589 edges, 114985 markings/sec, 85 secs
lola: sara is running 90 secs || 10859978 markings, 15623150 edges, 114604 markings/sec, 90 secs
lola: sara is running 95 secs || 11429805 markings, 16463575 edges, 113965 markings/sec, 95 secs
lola: sara is running 100 secs || 12021781 markings, 17295314 edges, 118395 markings/sec, 100 secs
lola: sara is running 105 secs || 12601190 markings, 18127771 edges, 115882 markings/sec, 105 secs
lola: sara is running 110 secs || 13172510 markings, 18968359 edges, 114264 markings/sec, 110 secs
lola: sara is running 115 secs || 13757455 markings, 19798062 edges, 116989 markings/sec, 115 secs
lola: sara is running 120 secs || 14335397 markings, 20626739 edges, 115588 markings/sec, 120 secs
lola: sara is running 125 secs || 14907034 markings, 21462063 edges, 114327 markings/sec, 125 secs
lola: sara is running 130 secs || 15480679 markings, 22296203 edges, 114729 markings/sec, 130 secs
lola: sara is running 135 secs || 16057287 markings, 23121157 edges, 115322 markings/sec, 135 secs
lola: sara is running 140 secs || 16630375 markings, 23948262 edges, 114618 markings/sec, 140 secs
lola: sara is running 145 secs || 17201492 markings, 24782427 edges, 114223 markings/sec, 145 secs
lola: sara is running 150 secs || 17786984 markings, 25608406 edges, 117098 markings/sec, 150 secs
lola: sara is running 155 secs || 18363173 markings, 26436919 edges, 115238 markings/sec, 155 secs
lola: sara is running 160 secs || 18930842 markings, 27276252 edges, 113534 markings/sec, 160 secs
lola: sara is running 165 secs || 19515391 markings, 28098116 edges, 116910 markings/sec, 165 secs
lola: sara is running 170 secs || 20090250 markings, 28925351 edges, 114972 markings/sec, 170 secs
lola: sara is running 175 secs || 20655634 markings, 29762710 edges, 113077 markings/sec, 175 secs
lola: sara is running 180 secs || 21233448 markings, 30586037 edges, 115563 markings/sec, 180 secs
lola: sara is running 185 secs || 21806670 markings, 31408689 edges, 114644 markings/sec, 185 secs
lola: sara is running 190 secs || 22375228 markings, 32236011 edges, 113712 markings/sec, 190 secs
lola: sara is running 195 secs || 22948724 markings, 33066610 edges, 114699 markings/sec, 195 secs
lola: sara is running 200 secs || 23530354 markings, 33893023 edges, 116326 markings/sec, 200 secs
lola: sara is running 205 secs || 24101623 markings, 34719749 edges, 114254 markings/sec, 205 secs
lola: sara is running 210 secs || 24670522 markings, 35551584 edges, 113780 markings/sec, 210 secs
lola: sara is running 215 secs || 25248430 markings, 36369941 edges, 115582 markings/sec, 215 secs
lola: sara is running 220 secs || 25818462 markings, 37192067 edges, 114006 markings/sec, 220 secs
lola: sara is running 225 secs || 26378255 markings, 38026119 edges, 111959 markings/sec, 225 secs
lola: sara is running 230 secs || 26960244 markings, 38842776 edges, 116398 markings/sec, 230 secs
lola: sara is running 235 secs || 27528912 markings, 39665263 edges, 113734 markings/sec, 235 secs
lola: sara is running 240 secs || 28092942 markings, 40494612 edges, 112806 markings/sec, 240 secs
lola: sara is running 245 secs || 28671113 markings, 41324950 edges, 115634 markings/sec, 245 secs
lola: sara is running 250 secs || 29250851 markings, 42151984 edges, 115948 markings/sec, 250 secs
lola: sara is running 255 secs || 29825644 markings, 42980757 edges, 114959 markings/sec, 255 secs
lola: sara is running 260 secs || 30395312 markings, 43812460 edges, 113934 markings/sec, 260 secs
lola: sara is running 265 secs || 30972206 markings, 44634103 edges, 115379 markings/sec, 265 secs
lola: sara is running 270 secs || 31543136 markings, 45458936 edges, 114186 markings/sec, 270 secs
lola: sara is running 275 secs || 32107068 markings, 46290600 edges, 112786 markings/sec, 275 secs
lola: sara is running 280 secs || 32686877 markings, 47109926 edges, 115962 markings/sec, 280 secs
lola: sara is running 285 secs || 33255890 markings, 47934299 edges, 113803 markings/sec, 285 secs
lola: sara is running 290 secs || 33815451 markings, 48769686 edges, 111912 markings/sec, 290 secs
lola: sara is running 295 secs || 34408937 markings, 49594887 edges, 118697 markings/sec, 295 secs
lola: sara is running 300 secs || 34985562 markings, 50424020 edges, 115325 markings/sec, 300 secs
lola: sara is running 305 secs || 35557694 markings, 51258581 edges, 114426 markings/sec, 305 secs
lola: sara is running 310 secs || 36131519 markings, 52087648 edges, 114765 markings/sec, 310 secs
lola: sara is running 315 secs || 36707958 markings, 52909246 edges, 115288 markings/sec, 315 secs
lola: sara is running 320 secs || 37278955 markings, 53736824 edges, 114199 markings/sec, 320 secs
lola: sara is running 325 secs || 37845824 markings, 54566202 edges, 113374 markings/sec, 325 secs
lola: sara is running 330 secs || 38422830 markings, 55383899 edges, 115401 markings/sec, 330 secs
lola: sara is running 335 secs || 38992887 markings, 56208534 edges, 114011 markings/sec, 335 secs
lola: sara is running 340 secs || 39558535 markings, 57042550 edges, 113130 markings/sec, 340 secs
lola: sara is running 345 secs || 40144973 markings, 57867743 edges, 117288 markings/sec, 345 secs
lola: sara is running 350 secs || 40719859 markings, 58694454 edges, 114977 markings/sec, 350 secs
lola: sara is running 355 secs || 41286365 markings, 59529435 edges, 113301 markings/sec, 355 secs
lola: sara is running 360 secs || 41866034 markings, 60351865 edges, 115934 markings/sec, 360 secs
lola: sara is running 365 secs || 42437011 markings, 61171711 edges, 114195 markings/sec, 365 secs
lola: sara is running 370 secs || 43002607 markings, 61999440 edges, 113119 markings/sec, 370 secs
lola: sara is running 375 secs || 43571254 markings, 62826580 edges, 113729 markings/sec, 375 secs
lola: sara is running 380 secs || 44144500 markings, 63647756 edges, 114649 markings/sec, 380 secs
lola: sara is running 385 secs || 44713978 markings, 64470588 edges, 113896 markings/sec, 385 secs
lola: sara is running 390 secs || 45283395 markings, 65303326 edges, 113883 markings/sec, 390 secs
lola: sara is running 395 secs || 45868912 markings, 66129760 edges, 117103 markings/sec, 395 secs
lola: sara is running 400 secs || 46444183 markings, 66959143 edges, 115054 markings/sec, 400 secs
lola: sara is running 405 secs || 47011807 markings, 67797460 edges, 113525 markings/sec, 405 secs
lola: sara is running 410 secs || 47593756 markings, 68617454 edges, 116390 markings/sec, 410 secs
lola: sara is running 415 secs || 48164103 markings, 69440224 edges, 114069 markings/sec, 415 secs
lola: sara is running 420 secs || 48726223 markings, 70274315 edges, 112424 markings/sec, 420 secs
lola: sara is running 425 secs || 49305315 markings, 71097407 edges, 115818 markings/sec, 425 secs
lola: sara is running 430 secs || 49876839 markings, 71920314 edges, 114305 markings/sec, 430 secs
lola: sara is running 435 secs || 50444676 markings, 72748890 edges, 113567 markings/sec, 435 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50660527 markings, 73077775 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t254) AND FIREABLE(t19)) OR NOT FIREABLE(t263) OR FIREABLE(t11) OR FIREABLE(t13))))
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(t254) AND FIREABLE(t19)) OR NOT FIREABLE(t263) OR FIREABLE(t11) OR FIREABLE(t13))))
lola: processed formula length: 103
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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: 739 markings, 757 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t221) OR NOT FIREABLE(t251) OR (NOT FIREABLE(t156) AND NOT FIREABLE(t166)) OR NOT FIREABLE(t131))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t221) OR NOT FIREABLE(t251) OR (NOT FIREABLE(t156) AND NOT FIREABLE(t166)) OR NOT FIREABLE(t131))))
lola: processed formula length: 122
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t221) AND FIREABLE(t251) AND (FIREABLE(t156) OR FIREABLE(t166)) AND FIREABLE(t131))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t155) AND FIREABLE(t306) AND ((FIREABLE(t330) AND FIREABLE(t165)) OR FIREABLE(t137))) OR ((FIREABLE(t45) OR FIREABLE(t55)) AND (FIREABLE(t289) OR FIREABLE(t55)) AND NOT FIREABLE(t220)))))
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(t155) AND FIREABLE(t306) AND ((FIREABLE(t330) AND FIREABLE(t165)) OR FIREABLE(t137))) OR ((FIREABLE(t45) OR FIREABLE(t55)) AND (FIREABLE(t289) OR FIREABLE(t55)) AND NOT FIREABLE(t220)))))
lola: processed formula length: 212
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t155) AND FIREABLE(t306) AND ((FIREABLE(t330) AND FIREABLE(t165)) OR FIREABLE(t137))) OR ((FIREABLE(t45) OR FIREABLE(t55)) AND (FIREABLE(t289) OR FIREABLE(t55)) AND NOT FIREABLE(t220)))
lola: state equation: Generated DNF with 25 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-08-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2926 markings, 3723 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t92) OR FIREABLE(t133) OR NOT FIREABLE(t264)) AND FIREABLE(t123) AND FIREABLE(t81) AND FIREABLE(t227) AND FIREABLE(t98) AND FIREABLE(t299) AND NOT FIREABLE(t194))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t92) OR FIREABLE(t133) OR NOT FIREABLE(t264)) AND FIREABLE(t123) AND FIREABLE(t81) AND FIREABLE(t227) AND FIREABLE(t98) AND FIREABLE(t299) AND NOT FIREABLE(t194))))
lola: processed formula length: 183
lola: 1 rewrites
lola: closed formula file BusinessProcesses-PT-08-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 19 markings, 18 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t125) AND NOT FIREABLE(t7)) OR (NOT FIREABLE(t56) AND NOT FIREABLE(t269)) OR (NOT FIREABLE(t234) AND NOT FIREABLE(t209)) OR (FIREABLE(t107) AND FIREABLE(t232) AND FIREABLE(t215)))))
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(t125) AND NOT FIREABLE(t7)) OR (NOT FIREABLE(t56) AND NOT FIREABLE(t269)) OR (NOT FIREABLE(t234) AND NOT FIREABLE(t209)) OR (FIREABLE(t107) AND FIREABLE(t232) AND FIREABLE(t215)))))
lola: processed formula length: 205
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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: 227 markings, 226 edges
lola: ========================================
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t235) OR FIREABLE(t88) OR FIREABLE(t307) OR NOT FIREABLE(t311) OR ((NOT FIREABLE(t23) OR NOT FIREABLE(t153)) AND ((FIREABLE(t99) AND FIREABLE(t151)) OR NOT FIREABLE(t277))))))
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(t235) OR FIREABLE(t88) OR FIREABLE(t307) OR NOT FIREABLE(t311) OR ((NOT FIREABLE(t23) OR NOT FIREABLE(t153)) AND ((FIREABLE(t99) AND FIREABLE(t151)) OR NOT FIREABLE(t277))))))
lola: processed formula length: 201
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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(t235) AND NOT FIREABLE(t88) AND NOT FIREABLE(t307) AND FIREABLE(t311) AND ((FIREABLE(t23) AND FIREABLE(t153)) OR ((NOT FIREABLE(t99) OR NOT FIREABLE(t151)) AND FIREABLE(t277))))
lola: state equation: Generated DNF with 72 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-08-ReachabilityFireability-14-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-08-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t45) OR FIREABLE(t46) OR NOT FIREABLE(t297) OR FIREABLE(t53) OR FIREABLE(t338) OR FIREABLE(t236) OR (NOT FIREABLE(t33) AND NOT FIREABLE(t298) AND (NOT FIREABLE(t122) OR NOT FIREABLE(t20))))))
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(t45) OR FIREABLE(t46) OR NOT FIREABLE(t297) OR FIREABLE(t53) OR FIREABLE(t338) OR FIREABLE(t236) OR (NOT FIREABLE(t33) AND NOT FIREABLE(t298) AND (NOT FIREABLE(t122) OR NOT FIREABLE(t20))))))
lola: processed formula length: 214
lola: 2 rewrites
lola: closed formula file BusinessProcesses-PT-08-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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t45) AND NOT FIREABLE(t46) AND FIREABLE(t297) AND NOT FIREABLE(t53) AND NOT FIREABLE(t338) AND NOT FIREABLE(t236) AND (FIREABLE(t33) OR FIREABLE(t298) OR (FIREABLE(t122) AND FIREABLE(t20))))
lola: state equation: Generated DNF with 66 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-08-ReachabilityFireability-15-0.sara
FORMULA BusinessProcesses-PT-08-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes yes no yes yes yes yes no yes yes
lola:
preliminary result: yes no yes no yes yes yes yes no yes yes yes yes no yes yes
lola: lola: state equation: calling and running sara
========================================
sara: try reading problem file BusinessProcesses-PT-08-ReachabilityFireability-15-0.sara.
lola: memory consumption: 15152 KB
lola: time consumption: 443 seconds
sara: place or transition ordering is non-deterministic
BK_STOP 1527999406542
--------------------
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-08"
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-08.tgz
mv BusinessProcesses-PT-08 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-08, 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-152749145500252"
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 '
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 ;