Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r077-smll-155234766400044.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is ERK-PT-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r077-smll-155234766400044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.7K Feb 10 23:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 10 23:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 6 20:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 6 20:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jan 31 00:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 00:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552419406502

info: Time: 3600 - MCC
===========================================================================================
prep: translating ERK-PT-000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ERK-PT-000100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ ERK-PT-000100 @ 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-000100-LTLCardinality.task
lola: LP says that atomic proposition is always true: (Raf1Star_RKIP <= RP)
lola: A ((RKIPP_RP <= RP)) : A ((1 <= Raf1Star)) : A ((G ((RP <= ERK)) U (2 <= Raf1Star))) : A (G (G (G (G ((RKIPP_RP <= ERK)))))) : A (F ((Raf1Star_RKIP_ERKPP <= RKIP))) : A (F (G (TRUE))) : A ((F (X ((2 <= Raf1Star))) U X ((2 <= ERK)))) : A ((2 <= RKIPP)) : A (G ((F ((ERK <= Raf1Star_RKIP_ERKPP)) U G ((Raf1Star_RKIP <= Raf1Star_RKIP_ERKPP))))) : A (X ((F ((2 <= RKIP)) U G ((3 <= Raf1Star_RKIP_ERKPP))))) : A ((F (F ((2 <= MEKPP_ERK))) U (1 <= RKIP))) : A (F ((1 <= MEKPP_ERK))) : A (X ((3 <= ERK))) : A ((1 <= RKIPP)) : A (G ((G ((ERK <= Raf1Star_RKIP)) U G ((3 <= Raf1Star_RKIP))))) : A ((G ((Raf1Star <= RKIPP_RP)) U G (X ((2 <= Raf1Star)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (RKIPP_RP <= RP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RKIPP_RP <= RP)
lola: processed formula length: 16
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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-000100-LTLCardinality-0 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: (1 <= Raf1Star)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Raf1Star)
lola: processed formula length: 15
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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-000100-LTLCardinality-1 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-LTLCardinality.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

FORMULA ERK-PT-000100-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= RKIPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= RKIPP)
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-LTLCardinality.task
lola: processed formula with 1 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 ERK-PT-000100-LTLCardinality-7 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: (1 <= RKIPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= RKIPP)
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-LTLCardinality.task
lola: processed formula with 1 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 ERK-PT-000100-LTLCardinality-13 FALSE 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 ((2 <= RKIP)) U G ((3 <= Raf1Star_RKIP_ERKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= RKIP)) U G ((3 <= Raf1Star_RKIP_ERKPP)))))
lola: processed formula length: 58
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 206 markings, 207 edges
lola: ========================================

