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 348K
-rw-r--r-- 1 mcc users 4.4K May 30 21:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 21:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 28 09:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 28 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 28 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.3K May 28 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.7K May 27 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 5 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 166K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPKbis-PT-5320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800302
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527789951538

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPKbis-PT-5320 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPKbis-PT-5320 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ MAPKbis-PT-5320 @ 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: 279/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3392
lola: finding significant places
lola: 106 places, 173 transitions, 49 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 343 transition conflict sets
lola: TASK
lola: reading formula from MAPKbis-PT-5320-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (SPRY_equals_0 <= EGFR_stimulus_equals_0)
lola: after: (SPRY_equals_0 <= 1)
lola: LP says that atomic proposition is always true: (SPRY_equals_0 <= 1)
lola: LP says that atomic proposition is always false: (3 <= EGFR_equals_0)
lola: LP says that atomic proposition is always false: (2 <= MAP3K1_3_equals_1)
lola: LP says that atomic proposition is always false: (3 <= JNK_equals_0)
lola: LP says that atomic proposition is always false: (3 <= MEK1_2_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (FOXO3_equals_1 <= TGFBR_stimulus_equals_1)
lola: after: (FOXO3_equals_1 <= 0)
lola: LP says that atomic proposition is always false: (2 <= SMAD_equals_1)
lola: LP says that atomic proposition is always false: (3 <= RSK_equals_0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= EGFR_stimulus_equals_0)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= GADD45_equals_1)
lola: LP says that atomic proposition is always false: (2 <= RAF_equals_1)
lola: A (F (F (X (F ((ERK_equals_0 <= GADD45_equals_1)))))) : A (G (F (((GAB1_equals_1 <= SPRY_equals_0) U TRUE)))) : A ((PPP2CA_equals_1 <= MSK_equals_1)) : A ((p21_equals_0 <= AKT_equals_1)) : A ((X (F ((1 <= ERK_equals_1))) U X (F ((1 <= p14_equals_0))))) : A ((F (G (FALSE)) U (FALSE U FALSE))) : A (FALSE) : A ((F ((FOXO3_equals_1 <= 0)) U X (F (FALSE)))) : A ((G (F ((MSK_equals_0 <= p53_equals_1))) U X (G ((MSK_equals_1 <= ERK_equals_1))))) : A (FALSE) : A ((p70_equals_1 <= MSK_equals_0)) : A (G (FALSE)) : A (G (G ((PKC_equals_1 <= DUSP1_equals_0)))) : A ((((TAOK_equals_0 <= ATM_equals_0) U FALSE) U ((1 <= SOS_equals_0) U (1 <= Proliferation_equals_1)))) : A (G (X (((1 <= DUSP1_equals_0) U (1 <= MYC_equals_0))))) : A (X (G (FALSE)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-1 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: (PPP2CA_equals_1 <= MSK_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (PPP2CA_equals_1 <= MSK_equals_1)
lola: processed formula length: 33
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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 MAPKbis-PT-5320-LTLCardinality-2 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: (p21_equals_0 <= AKT_equals_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21_equals_0 <= AKT_equals_1)
lola: processed formula length: 30
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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 MAPKbis-PT-5320-LTLCardinality-3 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.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 MAPKbis-PT-5320-LTLCardinality-5 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.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 MAPKbis-PT-5320-LTLCardinality-6 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.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 MAPKbis-PT-5320-LTLCardinality-7 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.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 MAPKbis-PT-5320-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p70_equals_1 <= MSK_equals_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p70_equals_1 <= MSK_equals_0)
lola: processed formula length: 30
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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 MAPKbis-PT-5320-LTLCardinality-10 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.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 MAPKbis-PT-5320-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.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 MAPKbis-PT-5320-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((ERK_equals_0 <= GADD45_equals_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((ERK_equals_0 <= GADD45_equals_1))))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 35 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((MSK_equals_1 <= ERK_equals_1))) OR (G (F ((MSK_equals_0 <= p53_equals_1))) AND F (G ((MSK_equals_1 <= ERK_equals_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((MSK_equals_1 <= ERK_equals_1))) OR (G (F ((MSK_equals_0 <= p53_equals_1))) AND F (G ((MSK_equals_1 <= ERK_equals_1))))))
lola: processed formula length: 131
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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: 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: 25 markings, 26 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((1 <= MYC_equals_0)) AND ((1 <= DUSP1_equals_0) OR (1 <= MYC_equals_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((1 <= MYC_equals_0)) AND ((1 <= DUSP1_equals_0) OR (1 <= MYC_equals_0))))))
lola: processed formula length: 88
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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: 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: 24 markings, 24 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p14_equals_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p14_equals_0))))
lola: processed formula length: 31
lola: 48 rewrites
lola: closed formula file MAPKbis-PT-5320-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: 2 markings, 1 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((PKC_equals_1 <= DUSP1_equals_0)))
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 ((PKC_equals_1 <= DUSP1_equals_0)))
lola: processed formula length: 40
lola: 50 rewrites
lola: closed formula file MAPKbis-PT-5320-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: (DUSP1_equals_0 + 1 <= PKC_equals_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPKbis-PT-5320-LTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPKbis-PT-5320-LTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 679801 markings, 1821508 edges, 135960 markings/sec, 0 secs
lola: sara is running 5 secs || 1231277 markings, 3907552 edges, 110295 markings/sec, 5 secs
lola: sara is running 10 secs || 1690156 markings, 6526200 edges, 91776 markings/sec, 10 secs
lola: sara is running 15 secs || 2115024 markings, 9052104 edges, 84974 markings/sec, 15 secs
lola: sara is running 20 secs || 2518547 markings, 11515727 edges, 80705 markings/sec, 20 secs
lola: sara is running 25 secs || 2873105 markings, 14252093 edges, 70912 markings/sec, 25 secs
lola: sara is running 30 secs || 3207664 markings, 17087155 edges, 66912 markings/sec, 30 secs
lola: sara is running 35 secs || 3521225 markings, 19968448 edges, 62712 markings/sec, 35 secs
lola: sara is running 40 secs || 3843548 markings, 22690183 edges, 64465 markings/sec, 40 secs
lola: sara is running 45 secs || 4103529 markings, 25939150 edges, 51996 markings/sec, 45 secs
lola: sara is running 50 secs || 4180338 markings, 29909595 edges, 15362 markings/sec, 50 secs
lola: sara is running 55 secs || 4185323 markings, 33998871 edges, 997 markings/sec, 55 secs
lola: sara is running 60 secs || 4186114 markings, 38240806 edges, 158 markings/sec, 60 secs
lola: sara is running 65 secs || 4186114 markings, 42988671 edges, 0 markings/sec, 65 secs
lola: sara is running 70 secs || 4671946 markings, 45127897 edges, 97166 markings/sec, 70 secs
lola: sara is running 75 secs || 5135991 markings, 47180168 edges, 92809 markings/sec, 75 secs
lola: sara is running 80 secs || 5549836 markings, 49723057 edges, 82769 markings/sec, 80 secs
lola: sara is running 85 secs || 5965469 markings, 51985220 edges, 83127 markings/sec, 85 secs
lola: sara is running 90 secs || 6391253 markings, 53976185 edges, 85157 markings/sec, 90 secs
lola: sara is running 95 secs || 6768568 markings, 56021130 edges, 75463 markings/sec, 95 secs
lola: sara is running 100 secs || 7110403 markings, 58483564 edges, 68367 markings/sec, 100 secs
lola: sara is running 105 secs || 7425431 markings, 61176865 edges, 63006 markings/sec, 105 secs
lola: sara is running 110 secs || 7708538 markings, 64337842 edges, 56621 markings/sec, 110 secs
lola: sara is running 115 secs || 7987694 markings, 67784215 edges, 55831 markings/sec, 115 secs
lola: sara is running 120 secs || 8125502 markings, 71370211 edges, 27562 markings/sec, 120 secs
lola: sara is running 125 secs || 8126386 markings, 75133408 edges, 177 markings/sec, 125 secs
lola: sara is running 130 secs || 8126465 markings, 79119662 edges, 16 markings/sec, 130 secs
lola: sara is running 135 secs || 8126465 markings, 83632966 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || 8126465 markings, 87927082 edges, 0 markings/sec, 140 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8126465 markings, 89937545 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= SOS_equals_0) U (1 <= Proliferation_equals_1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= SOS_equals_0) U (1 <= Proliferation_equals_1)))
lola: processed formula length: 57
lola: 52 rewrites
lola: closed formula file MAPKbis-PT-5320-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 16 markings, 16 edges
lola: ========================================

FORMULA MAPKbis-PT-5320-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes no no no no no yes no yes no no no
lola:
preliminary result: no yes yes no yes no no no no no yes no yes no no no
lola: memory consumption: 19744 KB
lola: time consumption: 147 seconds

BK_STOP 1527790099022

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="MAPKbis-PT-5320"
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/MAPKbis-PT-5320.tgz
mv MAPKbis-PT-5320 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 MAPKbis-PT-5320, 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 r280-csrt-152749169800302"
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 ;