fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469100165
Last Updated
June 26, 2018

About the Execution of LoLA for MAPK-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.930 446815.00 455476.00 2512.40 FF?TFTTFTFFTFFTF 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 192K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPK-PT-020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100165
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527019684403

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-020 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ MAPK-PT-020 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-020-CTLFireability.task
lola: E ((E (G (NOT FIREABLE(k7))) U A (G (FIREABLE(k8))))) : A (G (NOT(A (X ((FIREABLE(k30) AND FIREABLE(k12))))))) : A (G ((NOT FIREABLE(k10) OR E (F (NOT FIREABLE(k24)))))) : E (F ((FIREABLE(k15) AND FIREABLE(k3) AND FIREABLE(k22) AND FIREABLE(k11)))) : FIREABLE(k6) : (((NOT(A (G (FIREABLE(k29)))) OR NOT(E (G (FIREABLE(k13))))) AND E (G (A (F (FIREABLE(k7)))))) OR (NOT(NOT(E (X (FIREABLE(k3))))) AND E (F (E (F (FIREABLE(k17))))))) : (NOT((FIREABLE(k3) OR E ((FIREABLE(k21) U FIREABLE(k20))))) OR E ((E (X (FIREABLE(k1))) U FIREABLE(k21)))) : (E ((E (G (FIREABLE(k30))) U ((FIREABLE(k2) AND FIREABLE(k30)) OR FIREABLE(k17)))) AND A (F (E (G ((FIREABLE(k3) AND FIREABLE(k9))))))) : ((FIREABLE(k17) OR NOT(E (F (FIREABLE(k23))))) OR (E (F (E (G (FIREABLE(k20))))) OR NOT FIREABLE(k8))) : NOT(E (F (FIREABLE(k22)))) : ((FIREABLE(k14) AND FIREABLE(k9)) AND ((FIREABLE(k11) AND NOT FIREABLE(k20) AND (NOT FIREABLE(k23) OR NOT FIREABLE(k30)) AND NOT FIREABLE(k30)) AND A (X ((FIREABLE(k9) AND NOT FIREABLE(k27)))))) : NOT FIREABLE(k8) : FIREABLE(k22) : A ((NOT(E (X (FIREABLE(k6)))) U FIREABLE(k17))) : NOT((E (G (FIREABLE(k27))) OR FIREABLE(k2))) : FIREABLE(k17)
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k6)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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

FORMULA MAPK-PT-020-CTLFireability-4 FALSE 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: NOT FIREABLE(k8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(k8)
lola: processed formula length: 16
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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: ========================================

FORMULA MAPK-PT-020-CTLFireability-11 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: FIREABLE(k22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k22)
lola: processed formula length: 13
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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: ========================================

FORMULA MAPK-PT-020-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k17)
lola: processed formula length: 13
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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: ========================================

