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 2.4M
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 209K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K 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 60K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 193K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547200243
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527031858463

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ SafeBus-PT-10 @ 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: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: Size of bit vector: 10112
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-10-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10)
lola: after: (0 <= 9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= T_out)
lola: LP says that atomic proposition is always false: (3 <= ACK)
lola: LP says that atomic proposition is always false: (2 <= MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= ACK)
lola: after: (1 <= ACK)
lola: place invariant simplifies atomic proposition
lola: before: (msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10 <= S_tout)
lola: after: (10 <= S_tout)
lola: LP says that atomic proposition is always false: (10 <= S_tout)
lola: LP says that atomic proposition is always false: (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1)
lola: LP says that atomic proposition is always false: (2 <= R_tout)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= S_tout)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10)
lola: after: (0 <= 7)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10 <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9)
lola: after: (10 <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9)
lola: LP says that atomic proposition is always false: (3 <= cable_free)
lola: LP says that atomic proposition is always false: (2 <= Cpt2_4)
lola: LP says that atomic proposition is always false: (2 <= AMC_1_5)
lola: place invariant simplifies atomic proposition
lola: before: (wait_msg_8 <= msgl_5)
lola: after: (wait_msg_8 <= 1)
lola: LP says that atomic proposition is always true: (wait_msg_8 <= 1)
lola: LP says that atomic proposition is always false: (3 <= MSG_9)
lola: LP says that atomic proposition is always false: (3 <= AMC_10_7)
lola: LP says that atomic proposition is always false: (2 <= RMC_3)
lola: LP says that atomic proposition is always false: (2 <= FMC_4)
lola: LP says that atomic proposition is always false: (2 <= PMC_5)
lola: LP says that atomic proposition is always false: (2 <= MSG_1)
lola: LP says that atomic proposition is always false: (3 <= AMC_4_1)
lola: LP says that atomic proposition is always false: (3 <= cable_used_5)
lola: LP says that atomic proposition is always false: (2 <= wait_ack_1_6)
lola: A (G (())) : E (F (FALSE)) : E (F (())) : E (F (())) : E (F (((ACK <= R_tout) AND (3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10)))) : E (F (())) : E (F (())) : E (F (FALSE)) : E (F (())) : A (G (())) : A (G (())) : A (G (())) : E (F (FALSE)) : A (G (((AMC_5_8 + 1 <= wait_ack_7_10) OR (AMC_6_8 <= wait_msg_6)))) : A (G (((AMC_2_9 <= AMC_6_1) AND (wait_msg_5 <= PMC_7)))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 589 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 707 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 884 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: 39 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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 SafeBus-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((AMC_2_9 <= AMC_6_1) AND (wait_msg_5 <= PMC_7))))
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 (((AMC_2_9 <= AMC_6_1) AND (wait_msg_5 <= PMC_7))))
lola: processed formula length: 56
lola: 41 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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: ((AMC_6_1 + 1 <= AMC_2_9) OR (PMC_7 + 1 <= wait_msg_5))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA SafeBus-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((AMC_5_8 + 1 <= wait_ack_7_10) OR (AMC_6_8 <= wait_msg_6))))
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 (((AMC_5_8 + 1 <= wait_ack_7_10) OR (AMC_6_8 <= wait_msg_6))))
lola: processed formula length: 68
lola: 41 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.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: ((wait_ack_7_10 <= AMC_5_8) AND (wait_msg_6 + 1 <= AMC_6_8))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-10-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================