FORMULA ERK-PT-000100-LTLCardinality-9 FALSE 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 ((3 <= ERK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= ERK)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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: 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-000100-LTLCardinality-12 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 ((F ((2 <= Raf1Star)) U (2 <= ERK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= Raf1Star)) U (2 <= ERK))))
lola: processed formula length: 42
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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: 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-000100-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= Raf1Star))) OR (G ((Raf1Star <= RKIPP_RP)) AND F (G ((2 <= Raf1Star))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= Raf1Star))) OR (G ((Raf1Star <= RKIPP_RP)) AND F (G ((2 <= Raf1Star))))))
lola: processed formula length: 89
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 2865187 markings, 7987772 edges, 573037 markings/sec, 0 secs
lola: 5622229 markings, 15673222 edges, 551408 markings/sec, 5 secs
lola: 8299622 markings, 23060339 edges, 535479 markings/sec, 10 secs
lola: 10922719 markings, 30292627 edges, 524619 markings/sec, 15 secs
lola: 13523584 markings, 37523595 edges, 520173 markings/sec, 20 secs
lola: 16110046 markings, 44631167 edges, 517292 markings/sec, 25 secs
lola: 18660323 markings, 51626427 edges, 510055 markings/sec, 30 secs
lola: 21175058 markings, 58580092 edges, 502947 markings/sec, 35 secs
lola: 23682953 markings, 65459971 edges, 501579 markings/sec, 40 secs
lola: 26179294 markings, 72339857 edges, 499268 markings/sec, 45 secs
lola: 28659966 markings, 79158213 edges, 496134 markings/sec, 50 secs
lola: 31116992 markings, 85917788 edges, 491405 markings/sec, 55 secs
lola: 33580192 markings, 92706389 edges, 492640 markings/sec, 60 secs
lola: 36048425 markings, 99499024 edges, 493647 markings/sec, 65 secs
lola: 38498596 markings, 106202770 edges, 490034 markings/sec, 70 secs
lola: 40931213 markings, 112890362 edges, 486523 markings/sec, 75 secs
lola: 43284256 markings, 119339809 edges, 470609 markings/sec, 80 secs
lola: 45644078 markings, 125808066 edges, 471964 markings/sec, 85 secs
lola: 47922066 markings, 132048417 edges, 455598 markings/sec, 90 secs
lola: 50093469 markings, 138025249 edges, 434281 markings/sec, 95 secs
lola: 52254460 markings, 143945263 edges, 432198 markings/sec, 100 secs
lola: 54524392 markings, 150180787 edges, 453986 markings/sec, 105 secs
lola: 56758286 markings, 156301473 edges, 446779 markings/sec, 110 secs
lola: 58989588 markings, 162478350 edges, 446260 markings/sec, 115 secs
lola: 61173179 markings, 168450759 edges, 436718 markings/sec, 120 secs
lola: 63412695 markings, 174598891 edges, 447903 markings/sec, 125 secs
lola: 65583091 markings, 180534280 edges, 434079 markings/sec, 130 secs
lola: 67778104 markings, 186542468 edges, 439003 markings/sec, 135 secs
lola: 70000133 markings, 192631924 edges, 444406 markings/sec, 140 secs
lola: 72184054 markings, 198611363 edges, 436784 markings/sec, 145 secs
lola: 74354430 markings, 204551631 edges, 434075 markings/sec, 150 secs
lola: 76573422 markings, 210673243 edges, 443798 markings/sec, 155 secs
lola: 78733074 markings, 216566444 edges, 431930 markings/sec, 160 secs
lola: 80922313 markings, 222580308 edges, 437848 markings/sec, 165 secs
lola: 81295199 markings, 223601805 edges, 74577 markings/sec, 170 secs
lola: 81315433 markings, 223657019 edges, 4047 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((RKIPP_RP <= 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 ((RKIPP_RP <= ERK)))
lola: processed formula length: 25
lola: 25 rewrites
lola: closed formula file ERK-PT-000100-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 + 1 <= RKIPP_RP)
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: 109 markings, 111 edges
lola: state equation: write sara problem file to ERK-PT-000100-LTLCardinality-9-0.sara
lola: ========================================

