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 4.8M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 4.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D40N150, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-blw3-152732474200081
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527865234135

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D40N150 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D40N150 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D40N150 @ 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: 13924/65536 symbol table entries, 3777 collisions
lola: preprocessing...
lola: Size of bit vector: 51200
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1600 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D40N150-LTLCardinality.task
lola: A (X (X (F (F ((cAMP__25_16_ <= cAMP__17_12_)))))) : A (F (X (G ((cAMP__22_30_ <= cAMP__5_5_))))) : A (G ((cAMP__28_7_ <= cAMP__25_21_))) : A (X (X (F (X ((cAMP__24_25_ <= cAMP__30_21_)))))) : A (X ((X ((cAMP__11_2_ <= cAMP__26_23_)) U (3 <= cAMP__25_31_)))) : A ((F (F ((cAMP__24_27_ <= cAMP__38_27_))) U (cAMP__4_36_ <= cAMP__38_5_))) : A (X ((X ((3 <= cAMP__17_40_)) U X ((3 <= cAMP__10_25_))))) : A (F ((G ((3 <= cAMP__19_30_)) U (3 <= cAMP__2_27_)))) : A ((((cAMP__16_22_ <= cAMP__9_31_) U (3 <= cAMP__28_10_)) U (2 <= cAMP__22_5_))) : A (G ((cAMP__12_26_ <= cAMP__20_4_))) : A (G (G (((cAMP__28_12_ <= cAMP__36_29_) U (cAMP__28_21_ <= cAMP__5_9_))))) : A (X ((F ((cAMP__8_14_ <= cAMP__32_31_)) U X ((cAMP__28_16_ <= cAMP__36_11_))))) : A (G ((F ((2 <= cAMP__9_10_)) U X ((cAMP__2_15_ <= cAMP__7_26_))))) : A (F (((3 <= cAMP__21_16_) U (cAMP__24_40_ <= cAMP__22_23_)))) : A (F (X (X ((cAMP__28_24_ <= cAMP__6_34_))))) : A (((cAMP__39_2_ <= cAMP__16_12_) U (cAMP__1_2_ <= cAMP__39_25_)))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((cAMP__25_16_ <= cAMP__17_12_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((cAMP__25_16_ <= cAMP__17_12_)))))
lola: processed formula length: 46
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: 70 markings, 136 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((cAMP__24_25_ <= cAMP__30_21_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((cAMP__24_25_ <= cAMP__30_21_))))))
lola: processed formula length: 50
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 403 markings, 1328 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((cAMP__11_2_ <= cAMP__26_23_)) U (3 <= cAMP__25_31_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((cAMP__11_2_ <= cAMP__26_23_)) U (3 <= cAMP__25_31_))))
lola: processed formula length: 65
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: 5106 markings, 5107 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((3 <= cAMP__17_40_) U (3 <= cAMP__10_25_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= cAMP__17_40_) U (3 <= cAMP__10_25_)))))
lola: processed formula length: 55
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: 2554 markings, 2554 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((cAMP__8_14_ <= cAMP__32_31_)) U X ((cAMP__28_16_ <= cAMP__36_11_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((cAMP__8_14_ <= cAMP__32_31_)) U X ((cAMP__28_16_ <= cAMP__36_11_)))))
lola: processed formula length: 80
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 70 markings, 136 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((cAMP__2_15_ <= cAMP__7_26_)))) AND A (G ((F ((2 <= cAMP__9_10_)) OR X ((cAMP__2_15_ <= cAMP__7_26_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((cAMP__2_15_ <= cAMP__7_26_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((cAMP__2_15_ <= cAMP__7_26_))))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: 129931 markings, 294550 edges, 25986 markings/sec, 0 secs
lola: 223386 markings, 566319 edges, 18691 markings/sec, 5 secs
lola: 310992 markings, 823866 edges, 17521 markings/sec, 10 secs
lola: 380803 markings, 1097949 edges, 13962 markings/sec, 15 secs
lola: 449398 markings, 1375474 edges, 13719 markings/sec, 20 secs
lola: 534437 markings, 1633319 edges, 17008 markings/sec, 25 secs
lola: 627588 markings, 1880064 edges, 18630 markings/sec, 30 secs
lola: 721089 markings, 2127451 edges, 18700 markings/sec, 35 secs
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: 764530 markings, 2243409 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((cAMP__28_24_ <= cAMP__6_34_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((cAMP__28_24_ <= cAMP__6_34_)))))
lola: processed formula length: 45
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: 70 markings, 136 edges
lola:
FORMULA Diffusion2D-PT-D40N150-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__12_26_ <= cAMP__20_4_)))
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 ((cAMP__12_26_ <= cAMP__20_4_)))
lola: processed formula length: 37
lola: 22 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: (cAMP__20_4_ + 1 <= cAMP__12_26_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N150-LTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N150-LTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__28_7_ <= cAMP__25_21_)))
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 ((cAMP__28_7_ <= cAMP__25_21_)))
lola: processed formula length: 37
lola: 22 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: (cAMP__25_21_ + 1 <= cAMP__28_7_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N150-LTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N150-LTLCardinality-8-0.sara.
lola: sara is running 0 secs || 9499 markings, 28031 edges, 1900 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 19244 markings, 54824 edges, 1949 markings/sec, 5 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((cAMP__24_40_ <= cAMP__22_23_)))
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: (cAMP__22_23_ + 1 <= cAMP__24_40_)
lola: processed formula length: 34
lola: 22 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= cAMP__2_27_) OR (G ((3 <= cAMP__19_30_)) AND F ((3 <= cAMP__2_27_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((3 <= cAMP__2_27_) OR (G ((3 <= cAMP__19_30_)) AND F ((3 <= cAMP__2_27_))))))
lola: processed formula length: 84
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((cAMP__22_30_ <= cAMP__5_5_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((cAMP__22_30_ <= cAMP__5_5_))))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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 7249
lola: add low 1183
lola: add low 7404
lola: add low 1330
lola: add low 7548
lola: add low 1474
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: 58053 markings, 138307 edges

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__16_22_ <= cAMP__9_31_) U (3 <= cAMP__28_10_)) U (2 <= cAMP__22_5_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__16_22_ <= cAMP__9_31_) U (3 <= cAMP__28_10_)) U (2 <= cAMP__22_5_)))
lola: processed formula length: 80
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: 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: 6 markings, 6 edges

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((cAMP__24_27_ <= cAMP__38_27_)) U (cAMP__4_36_ <= cAMP__38_5_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((cAMP__24_27_ <= cAMP__38_27_)) U (cAMP__4_36_ <= cAMP__38_5_)))
lola: processed formula length: 71
lola: 20 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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 Diffusion2D-PT-D40N150-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1732 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((cAMP__39_2_ <= cAMP__16_12_) U (cAMP__1_2_ <= cAMP__39_25_)))
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 (((cAMP__39_2_ <= cAMP__16_12_) U (cAMP__1_2_ <= cAMP__39_25_)))
lola: processed formula length: 66
lola: 24 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola:
FORMULA Diffusion2D-PT-D40N150-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((cAMP__28_21_ <= cAMP__5_9_)))) AND A (G (((cAMP__28_12_ <= cAMP__36_29_) OR (cAMP__28_21_ <= cAMP__5_9_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__28_12_ <= cAMP__36_29_) OR (cAMP__28_21_ <= cAMP__5_9_))))
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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((cAMP__28_12_ <= cAMP__36_29_) OR (cAMP__28_21_ <= cAMP__5_9_))))
lola: processed formula length: 72
lola: 25 rewrites
lola: closed formula file Diffusion2D-PT-D40N150-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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((cAMP__36_29_ + 1 <= cAMP__28_12_) AND (cAMP__5_9_ + 1 <= cAMP__28_21_))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Diffusion2D-PT-D40N150-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes no no no no no yes no yes yes yes
lola:
preliminary result: yes no no yes no yes no no no no no yes no yes yes yes
lola: memory consumption: 30932 KB
lola: time consumption: 105 seconds

BK_STOP 1527865339194

--------------------
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="Diffusion2D-PT-D40N150"
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/Diffusion2D-PT-D40N150.tgz
mv Diffusion2D-PT-D40N150 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 Diffusion2D-PT-D40N150, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r232-blw3-152732474200081"
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 ;