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 168K
-rw-r--r-- 1 mcc users 3.3K 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.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ERK-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-blw3-152732474300117
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527872434866

info: Time: 3600 - MCC
===========================================================================================
prep: translating ERK-PT-010000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ERK-PT-010000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ ERK-PT-010000 @ 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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-010000-LTLCardinality.task
lola: A ((G (F ((RKIPP <= MEKPP_ERK))) U X ((RKIPP_RP <= RKIP)))) : A (F ((G ((Raf1Star_RKIP <= ERK)) U F ((3 <= RKIP))))) : A (X (F ((RKIPP_RP <= Raf1Star_RKIP)))) : A (F ((2 <= RKIPP))) : A (G ((X ((3 <= MEKPP)) U F ((RKIP <= Raf1Star_RKIP_ERKPP))))) : A (X (F (F (F ((2 <= RKIP)))))) : A (X ((RP <= RKIPP))) : A (G ((Raf1Star_RKIP_ERKPP <= RKIPP_RP))) : A (G (G (G (G ((1 <= ERK)))))) : A ((3 <= RP)) : A ((2 <= RKIP)) : A (X (F (F (G ((RKIP <= MEKPP)))))) : A (G (X (F (G ((2 <= ERK)))))) : A (G (G ((Raf1Star <= RP)))) : A (X ((G ((2 <= MEKPP)) U X ((RKIPP <= ERK))))) : A (X (X (G (G ((MEKPP_ERK <= Raf1Star))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= RP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= RP)
lola: processed formula length: 9
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: processed formula with 1 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 ERK-PT-010000-LTLCardinality-9 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: (2 <= RKIP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= RKIP)
lola: processed formula length: 11
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: processed formula with 1 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 ERK-PT-010000-LTLCardinality-10 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: A (X (F ((2 <= RKIP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= RKIP))))
lola: processed formula length: 23
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-5 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: A (X ((RP <= RKIPP)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((RP <= RKIPP)))
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20005 markings, 20005 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-6 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: A ((X ((RKIPP_RP <= RKIP)) OR (G (F ((RKIPP <= MEKPP_ERK))) AND X (F ((RKIPP_RP <= RKIP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((RKIPP_RP <= RKIP)) OR (G (F ((RKIPP <= MEKPP_ERK))) AND X (F ((RKIPP_RP <= RKIP))))))
lola: processed formula length: 93
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-0 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: A (X (F ((RKIPP_RP <= Raf1Star_RKIP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((RKIPP_RP <= Raf1Star_RKIP))))
lola: processed formula length: 39
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((RKIPP <= ERK)) OR (G ((2 <= MEKPP)) AND X (F ((RKIPP <= ERK)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((RKIPP <= ERK)) OR (G ((2 <= MEKPP)) AND X (F ((RKIPP <= ERK)))))))
lola: processed formula length: 77
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 15 markings, 18 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-14 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 (X (X (G ((MEKPP_ERK <= Raf1Star)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((MEKPP_ERK <= Raf1Star)))))
lola: processed formula length: 39
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3962116 markings, 9869257 edges, 792423 markings/sec, 0 secs
lola: 7851486 markings, 19590233 edges, 777874 markings/sec, 5 secs
lola: 11793191 markings, 29441654 edges, 788341 markings/sec, 10 secs
lola: 15758126 markings, 39351919 edges, 792987 markings/sec, 15 secs
lola: 19742869 markings, 49311792 edges, 796949 markings/sec, 20 secs
lola: 23611844 markings, 58983277 edges, 773795 markings/sec, 25 secs
lola: 27517176 markings, 68745770 edges, 781066 markings/sec, 30 secs
lola: 31341169 markings, 78305958 edges, 764799 markings/sec, 35 secs
lola: 35198969 markings, 87947739 edges, 771560 markings/sec, 40 secs
lola: 39226156 markings, 98016464 edges, 805437 markings/sec, 45 secs
lola: 43197676 markings, 107941378 edges, 794304 markings/sec, 50 secs
lola: 47270304 markings, 118122491 edges, 814526 markings/sec, 55 secs
lola: 51736184 markings, 129288113 edges, 893176 markings/sec, 60 secs
lola: 56165129 markings, 140356607 edges, 885789 markings/sec, 65 secs
lola: 60578179 markings, 151388886 edges, 882610 markings/sec, 70 secs
lola: 65053052 markings, 162576854 edges, 894975 markings/sec, 75 secs
lola: 69614611 markings, 173980122 edges, 912312 markings/sec, 80 secs
lola: 73690267 markings, 184166786 edges, 815131 markings/sec, 85 secs
lola: 77718275 markings, 194237813 edges, 805602 markings/sec, 90 secs
lola: 81851080 markings, 204566491 edges, 826561 markings/sec, 95 secs
lola: 85950604 markings, 214815217 edges, 819905 markings/sec, 100 secs
lola: 90045754 markings, 225052952 edges, 819030 markings/sec, 105 secs
lola: 91972511 markings, 229878811 edges, 385351 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= ERK)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (ERK <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10001 markings, 10000 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Raf1Star_RKIP_ERKPP <= RKIPP_RP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Raf1Star_RKIP_ERKPP <= RKIPP_RP)))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RKIPP_RP + 1 <= Raf1Star_RKIP_ERKPP)
lola: SUBRESULT
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to ERK-PT-010000-LTLCardinality-9-0.sara
lola: 5 markings, 4 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Raf1Star <= RP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Raf1Star <= RP)))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RP + 1 <= Raf1Star)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 11 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= RKIPP)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (RKIPP <= 1)
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 30002 markings, 30002 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 863 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= ERK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= ERK))))
lola: processed formula length: 22
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 0
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 49997 markings, 59996 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((RKIP <= Raf1Star_RKIP_ERKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((RKIP <= Raf1Star_RKIP_ERKPP))))
lola: processed formula length: 41
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20007 markings, 20007 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((RKIP <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((RKIP <= MEKPP))))
lola: processed formula length: 27
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120009 markings, 210020 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= RKIP)) OR (G ((Raf1Star_RKIP <= ERK)) AND F ((3 <= RKIP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= RKIP)) OR (G ((Raf1Star_RKIP <= ERK)) AND F ((3 <= RKIP))))))
lola: processed formula length: 77
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA ERK-PT-010000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((MEKPP_ERK <= Raf1Star)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((MEKPP_ERK <= Raf1Star)))))
lola: processed formula length: 39
lola: 20 rewrites
lola: closed formula file ERK-PT-010000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4458684 markings, 11109722 edges, 891737 markings/sec, 0 secs
lola: 8552579 markings, 21341364 edges, 818779 markings/sec, 5 secs
lola: 12537114 markings, 31300571 edges, 796907 markings/sec, 10 secs
lola: 16576875 markings, 41397971 edges, 807952 markings/sec, 15 secs
lola: 20949770 markings, 52328844 edges, 874579 markings/sec, 20 secs
lola: 25340944 markings, 63304792 edges, 878235 markings/sec, 25 secs
lola: 29723471 markings, 74260057 edges, 876505 markings/sec, 30 secs
lola: 34030131 markings, 85025966 edges, 861332 markings/sec, 35 secs
lola: 38531700 markings, 96278901 edges, 900314 markings/sec, 40 secs
lola: 43067857 markings, 107617217 edges, 907231 markings/sec, 45 secs
lola: 47539030 markings, 118796217 edges, 894235 markings/sec, 50 secs
lola: 52068786 markings, 130120180 edges, 905951 markings/sec, 55 secs
lola: 56526413 markings, 141260254 edges, 891525 markings/sec, 60 secs
lola: 61001035 markings, 152445501 edges, 894924 markings/sec, 65 secs
lola: 65585484 markings, 163907378 edges, 916890 markings/sec, 70 secs
lola: 70230065 markings, 175517018 edges, 928916 markings/sec, 75 secs
lola: 74855935 markings, 187081495 edges, 925174 markings/sec, 80 secs
lola: 79422893 markings, 198497562 edges, 913392 markings/sec, 85 secs
lola: 84086225 markings, 210155643 edges, 932666 markings/sec, 90 secs
lola: 88769398 markings, 221863447 edges, 936635 markings/sec, 95 secs
lola: 91928509 markings, 229758751 edges, 631822 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA ERK-PT-010000-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no no no yes yes no no no yes unknown
lola:
preliminary result: yes yes yes no no yes no no no yes yes no no no yes unknown
lola: memory consumption: 16456 KB
lola: time consumption: 224 seconds

BK_STOP 1527872659389

--------------------
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="ERK-PT-010000"
export BK_EXAMINATION="LTLCardinality"
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/ERK-PT-010000.tgz
mv ERK-PT-010000 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 ERK-PT-010000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r232-blw3-152732474300117"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;