fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r268-smll-152749145600328
Last Updated
June 26, 2018

About the Execution of LoLA for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.420 3600000.00 3292454.00 36751.40 FT??FT?TTT??TF?F 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 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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145600328

=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528042629115

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 CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ 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-CTLFireability.task
lola: E (((FIREABLE(t544) AND A (G (FIREABLE(t117)))) U E (F ((FIREABLE(t554) AND FIREABLE(t441)))))) : E (F (FIREABLE(t377))) : (E (F ((FIREABLE(t186) OR (FIREABLE(t106) AND FIREABLE(t529) AND (FIREABLE(t85) OR FIREABLE(t379)))))) OR NOT(A ((FIREABLE(t560) U NOT FIREABLE(t460))))) : (E (F ((A (G (FIREABLE(t375))) AND (NOT FIREABLE(t558) AND NOT FIREABLE(t485))))) AND E (F (A (F (NOT FIREABLE(t490)))))) : NOT(E (F ((FIREABLE(t414) OR FIREABLE(t502))))) : A (((NOT FIREABLE(t169) OR (NOT FIREABLE(t285) AND NOT FIREABLE(t60))) U (A (F (FIREABLE(t534))) OR E (F (FIREABLE(t463)))))) : (A (G ((A (G (FIREABLE(t261))) OR NOT FIREABLE(t408)))) AND A (F ((E (F (FIREABLE(t543))) OR ((FIREABLE(t529) AND FIREABLE(t236)) OR FIREABLE(t59)))))) : NOT(A (G (E (F ((FIREABLE(t398) OR FIREABLE(t403))))))) : ((E (X ((FIREABLE(t106) AND FIREABLE(t330) AND FIREABLE(t497)))) OR E (F (E (F (FIREABLE(t548)))))) AND (((NOT FIREABLE(t259) OR NOT FIREABLE(t67) OR (NOT FIREABLE(t487) AND FIREABLE(t451))) AND ((NOT FIREABLE(t540) AND FIREABLE(t348)) OR NOT FIREABLE(t133))) OR (FIREABLE(t127) AND E (X ((FIREABLE(t245) AND FIREABLE(t349))))))) : (A ((E (X (FIREABLE(t479))) U E (G (FIREABLE(t21))))) OR E (F (A (X ((FIREABLE(t270) AND FIREABLE(t502))))))) : (FIREABLE(t97) OR E (G ((E (F (FIREABLE(t467))) OR E (F (FIREABLE(t310))))))) : A (G (NOT(E ((FIREABLE(t169) U FIREABLE(t535)))))) : E (X (E (X (E (F (FIREABLE(t332))))))) : A (F ((A (G (NOT FIREABLE(t473))) OR FIREABLE(t140)))) : E (F (NOT(NOT(A (G (FIREABLE(t376))))))) : (((FIREABLE(t226) AND (FIREABLE(t323) OR FIREABLE(t505) OR NOT FIREABLE(t32) OR FIREABLE(t35))) OR ((A (X (FIREABLE(t92))) OR (NOT FIREABLE(t193) OR NOT FIREABLE(t76))) AND E (F ((FIREABLE(t26) AND FIREABLE(t127)))))) OR (((FIREABLE(t569) OR A (X (FIREABLE(t483)))) AND E ((FIREABLE(t256) U FIREABLE(t226)))) OR E (G (A (F (FIREABLE(t250)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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 (X ((FIREABLE(t106) AND FIREABLE(t330) AND FIREABLE(t497)))) OR E (F (FIREABLE(t548)))) AND (((NOT FIREABLE(t259) OR NOT FIREABLE(t67) OR (NOT FIREABLE(t487) AND FIREABLE(t451))) AND ((NOT FIREABLE(t540) AND FIREABLE(t348)) OR NOT FIREABLE(t133))) OR (FIREABLE(t127) AND E (X ((FIREABLE(t245) AND FIREABLE(t349)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t127)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t127)
lola: processed formula length: 14
lola: 26 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t548)))
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(t548)))
lola: processed formula length: 22
lola: 27 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.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(t548)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-CTLFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-CTLFireability-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: 12587 markings, 13943 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t259) OR NOT FIREABLE(t67) OR (NOT FIREABLE(t487) AND FIREABLE(t451))) AND ((NOT FIREABLE(t540) AND FIREABLE(t348)) OR NOT FIREABLE(t133)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t259) OR NOT FIREABLE(t67) OR (NOT FIREABLE(t487) AND FIREABLE(t451))) AND ((NOT FIREABLE(t540) AND FIREABLE(t348)) OR NOT FIREABLE(t133)))
lola: processed formula length: 157
lola: 26 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-8 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 ((E (X (FIREABLE(t479))) U E (G (FIREABLE(t21))))) OR E (F (A (X ((FIREABLE(t270) AND FIREABLE(t502)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (A(EX(FIREABLE(t479)) U NOT(A(TRUE U NOT FIREABLE(t21)))) OR E(TRUE U AX((FIREABLE(t270) AND FIREABLE(t502)))))
lola: processed formula length: 111
lola: 32 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 374 markings, 377 edges
lola:
========================================
FORMULA BusinessProcesses-PT-17-CTLFireability-9 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 (X (E (X (E (F (FIREABLE(t332)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX(E(TRUE U FIREABLE(t332))))
lola: processed formula length: 32
lola: 29 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 112 markings, 111 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-12 TRUE 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: ((FIREABLE(t226) AND (FIREABLE(t323) OR FIREABLE(t505) OR NOT FIREABLE(t32) OR FIREABLE(t35))) OR (((A (X (FIREABLE(t92))) OR (NOT FIREABLE(t193) OR NOT FIREABLE(t76))) AND E (F ((FIREABLE(t26) AND FIREABLE(t127))))) OR (((FIREABLE(t569) OR A (X (FIREABLE(t483)))) AND E ((FIREABLE(t256) U FIREABLE(t226)))) OR E (G (A (F (FIREABLE(t250))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t569)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t569)
lola: processed formula length: 14
lola: 26 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t193) OR NOT FIREABLE(t76))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t193) OR NOT FIREABLE(t76))
lola: processed formula length: 42
lola: 26 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t226) AND (FIREABLE(t323) OR FIREABLE(t505) OR NOT FIREABLE(t32) OR FIREABLE(t35)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t226) AND (FIREABLE(t323) OR FIREABLE(t505) OR NOT FIREABLE(t32) OR FIREABLE(t35)))
lola: processed formula length: 96
lola: 26 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t256) U FIREABLE(t226)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((FIREABLE(t256) U FIREABLE(t226)))
lola: processed formula length: 37
lola: 29 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(t226)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-CTLFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t26) AND FIREABLE(t127))))
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(t26) AND FIREABLE(t127))))
lola: processed formula length: 42
lola: 27 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.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)
sara: try reading problem file BusinessProcesses-PT-17-CTLFireability-6-0.sara.
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(t26) AND FIREABLE(t127))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-CTLFireability-7-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: 13191 markings, 14844 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (FIREABLE(t250)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U FIREABLE(t250)))))
lola: processed formula length: 44
lola: 28 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 291 markings, 292 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-15 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(t377)))
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(t377)))
lola: processed formula length: 22
lola: 27 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.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(t377)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-CTLFireability-4-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: 13065 markings, 14491 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-1 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(t554) AND FIREABLE(t441))))
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(t554) AND FIREABLE(t441))))
lola: processed formula length: 43
lola: 27 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.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(t554) AND FIREABLE(t441))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-0 FALSE 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: A (G ((NOT FIREABLE(t414) AND NOT FIREABLE(t502))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(t414) AND NOT FIREABLE(t502))))
lola: processed formula length: 51
lola: 28 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.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:695
lola: formula 0: (FIREABLE(t414) OR FIREABLE(t502))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-17-CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BusinessProcesses-PT-17-CTLFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t376)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t376)
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 164822 markings, 939162 edges, 32964 markings/sec, 0 secs
lola: 307872 markings, 1920524 edges, 28610 markings/sec, 5 secs
lola: 449075 markings, 2858022 edges, 28241 markings/sec, 10 secs
lola: 595044 markings, 3840013 edges, 29194 markings/sec, 15 secs
lola: 726456 markings, 4819147 edges, 26282 markings/sec, 20 secs
lola: 852679 markings, 5794565 edges, 25245 markings/sec, 25 secs
lola: 987424 markings, 6769600 edges, 26949 markings/sec, 30 secs
lola: 1124101 markings, 7749614 edges, 27335 markings/sec, 35 secs
lola: 1248709 markings, 8724241 edges, 24922 markings/sec, 40 secs
lola: 1372648 markings, 9695357 edges, 24788 markings/sec, 45 secs
lola: 1519672 markings, 10675291 edges, 29405 markings/sec, 50 secs
lola: 1651229 markings, 11651418 edges, 26311 markings/sec, 55 secs
lola: 1776546 markings, 12622016 edges, 25063 markings/sec, 60 secs
lola: 1909143 markings, 13594837 edges, 26519 markings/sec, 65 secs
lola: 2047644 markings, 14573119 edges, 27700 markings/sec, 70 secs
lola: 2171822 markings, 15548511 edges, 24836 markings/sec, 75 secs
lola: 2296298 markings, 16519255 edges, 24895 markings/sec, 80 secs
lola: 2411867 markings, 17490194 edges, 23114 markings/sec, 85 secs
lola: 2530046 markings, 18457401 edges, 23636 markings/sec, 90 secs
lola: 2649645 markings, 19425150 edges, 23920 markings/sec, 95 secs
lola: 2758085 markings, 20390799 edges, 21688 markings/sec, 100 secs
lola: 2899061 markings, 21363111 edges, 28195 markings/sec, 105 secs
lola: 3030172 markings, 22331271 edges, 26222 markings/sec, 110 secs
lola: 3153917 markings, 23294690 edges, 24749 markings/sec, 115 secs
lola: 3285275 markings, 24260083 edges, 26272 markings/sec, 120 secs
lola: 3423380 markings, 25228705 edges, 27621 markings/sec, 125 secs
lola: 3543698 markings, 26189899 edges, 24064 markings/sec, 130 secs
lola: 3669428 markings, 27150375 edges, 25146 markings/sec, 135 secs
lola: 3811066 markings, 28114930 edges, 28328 markings/sec, 140 secs
lola: 3940926 markings, 29075198 edges, 25972 markings/sec, 145 secs
lola: 4063992 markings, 30031576 edges, 24613 markings/sec, 150 secs
lola: 4192318 markings, 30990164 edges, 25665 markings/sec, 155 secs
lola: 4331730 markings, 31965624 edges, 27882 markings/sec, 160 secs
lola: 4454408 markings, 32936507 edges, 24536 markings/sec, 165 secs
lola: 4582199 markings, 33905032 edges, 25558 markings/sec, 170 secs
lola: 4721965 markings, 34867573 edges, 27953 markings/sec, 175 secs
lola: 4851307 markings, 35822707 edges, 25868 markings/sec, 180 secs
lola: 4973253 markings, 36774253 edges, 24389 markings/sec, 185 secs
lola: 5097799 markings, 37723722 edges, 24909 markings/sec, 190 secs
lola: 5237063 markings, 38687061 edges, 27853 markings/sec, 195 secs
lola: 5361518 markings, 39642968 edges, 24891 markings/sec, 200 secs
lola: 5487502 markings, 40596321 edges, 25197 markings/sec, 205 secs
lola: 5622015 markings, 41550476 edges, 26903 markings/sec, 210 secs
lola: 5753573 markings, 42502766 edges, 26312 markings/sec, 215 secs
lola: 5874493 markings, 43448843 edges, 24184 markings/sec, 220 secs
lola: 5992239 markings, 44391181 edges, 23549 markings/sec, 225 secs
lola: 6137920 markings, 45364041 edges, 29136 markings/sec, 230 secs
lola: 6267257 markings, 46334108 edges, 25867 markings/sec, 235 secs
lola: 6393330 markings, 47300156 edges, 25215 markings/sec, 240 secs
lola: 6526404 markings, 48267101 edges, 26615 markings/sec, 245 secs
lola: 6661589 markings, 49237414 edges, 27037 markings/sec, 250 secs
lola: 6785035 markings, 50203815 edges, 24689 markings/sec, 255 secs
lola: 6907882 markings, 51164979 edges, 24569 markings/sec, 260 secs
lola: 7049887 markings, 52125639 edges, 28401 markings/sec, 265 secs
lola: 7178505 markings, 53080036 edges, 25724 markings/sec, 270 secs
lola: 7300626 markings, 54029393 edges, 24424 markings/sec, 275 secs
lola: 7429538 markings, 54980597 edges, 25782 markings/sec, 280 secs
lola: 7565546 markings, 55933022 edges, 27202 markings/sec, 285 secs
lola: 7683461 markings, 56876781 edges, 23583 markings/sec, 290 secs
lola: 7808367 markings, 57820279 edges, 24981 markings/sec, 295 secs
lola: 7948021 markings, 58779055 edges, 27931 markings/sec, 300 secs
lola: 8078638 markings, 59743271 edges, 26123 markings/sec, 305 secs
lola: 8202030 markings, 60704355 edges, 24678 markings/sec, 310 secs
lola: 8328034 markings, 61656786 edges, 25201 markings/sec, 315 secs
lola: 8461210 markings, 62584813 edges, 26635 markings/sec, 320 secs
lola: 8581233 markings, 63503749 edges, 24005 markings/sec, 325 secs
lola: 8702620 markings, 64420605 edges, 24277 markings/sec, 330 secs
lola: 8830497 markings, 65344619 edges, 25575 markings/sec, 335 secs
lola: 8955925 markings, 66234976 edges, 25086 markings/sec, 340 secs
lola: 9064588 markings, 67111955 edges, 21733 markings/sec, 345 secs
lola: 9188589 markings, 68044551 edges, 24800 markings/sec, 350 secs
lola: 9321124 markings, 68959135 edges, 26507 markings/sec, 355 secs
lola: 9445685 markings, 69873297 edges, 24912 markings/sec, 360 secs
lola: 9561839 markings, 70780341 edges, 23231 markings/sec, 365 secs
lola: 9675305 markings, 71682984 edges, 22693 markings/sec, 370 secs
lola: 9817794 markings, 72642425 edges, 28498 markings/sec, 375 secs
lola: 9946756 markings, 73602364 edges, 25792 markings/sec, 380 secs
lola: 10070696 markings, 74558421 edges, 24788 markings/sec, 385 secs
lola: 10201421 markings, 75516064 edges, 26145 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown unknown no unknown unknown unknown yes yes unknown unknown yes unknown unknown no
lola: memory consumption: 791724 KB
lola: time consumption: 397 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((NOT FIREABLE(t398) AND NOT FIREABLE(t403))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (FIREABLE(t398) OR FIREABLE(t403))
lola: processed formula length: 35
lola: 28 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 93 markings, 94 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A ((NOT FIREABLE(t169) R NOT FIREABLE(t535)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U E(FIREABLE(t169) U FIREABLE(t535))))
lola: processed formula length: 49
lola: 31 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 306749 markings, 920126 edges, 61350 markings/sec, 0 secs
lola: 565281 markings, 1832869 edges, 51706 markings/sec, 5 secs
lola: 830426 markings, 2741436 edges, 53029 markings/sec, 10 secs
lola: 1105162 markings, 3652310 edges, 54947 markings/sec, 15 secs
lola: 1344165 markings, 4557732 edges, 47801 markings/sec, 20 secs
lola: 1582324 markings, 5461174 edges, 47632 markings/sec, 25 secs
lola: 1842962 markings, 6356888 edges, 52128 markings/sec, 30 secs
lola: 2087935 markings, 7288566 edges, 48995 markings/sec, 35 secs
lola: 2321337 markings, 8224222 edges, 46680 markings/sec, 40 secs
lola: 2569238 markings, 9127561 edges, 49580 markings/sec, 45 secs
lola: 2829185 markings, 10037854 edges, 51989 markings/sec, 50 secs
lola: 3054621 markings, 10941158 edges, 45087 markings/sec, 55 secs
lola: 3297384 markings, 11846084 edges, 48553 markings/sec, 60 secs
lola: 3537150 markings, 12757334 edges, 47953 markings/sec, 65 secs
lola: 3781837 markings, 13662050 edges, 48937 markings/sec, 70 secs
lola: 4031051 markings, 14568100 edges, 49843 markings/sec, 75 secs
lola: 4286641 markings, 15464968 edges, 51118 markings/sec, 80 secs
lola: 4511382 markings, 16361194 edges, 44948 markings/sec, 85 secs
lola: 4755638 markings, 17267885 edges, 48851 markings/sec, 90 secs
lola: 5012342 markings, 18168209 edges, 51341 markings/sec, 95 secs
lola: 5240588 markings, 19075135 edges, 45649 markings/sec, 100 secs
lola: 5486236 markings, 19978917 edges, 49130 markings/sec, 105 secs
lola: 5741095 markings, 20875456 edges, 50972 markings/sec, 110 secs
lola: 5969325 markings, 21772924 edges, 45646 markings/sec, 115 secs
lola: 6210980 markings, 22672992 edges, 48331 markings/sec, 120 secs
lola: 6464029 markings, 23565807 edges, 50610 markings/sec, 125 secs
lola: 6696852 markings, 24466037 edges, 46565 markings/sec, 130 secs
lola: 6934915 markings, 25361575 edges, 47613 markings/sec, 135 secs
lola: 7186293 markings, 26251045 edges, 50276 markings/sec, 140 secs
lola: 7423705 markings, 27163657 edges, 47482 markings/sec, 145 secs
lola: 7659143 markings, 28070677 edges, 47088 markings/sec, 150 secs
lola: 7894559 markings, 28989191 edges, 47083 markings/sec, 155 secs
lola: 8142162 markings, 29906877 edges, 49521 markings/sec, 160 secs
lola: 8384385 markings, 30819794 edges, 48445 markings/sec, 165 secs
lola: 8630413 markings, 31730209 edges, 49206 markings/sec, 170 secs
lola: 8858610 markings, 32644064 edges, 45639 markings/sec, 175 secs
lola: 9089732 markings, 33546359 edges, 46224 markings/sec, 180 secs
lola: 9331576 markings, 34454568 edges, 48369 markings/sec, 185 secs
lola: 9581599 markings, 35364584 edges, 50005 markings/sec, 190 secs
lola: 9803653 markings, 36265776 edges, 44411 markings/sec, 195 secs
lola: 10040002 markings, 37163514 edges, 47270 markings/sec, 200 secs
lola: 10270798 markings, 38060217 edges, 46159 markings/sec, 205 secs
lola: 10528832 markings, 38975732 edges, 51607 markings/sec, 210 secs
lola: 10746129 markings, 39869832 edges, 43459 markings/sec, 215 secs
lola: 10990581 markings, 40773964 edges, 48890 markings/sec, 220 secs
lola: 11216273 markings, 41668037 edges, 45138 markings/sec, 225 secs
lola: 11478155 markings, 42566115 edges, 52376 markings/sec, 230 secs
lola: 11708543 markings, 43467648 edges, 46078 markings/sec, 235 secs
lola: 11913772 markings, 44365595 edges, 41046 markings/sec, 240 secs
lola: 12130991 markings, 45269205 edges, 43444 markings/sec, 245 secs
lola: 12364658 markings, 46164948 edges, 46733 markings/sec, 250 secs
lola: 12600545 markings, 47068157 edges, 47177 markings/sec, 255 secs
lola: 12815212 markings, 47972233 edges, 42933 markings/sec, 260 secs
lola: 13018350 markings, 48877395 edges, 40628 markings/sec, 265 secs
lola: 13245401 markings, 49774837 edges, 45410 markings/sec, 270 secs
lola: 13466172 markings, 50672184 edges, 44154 markings/sec, 275 secs
lola: 13667251 markings, 51571102 edges, 40216 markings/sec, 280 secs
lola: 13882316 markings, 52470655 edges, 43013 markings/sec, 285 secs
lola: 14099520 markings, 53366192 edges, 43441 markings/sec, 290 secs
lola: 14300386 markings, 54259261 edges, 40173 markings/sec, 295 secs
lola: 14521023 markings, 55157873 edges, 44127 markings/sec, 300 secs
lola: 14740275 markings, 56046545 edges, 43850 markings/sec, 305 secs
lola: 14936178 markings, 56919871 edges, 39181 markings/sec, 310 secs
lola: 15152941 markings, 57798720 edges, 43353 markings/sec, 315 secs
lola: 15362355 markings, 58675966 edges, 41883 markings/sec, 320 secs
lola: 15573160 markings, 59551794 edges, 42161 markings/sec, 325 secs
lola: 15768172 markings, 60424430 edges, 39002 markings/sec, 330 secs
lola: 15960721 markings, 61285081 edges, 38510 markings/sec, 335 secs
lola: 16177944 markings, 62165851 edges, 43445 markings/sec, 340 secs
lola: 16375160 markings, 63028378 edges, 39443 markings/sec, 345 secs
lola: 16632891 markings, 63894155 edges, 51546 markings/sec, 350 secs
lola: 16860644 markings, 64767411 edges, 45551 markings/sec, 355 secs
lola: 17076537 markings, 65636986 edges, 43179 markings/sec, 360 secs
lola: 17310491 markings, 66499471 edges, 46791 markings/sec, 365 secs
lola: 17536210 markings, 67366829 edges, 45144 markings/sec, 370 secs
lola: 17744800 markings, 68239711 edges, 41718 markings/sec, 375 secs
lola: 17948801 markings, 69113421 edges, 40800 markings/sec, 380 secs
lola: 18160795 markings, 69977362 edges, 42399 markings/sec, 385 secs
lola: 18393352 markings, 70883854 edges, 46511 markings/sec, 390 secs
lola: 18602319 markings, 71779484 edges, 41793 markings/sec, 395 secs
lola: 18799988 markings, 72649149 edges, 39534 markings/sec, 400 secs
lola: 19027913 markings, 73516860 edges, 45585 markings/sec, 405 secs
lola: 19237679 markings, 74390274 edges, 41953 markings/sec, 410 secs
lola: 19445168 markings, 75303595 edges, 41498 markings/sec, 415 secs
lola: 19653870 markings, 76183520 edges, 41740 markings/sec, 420 secs
lola: 19864408 markings, 77060810 edges, 42108 markings/sec, 425 secs
lola: 20069138 markings, 77937625 edges, 40946 markings/sec, 430 secs
lola: 20281424 markings, 78823752 edges, 42457 markings/sec, 435 secs
lola: 20499574 markings, 79717530 edges, 43630 markings/sec, 440 secs
lola: 20705044 markings, 80600197 edges, 41094 markings/sec, 445 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown unknown no unknown unknown yes yes yes unknown unknown yes unknown unknown no
lola: memory consumption: 2301368 KB
lola: time consumption: 850 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (NOT FIREABLE(t473))) OR FIREABLE(t140))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (NOT(E(TRUE U FIREABLE(t473))) OR FIREABLE(t140)))
lola: processed formula length: 59
lola: 29 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6335 markings, 13821 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(t169) OR (NOT FIREABLE(t285) AND NOT FIREABLE(t60))) U (A (F (FIREABLE(t534))) OR E (F (FIREABLE(t463))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A((NOT FIREABLE(t169) OR (NOT FIREABLE(t285) AND NOT FIREABLE(t60))) U (A(TRUE U FIREABLE(t534)) OR E(TRUE U FIREABLE(t463))))
lola: processed formula length: 127
lola: 29 rewrites
lola: closed formula file BusinessProcesses-PT-17-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 321 markings, 434 edges
lola: ========================================

FORMULA BusinessProcesses-PT-17-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t186) OR (FIREABLE(t106) AND FIREABLE(t529) AND (FIREABLE(t85) OR FIREABLE(t379)))))) OR E ((NOT FIREABLE(t560) R FIREABLE(t460))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown unknown no yes unknown yes yes yes unknown unknown yes no unknown no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 15248 KB
lola: time consumption: 1530 seconds
lola: time limit reached - aborting
lola:
preliminary result: no yes unknown unknown no yes unknown yes yes yes unknown unknown yes no unknown no
lola:
preliminary result: no yes unknown unknown no yes unknown yes yes yes unknown unknown yes no unknown no
lola: memory consumption: 12252 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
export BK_EXAMINATION="CTLFireability"
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 CTLFireability"
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-152749145600328"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;