FORMULA SafeBus-PT-10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ACK <= R_tout) AND (3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((ACK <= R_tout) AND (3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10))))
lola: processed formula length: 155
lola: 40 rewrites
lola: closed formula file SafeBus-PT-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((ACK <= R_tout) AND (3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-PT-10-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 8472 markings, 11451 edges, 1694 markings/sec, 0 secs
lola: sara is running 5 secs || 17035 markings, 24041 edges, 1713 markings/sec, 5 secs
lola: sara is running 10 secs || 25397 markings, 37136 edges, 1672 markings/sec, 10 secs
lola: sara is running 15 secs || 33956 markings, 51237 edges, 1712 markings/sec, 15 secs
lola: sara is running 20 secs || 42491 markings, 65401 edges, 1707 markings/sec, 20 secs
lola: sara is running 25 secs || 51090 markings, 79806 edges, 1720 markings/sec, 25 secs
lola: sara is running 30 secs || 59826 markings, 94446 edges, 1747 markings/sec, 30 secs
lola: sara is running 35 secs || 68237 markings, 108833 edges, 1682 markings/sec, 35 secs
lola: sara is running 40 secs || 76706 markings, 123763 edges, 1694 markings/sec, 40 secs
lola: sara is running 45 secs || 85051 markings, 138163 edges, 1669 markings/sec, 45 secs
lola: sara is running 50 secs || 93584 markings, 153279 edges, 1707 markings/sec, 50 secs
lola: sara is running 55 secs || 102326 markings, 168509 edges, 1748 markings/sec, 55 secs
lola: sara is running 60 secs || 111175 markings, 185184 edges, 1770 markings/sec, 60 secs
lola: sara is running 65 secs || 119919 markings, 200900 edges, 1749 markings/sec, 65 secs
lola: sara is running 70 secs || 128429 markings, 216072 edges, 1702 markings/sec, 70 secs
lola: sara is running 75 secs || 136900 markings, 231755 edges, 1694 markings/sec, 75 secs
lola: sara is running 80 secs || 145239 markings, 247525 edges, 1668 markings/sec, 80 secs
lola: sara is running 85 secs || 154032 markings, 263599 edges, 1759 markings/sec, 85 secs
lola: sara is running 90 secs || 162432 markings, 278901 edges, 1680 markings/sec, 90 secs
lola: sara is running 95 secs || 170857 markings, 294742 edges, 1685 markings/sec, 95 secs
lola: sara is running 100 secs || 179488 markings, 310974 edges, 1726 markings/sec, 100 secs
lola: sara is running 105 secs || 188349 markings, 328666 edges, 1772 markings/sec, 105 secs
lola: sara is running 110 secs || 197296 markings, 345679 edges, 1789 markings/sec, 110 secs
lola: sara is running 115 secs || 205911 markings, 361887 edges, 1723 markings/sec, 115 secs
lola: sara is running 120 secs || 214312 markings, 377795 edges, 1680 markings/sec, 120 secs
lola: sara is running 125 secs || 223044 markings, 394466 edges, 1746 markings/sec, 125 secs
lola: sara is running 130 secs || 232045 markings, 412164 edges, 1800 markings/sec, 130 secs
lola: sara is running 135 secs || 240979 markings, 429342 edges, 1787 markings/sec, 135 secs
lola: sara is running 140 secs || 250042 markings, 446850 edges, 1813 markings/sec, 140 secs
lola: sara is running 145 secs || 258704 markings, 463539 edges, 1732 markings/sec, 145 secs
lola: sara is running 150 secs || 267578 markings, 480025 edges, 1775 markings/sec, 150 secs
lola: sara is running 155 secs || 276597 markings, 498313 edges, 1804 markings/sec, 155 secs
lola: sara is running 160 secs || 285368 markings, 516255 edges, 1754 markings/sec, 160 secs
lola: sara is running 165 secs || 294027 markings, 533379 edges, 1732 markings/sec, 165 secs
lola: sara is running 170 secs || 302907 markings, 550637 edges, 1776 markings/sec, 170 secs
lola: sara is running 175 secs || 311876 markings, 569068 edges, 1794 markings/sec, 175 secs
lola: sara is running 180 secs || 320763 markings, 586766 edges, 1777 markings/sec, 180 secs
lola: sara is running 185 secs || 329711 markings, 604007 edges, 1790 markings/sec, 185 secs
lola: sara is running 190 secs || 338576 markings, 621979 edges, 1773 markings/sec, 190 secs
lola: sara is running 195 secs || 347350 markings, 639428 edges, 1755 markings/sec, 195 secs
lola: sara is running 200 secs || 356237 markings, 657089 edges, 1777 markings/sec, 200 secs
lola: sara is running 205 secs || 365215 markings, 674905 edges, 1796 markings/sec, 205 secs
lola: sara is running 210 secs || 374038 markings, 692774 edges, 1765 markings/sec, 210 secs
lola: sara is running 215 secs || 382955 markings, 709830 edges, 1783 markings/sec, 215 secs
lola: sara is running 220 secs || 391599 markings, 726569 edges, 1729 markings/sec, 220 secs
lola: sara is running 225 secs || 400189 markings, 743720 edges, 1718 markings/sec, 225 secs
lola: sara is running 230 secs || 409077 markings, 761497 edges, 1778 markings/sec, 230 secs
lola: sara is running 235 secs || 417765 markings, 778604 edges, 1738 markings/sec, 235 secs
lola: sara is running 240 secs || 426310 markings, 795331 edges, 1709 markings/sec, 240 secs
lola: sara is running 245 secs || 435079 markings, 812033 edges, 1754 markings/sec, 245 secs
lola: sara is running 250 secs || 443763 markings, 829935 edges, 1737 markings/sec, 250 secs
lola: sara is running 255 secs || 452209 markings, 846087 edges, 1689 markings/sec, 255 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 457626 markings, 856943 edges
lola: ========================================

FORMULA SafeBus-PT-10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no no no no yes yes yes no no no yes
lola:
preliminary result: yes no no no yes no no no no yes yes yes no no no yes
lola: memory consumption: 29408 KB
lola: time consumption: 295 seconds

BK_STOP 1527032153375

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