FORMULA ERK-PT-000100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= MEKPP_ERK)))
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: (MEKPP_ERK <= 0)
lola: processed formula length: 16
lola: 25 rewrites
lola: closed formula file ERK-PT-000100-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: 101 markings, 101 edges
lola:
FORMULA ERK-PT-000100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Raf1Star_RKIP_ERKPP <= RKIP)))
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: (RKIP + 1 <= Raf1Star_RKIP_ERKPP)
lola: processed formula length: 33
lola: 25 rewrites
lola: closed formula file ERK-PT-000100-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola:
FORMULA ERK-PT-000100-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= Raf1Star_RKIP)) OR (G ((ERK <= Raf1Star_RKIP)) AND F (G ((3 <= Raf1Star_RKIP)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((3 <= Raf1Star_RKIP)) OR (G ((ERK <= Raf1Star_RKIP)) AND F (G ((3 <= Raf1Star_RKIP)))))))
lola: processed formula length: 99
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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: 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: 302 markings, 302 edges
lola:
FORMULA ERK-PT-000100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= MEKPP_ERK)) U (1 <= RKIP)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= MEKPP_ERK)) U (1 <= RKIP)))
lola: processed formula length: 40
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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: 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-000100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Raf1Star) OR (G ((RP <= ERK)) AND F ((2 <= Raf1Star)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((2 <= Raf1Star) OR (G ((RP <= ERK)) AND F ((2 <= Raf1Star)))))
lola: processed formula length: 66
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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-000100-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((Raf1Star_RKIP <= Raf1Star_RKIP_ERKPP)))) AND A (G ((F ((ERK <= Raf1Star_RKIP_ERKPP)) OR G ((Raf1Star_RKIP <= Raf1Star_RKIP_ERKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Raf1Star_RKIP <= Raf1Star_RKIP_ERKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Raf1Star_RKIP <= Raf1Star_RKIP_ERKPP))))
lola: processed formula length: 50
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-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 4
lola: add low 8
lola: add low 5
lola: add low 7
lola: add low 10
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: 214 markings, 219 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ERK-PT-000100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= Raf1Star))) OR (G ((Raf1Star <= RKIPP_RP)) AND F (G ((2 <= Raf1Star))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= Raf1Star))) OR (G ((Raf1Star <= RKIPP_RP)) AND F (G ((2 <= Raf1Star))))))
lola: processed formula length: 89
lola: 23 rewrites
lola: closed formula file ERK-PT-000100-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 2877114 markings, 8020710 edges, 575423 markings/sec, 0 secs
lola: 5647300 markings, 15744346 edges, 554037 markings/sec, 5 secs
lola: 8339739 markings, 23170622 edges, 538488 markings/sec, 10 secs
lola: 10973880 markings, 30433124 edges, 526828 markings/sec, 15 secs
lola: 13587215 markings, 37697262 edges, 522667 markings/sec, 20 secs
lola: 16182643 markings, 44830502 edges, 519086 markings/sec, 25 secs
lola: 18746337 markings, 51868506 edges, 512739 markings/sec, 30 secs
lola: 21275158 markings, 58855997 edges, 505764 markings/sec, 35 secs
lola: 23795311 markings, 65770875 edges, 504031 markings/sec, 40 secs
lola: 26297967 markings, 72667811 edges, 500531 markings/sec, 45 secs
lola: 28784522 markings, 79502204 edges, 497311 markings/sec, 50 secs
lola: 31248051 markings, 86276688 edges, 492706 markings/sec, 55 secs
lola: 33720063 markings, 93088022 edges, 494402 markings/sec, 60 secs
lola: 36196267 markings, 99906462 edges, 495241 markings/sec, 65 secs
lola: 38660141 markings, 106642301 edges, 492775 markings/sec, 70 secs
lola: 41098728 markings, 113355106 edges, 487717 markings/sec, 75 secs
lola: 43459809 markings, 119817306 edges, 472216 markings/sec, 80 secs
lola: 45834109 markings, 126327349 edges, 474860 markings/sec, 85 secs
lola: 48133601 markings, 132635833 edges, 459898 markings/sec, 90 secs
lola: 50452041 markings, 139000088 edges, 463688 markings/sec, 95 secs
lola: 52730848 markings, 145252947 edges, 455761 markings/sec, 100 secs
lola: 55029089 markings, 151560000 edges, 459648 markings/sec, 105 secs
lola: 57267223 markings, 157695010 edges, 447627 markings/sec, 110 secs
lola: 59523184 markings, 163939765 edges, 451192 markings/sec, 115 secs
lola: 61742431 markings, 170003094 edges, 443849 markings/sec, 120 secs
lola: 63986252 markings, 176162362 edges, 448764 markings/sec, 125 secs
lola: 66190053 markings, 182209948 edges, 440760 markings/sec, 130 secs
lola: 68420787 markings, 188301357 edges, 446147 markings/sec, 135 secs
lola: 70642502 markings, 194388085 edges, 444343 markings/sec, 140 secs
lola: 72840159 markings, 200403579 edges, 439531 markings/sec, 145 secs
lola: 75076881 markings, 206547132 edges, 447344 markings/sec, 150 secs
lola: 77269854 markings, 212565645 edges, 438595 markings/sec, 155 secs
lola: 79476385 markings, 218601446 edges, 441306 markings/sec, 160 secs
lola: 81257672 markings, 223500100 edges, 356257 markings/sec, 165 secs
lola: 81295074 markings, 223601508 edges, 7480 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA ERK-PT-000100-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 yes yes yes no no no yes no yes no no unknown
lola:
preliminary result: yes yes yes no yes yes yes no no no yes no yes no no unknown
lola: memory consumption: 17176 KB
lola: time consumption: 364 seconds

BK_STOP 1552419770334

--------------------
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-000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is ERK-PT-000100, 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 r077-smll-155234766400044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000100.tgz
mv ERK-PT-000100 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;