FORMULA MAPK-PT-020-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: ((FIREABLE(k14) AND FIREABLE(k9)) AND ((FIREABLE(k11) AND NOT FIREABLE(k20) AND (NOT FIREABLE(k23) OR NOT FIREABLE(k30)) AND NOT FIREABLE(k30)) AND A (X ((FIREABLE(k9) AND NOT FIREABLE(k27))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k14) AND FIREABLE(k9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(k14) AND FIREABLE(k9))
lola: processed formula length: 32
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA MAPK-PT-020-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
========================================lola: ...considering subproblem: A (G (E (X ((NOT FIREABLE(k30) OR NOT FIREABLE(k12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737

lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(k30) OR NOT FIREABLE(k12))))))
lola: processed formula length: 65
lola: 39 rewrites
lola: closed formula file MAPK-PT-020-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 638905 markings, 1523569 edges

FORMULA MAPK-PT-020-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((E (F (NOT FIREABLE(k29))) OR A (F (NOT FIREABLE(k13)))) AND E (G (A (F (FIREABLE(k7)))))) OR (E (X (FIREABLE(k3))) AND E (F (FIREABLE(k17)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(k13)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(k13)
lola: processed formula length: 13
lola: 39 rewrites
lola: closed formula file MAPK-PT-020-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(k17)))
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(k17)))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file MAPK-PT-020-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(k17)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-CTLFireability-7-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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (FIREABLE(k7)))))
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(k7)))))
lola: processed formula length: 42
lola: 39 rewrites
lola: closed formula file MAPK-PT-020-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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(k3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(k3))
lola: processed formula length: 16
lola: 38 rewrites
lola: closed formula file MAPK-PT-020-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-020-CTLFireability-5 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 ((A (X (NOT FIREABLE(k6))) U FIREABLE(k17)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(AX(NOT FIREABLE(k6)) U FIREABLE(k17))
lola: processed formula length: 39
lola: 39 rewrites
lola: closed formula file MAPK-PT-020-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3 markings, 2 edges

FORMULA MAPK-PT-020-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(k3) AND A ((NOT FIREABLE(k21) R NOT FIREABLE(k20)))) OR E ((E (X (FIREABLE(k1))) U FIREABLE(k21))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:742
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: ((NOT FIREABLE(k3) AND NOT(E(FIREABLE(k21) U FIREABLE(k20)))) OR E(EX(FIREABLE(k1)) U FIREABLE(k21)))
lola: processed formula length: 101
lola: 42 rewrites
lola: closed formula file MAPK-PT-020-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges

FORMULA MAPK-PT-020-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(k22)))
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(k22)))
lola: processed formula length: 25
lola: 39 rewrites
lola: closed formula file MAPK-PT-020-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 10 edges

FORMULA MAPK-PT-020-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k15) AND FIREABLE(k3) AND FIREABLE(k22) AND FIREABLE(k11))))
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(k15) AND FIREABLE(k3) AND FIREABLE(k22) AND FIREABLE(k11))))
lola: processed formula length: 76
lola: 38 rewrites
lola: closed formula file MAPK-PT-020-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k10) OR E (F (NOT FIREABLE(k24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (FIREABLE(k10) AND NOT(E(TRUE U NOT FIREABLE(k24))))))
lola: processed formula length: 67
lola: 41 rewrites
lola: closed formula file MAPK-PT-020-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: 2446630 markings, 6893148 edges, 489326 markings/sec, 0 secs
lola: 4833753 markings, 13747282 edges, 477425 markings/sec, 5 secs
lola: 7168793 markings, 20489465 edges, 467008 markings/sec, 10 secs
lola: 9442548 markings, 27111592 edges, 454751 markings/sec, 15 secs
lola: 11683108 markings, 33703454 edges, 448112 markings/sec, 20 secs
lola: 14026248 markings, 40495647 edges, 468628 markings/sec, 25 secs
lola: 16343280 markings, 47232330 edges, 463406 markings/sec, 30 secs
lola: 18635880 markings, 54033957 edges, 458520 markings/sec, 35 secs
lola: 20920759 markings, 60762270 edges, 456976 markings/sec, 40 secs
lola: 23146842 markings, 67261232 edges, 445217 markings/sec, 45 secs
lola: 25230434 markings, 73447752 edges, 416718 markings/sec, 50 secs
lola: 27377614 markings, 79766320 edges, 429436 markings/sec, 55 secs
lola: 29600867 markings, 86215894 edges, 444651 markings/sec, 60 secs
lola: 31679023 markings, 92326631 edges, 415631 markings/sec, 65 secs
lola: 33839116 markings, 98764196 edges, 432019 markings/sec, 70 secs
lola: 35953742 markings, 105050855 edges, 422925 markings/sec, 75 secs
lola: 38040571 markings, 111287690 edges, 417366 markings/sec, 80 secs
lola: 40210475 markings, 117682263 edges, 433981 markings/sec, 85 secs
lola: 42364076 markings, 124024824 edges, 430720 markings/sec, 90 secs
lola: 44414497 markings, 130181056 edges, 410084 markings/sec, 95 secs
lola: 46613655 markings, 136696556 edges, 439832 markings/sec, 100 secs
lola: 48702980 markings, 142965935 edges, 417865 markings/sec, 105 secs
lola: 50757211 markings, 149086495 edges, 410846 markings/sec, 110 secs
lola: 52808384 markings, 155237747 edges, 410235 markings/sec, 115 secs
lola: 54935173 markings, 161529275 edges, 425358 markings/sec, 120 secs
lola: 56954670 markings, 167639818 edges, 403899 markings/sec, 125 secs
lola: 58970916 markings, 173722830 edges, 403249 markings/sec, 130 secs
lola: 61058316 markings, 179976275 edges, 417480 markings/sec, 135 secs
lola: 63193360 markings, 186268198 edges, 427009 markings/sec, 140 secs
lola: 65224006 markings, 192360033 edges, 406129 markings/sec, 145 secs
lola: 67245326 markings, 198463999 edges, 404264 markings/sec, 150 secs
lola: 69224070 markings, 204429740 edges, 395749 markings/sec, 155 secs
lola: 71234841 markings, 210456759 edges, 402154 markings/sec, 160 secs
lola: 73191814 markings, 216377043 edges, 391395 markings/sec, 165 secs
lola: 75275826 markings, 222520159 edges, 416802 markings/sec, 170 secs
lola: 77203607 markings, 228352050 edges, 385556 markings/sec, 175 secs
lola: 79131573 markings, 234094255 edges, 385593 markings/sec, 180 secs
lola: 81096195 markings, 240020735 edges, 392924 markings/sec, 185 secs
lola: 82981101 markings, 245696707 edges, 376981 markings/sec, 190 secs
lola: 84877070 markings, 251412369 edges, 379194 markings/sec, 195 secs
lola: 86841635 markings, 257324685 edges, 392913 markings/sec, 200 secs
lola: 88807577 markings, 263198704 edges, 393188 markings/sec, 205 secs
lola: 88890851 markings, 263462515 edges, 16655 markings/sec, 210 secs
lola: 88918615 markings, 263544984 edges, 5553 markings/sec, 215 secs
lola: 88935940 markings, 263597485 edges, 3465 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (NOT FIREABLE(k7))) U A (G (FIREABLE(k8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(A(TRUE U FIREABLE(k7))) U NOT(E(TRUE U NOT FIREABLE(k8))))
lola: processed formula length: 64
lola: 42 rewrites
lola: closed formula file MAPK-PT-020-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 48 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (G (FIREABLE(k30))) U ((FIREABLE(k2) AND FIREABLE(k30)) OR FIREABLE(k17)))) AND A (F (E (G ((FIREABLE(k3) AND FIREABLE(k9)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E(NOT(A(TRUE U NOT FIREABLE(k30))) U ((FIREABLE(k2) AND FIREABLE(k30)) OR FIREABLE(k17))) AND A(TRUE U NOT(A(TRUE U (NOT FIREABLE(k3) OR NOT FIREABLE(k9))))))
lola: processed formula length: 161
lola: 43 rewrites
lola: closed formula file MAPK-PT-020-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 4 significant temporal operators and needs 17 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: 1 markings, 1 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (NOT FIREABLE(k27))) AND NOT FIREABLE(k2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(k2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(k2)
lola: processed formula length: 16
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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 15 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(k27)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(k27)
lola: processed formula length: 13
lola: 39 rewrites
lola: closed formula file MAPK-PT-020-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-020-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k17) OR (A (G (NOT FIREABLE(k23))) OR (E (F (E (G (FIREABLE(k20))))) OR NOT FIREABLE(k8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(k8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(k8)
lola: processed formula length: 16
lola: 37 rewrites
lola: closed formula file MAPK-PT-020-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA MAPK-PT-020-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k10) OR E (F (NOT FIREABLE(k24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (FIREABLE(k10) AND NOT(E(TRUE U NOT FIREABLE(k24))))))
lola: processed formula length: 67
lola: 41 rewrites
lola: closed formula file MAPK-PT-020-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: 2559816 markings, 7208834 edges, 511963 markings/sec, 0 secs
lola: 4972450 markings, 14143374 edges, 482527 markings/sec, 5 secs
lola: 7296074 markings, 20859963 edges, 464725 markings/sec, 10 secs
lola: 9579231 markings, 27513287 edges, 456631 markings/sec, 15 secs
lola: 11821718 markings, 34101271 edges, 448497 markings/sec, 20 secs
lola: 14133630 markings, 40805776 edges, 462382 markings/sec, 25 secs
lola: 16406245 markings, 47416485 edges, 454523 markings/sec, 30 secs
lola: 18558421 markings, 53808249 edges, 430435 markings/sec, 35 secs
lola: 20753961 markings, 60270836 edges, 439108 markings/sec, 40 secs
lola: 23022763 markings, 66891891 edges, 453760 markings/sec, 45 secs
lola: 25131776 markings, 73149038 edges, 421803 markings/sec, 50 secs
lola: 27309063 markings, 79567910 edges, 435457 markings/sec, 55 secs
lola: 29596533 markings, 86202850 edges, 457494 markings/sec, 60 secs
lola: 31730618 markings, 92476154 edges, 426817 markings/sec, 65 secs
lola: 33780995 markings, 98598659 edges, 410075 markings/sec, 70 secs
lola: 35837890 markings, 104697871 edges, 411379 markings/sec, 75 secs
lola: 37921823 markings, 110930180 edges, 416787 markings/sec, 80 secs
lola: 40084195 markings, 117318971 edges, 432474 markings/sec, 85 secs
lola: 42264854 markings, 123730620 edges, 436132 markings/sec, 90 secs
lola: 44305670 markings, 129852069 edges, 408163 markings/sec, 95 secs
lola: 46386861 markings, 136022695 edges, 416238 markings/sec, 100 secs
lola: 48376752 markings, 141984157 edges, 397978 markings/sec, 105 secs
lola: 50378044 markings, 147987032 edges, 400258 markings/sec, 110 secs
lola: 52348227 markings, 153909254 edges, 394037 markings/sec, 115 secs
lola: 54444346 markings, 160100059 edges, 419224 markings/sec, 120 secs
lola: 56467611 markings, 166162148 edges, 404653 markings/sec, 125 secs
lola: 58439721 markings, 172109857 edges, 394422 markings/sec, 130 secs
lola: 60429150 markings, 178081843 edges, 397886 markings/sec, 135 secs
lola: 62489672 markings, 184185281 edges, 412104 markings/sec, 140 secs
lola: 64419957 markings, 189968396 edges, 386057 markings/sec, 145 secs
lola: 66431598 markings, 195989311 edges, 402328 markings/sec, 150 secs
lola: 68384564 markings, 201903100 edges, 390593 markings/sec, 155 secs
lola: 70317413 markings, 207699312 edges, 386570 markings/sec, 160 secs
lola: 72267438 markings, 213564470 edges, 390005 markings/sec, 165 secs
lola: 74304276 markings, 219652164 edges, 407368 markings/sec, 170 secs
lola: 76379261 markings, 225870837 edges, 414997 markings/sec, 175 secs
lola: 78481511 markings, 232128134 edges, 420450 markings/sec, 180 secs
lola: 80526703 markings, 238285992 edges, 409038 markings/sec, 185 secs
lola: 82569604 markings, 244447365 edges, 408580 markings/sec, 190 secs
lola: 84591056 markings, 250541180 edges, 404290 markings/sec, 195 secs
lola: 86605462 markings, 256631804 edges, 402881 markings/sec, 200 secs
lola: 88717062 markings, 262918794 edges, 422320 markings/sec, 205 secs
lola: 88906691 markings, 263510180 edges, 37926 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-020-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no unknown yes no yes yes no yes no no yes no no yes no
lola:
preliminary result: no no unknown yes no yes yes no yes no no yes no no yes no
lola: memory consumption: 13328 KB
lola: time consumption: 447 seconds

BK_STOP 1527020131218

--------------------
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="MAPK-PT-020"
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/MAPK-PT-020.tgz
mv MAPK-PT-020 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 MAPK-PT-020, 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 r112-csrt-152666469100165"
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 ;