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 492K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 311K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Eratosthenes-PT-200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998000035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526605986725

info: Time: 3600 - MCC
===========================================================================================
prep: translating Eratosthenes-PT-200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Eratosthenes-PT-200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Eratosthenes-PT-200 @ 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: 898/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: Size of bit vector: 199
lola: finding significant places
lola: 199 places, 699 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 796 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-200-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t116.2) AND NOT FIREABLE(t160.16) AND NOT FIREABLE(t132.6) AND NOT FIREABLE(t168.21) AND (FIREABLE(t99.33) OR NOT FIREABLE(t105.35))))) : A (G ((FIREABLE(t40.4) OR FIREABLE(t180.9) OR (FIREABLE(t128.32) AND FIREABLE(t30.15)) OR FIREABLE(t32.2) OR FIREABLE(t24.4) OR FIREABLE(t80.40)))) : A (G ((FIREABLE(t185.5) OR FIREABLE(t156.52)))) : A (G (((FIREABLE(t90.5) AND FIREABLE(t125.25)) OR FIREABLE(t76.38) OR FIREABLE(t144.36) OR NOT FIREABLE(t110.10)))) : A (G ((FIREABLE(t30.5) OR FIREABLE(t188.4)))) : A (G ((FIREABLE(t125.5) OR FIREABLE(t160.20)))) : A (G ((NOT FIREABLE(t54.3) OR NOT FIREABLE(t168.12) OR FIREABLE(t108.36) OR FIREABLE(t21.3)))) : A (G ((FIREABLE(t68.17) OR FIREABLE(t105.35) OR FIREABLE(t125.25) OR FIREABLE(t120.2) OR FIREABLE(t171.57) OR NOT FIREABLE(t33.3)))) : A (G (((FIREABLE(t98.2) OR FIREABLE(t133.7)) AND (FIREABLE(t98.49) OR FIREABLE(t60.30))))) : A (G (((FIREABLE(t176.11) AND FIREABLE(t54.6)) OR (FIREABLE(t128.4) AND FIREABLE(t56.2)) OR (NOT FIREABLE(t60.6) AND (FIREABLE(t155.5) OR FIREABLE(t164.2)))))) : A (G (((FIREABLE(t123.3) AND FIREABLE(t93.3)) OR FIREABLE(t135.5)))) : E (F ((NOT FIREABLE(t116.29) AND NOT FIREABLE(t152.76) AND (NOT FIREABLE(t120.60) OR NOT FIREABLE(t132.22)) AND FIREABLE(t130.65) AND FIREABLE(t64.8)))) : A (G ((FIREABLE(t185.5) OR FIREABLE(t135.5) OR NOT FIREABLE(t90.9) OR NOT FIREABLE(t104.26) OR FIREABLE(t44.4) OR FIREABLE(t102.51)))) : A (G ((FIREABLE(t64.16) OR FIREABLE(t54.18) OR NOT FIREABLE(t156.52) OR FIREABLE(t125.25) OR (NOT FIREABLE(t75.5) AND NOT FIREABLE(t36.2) AND FIREABLE(t180.45))))) : E (F ((NOT FIREABLE(t126.3) AND NOT FIREABLE(t170.2) AND (NOT FIREABLE(t150.50) OR NOT FIREABLE(t54.2)) AND (NOT FIREABLE(t40.5) OR FIREABLE(t76.19) OR ((FIREABLE(t156.39) OR FIREABLE(t81.9)) AND (FIREABLE(t87.3) OR FIREABLE(t93.31))))))) : E (F (((NOT FIREABLE(t198.9) OR NOT FIREABLE(t96.12) OR NOT FIREABLE(t165.15) OR NOT FIREABLE(t69.23)) AND NOT FIREABLE(t93.31))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t185.5) OR FIREABLE(t156.52))))
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 ((FIREABLE(t185.5) OR FIREABLE(t156.52))))
lola: processed formula length: 48
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t185.5) AND NOT FIREABLE(t156.52))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-2 FALSE 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: A (G ((FIREABLE(t30.5) OR FIREABLE(t188.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 ((FIREABLE(t30.5) OR FIREABLE(t188.4))))
lola: processed formula length: 46
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t30.5) AND NOT FIREABLE(t188.4))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-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: 41 markings, 40 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t125.5) OR FIREABLE(t160.20))))
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 ((FIREABLE(t125.5) OR FIREABLE(t160.20))))
lola: processed formula length: 48
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t125.5) AND NOT FIREABLE(t160.20))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA Eratosthenes-PT-200-ReachabilityFireability-5 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: A (G (((FIREABLE(t123.3) AND FIREABLE(t93.3)) OR FIREABLE(t135.5))))
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 (((FIREABLE(t123.3) AND FIREABLE(t93.3)) OR FIREABLE(t135.5))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: ((NOT FIREABLE(t123.3) OR NOT FIREABLE(t93.3)) AND NOT FIREABLE(t135.5))
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-3-0.sara
sara: try reading problem file Eratosthenes-PT-200-ReachabilityFireability-2-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: 14 markings, 13 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t98.2) OR FIREABLE(t133.7)) AND (FIREABLE(t98.49) OR FIREABLE(t60.30)))))
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 (((FIREABLE(t98.2) OR FIREABLE(t133.7)) AND (FIREABLE(t98.49) OR FIREABLE(t60.30)))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: ((NOT FIREABLE(t98.2) AND NOT FIREABLE(t133.7)) OR (NOT FIREABLE(t98.49) AND NOT FIREABLE(t60.30)))
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-200-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 71 markings, 70 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t54.3) OR NOT FIREABLE(t168.12) OR FIREABLE(t108.36) OR FIREABLE(t21.3))))
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 ((NOT FIREABLE(t54.3) OR NOT FIREABLE(t168.12) OR FIREABLE(t108.36) OR FIREABLE(t21.3))))
lola: processed formula length: 97
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (FIREABLE(t54.3) AND FIREABLE(t168.12) AND NOT FIREABLE(t108.36) AND NOT FIREABLE(t21.3))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 152 markings, 156 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t90.5) AND FIREABLE(t125.25)) OR FIREABLE(t76.38) OR FIREABLE(t144.36) OR NOT FIREABLE(t110.10))))
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 (((FIREABLE(t90.5) AND FIREABLE(t125.25)) OR FIREABLE(t76.38) OR FIREABLE(t144.36) OR NOT FIREABLE(t110.10))))
lola: processed formula length: 118
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: ((NOT FIREABLE(t90.5) OR NOT FIREABLE(t125.25)) AND NOT FIREABLE(t76.38) AND NOT FIREABLE(t144.36) AND FIREABLE(t110.10))
lola: state equation: Generated DNF with 80 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-6-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: 7 markings, 6 edges

FORMULA Eratosthenes-PT-200-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: sara: place or transition ordering is non-deterministic
========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t198.9) OR NOT FIREABLE(t96.12) OR NOT FIREABLE(t165.15) OR NOT FIREABLE(t69.23)) AND NOT FIREABLE(t93.31))))
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 (((NOT FIREABLE(t198.9) OR NOT FIREABLE(t96.12) OR NOT FIREABLE(t165.15) OR NOT FIREABLE(t69.23)) AND NOT FIREABLE(t93.31))))
lola: processed formula length: 133
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: ((NOT FIREABLE(t198.9) OR NOT FIREABLE(t96.12) OR NOT FIREABLE(t165.15) OR NOT FIREABLE(t69.23)) AND NOT FIREABLE(t93.31))
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA Eratosthenes-PT-200-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t68.17) OR FIREABLE(t105.35) OR FIREABLE(t125.25) OR FIREABLE(t120.2) OR FIREABLE(t171.57) OR NOT FIREABLE(t33.3))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file Eratosthenes-PT-200-ReachabilityFireability-7-0.sara.
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 ((FIREABLE(t68.17) OR FIREABLE(t105.35) OR FIREABLE(t125.25) OR FIREABLE(t120.2) OR FIREABLE(t171.57) OR NOT FIREABLE(t33.3))))
lola: processed formula length: 137
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t116.29) AND NOT FIREABLE(t152.76) AND (NOT FIREABLE(t120.60) OR NOT FIREABLE(t132.22)) AND FIREABLE(t130.65) AND FIREABLE(t64.8))))
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 ((NOT FIREABLE(t116.29) AND NOT FIREABLE(t152.76) AND (NOT FIREABLE(t120.60) OR NOT FIREABLE(t132.22)) AND FIREABLE(t130.65) AND FIREABLE(t64.8))))
lola: processed formula length: 153
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t116.29) AND NOT FIREABLE(t152.76) AND (NOT FIREABLE(t120.60) OR NOT FIREABLE(t132.22)) AND FIREABLE(t130.65) AND FIREABLE(t64.8))
lola: state equation: Generated DNF with 112 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t185.5) OR FIREABLE(t135.5) OR NOT FIREABLE(t90.9) OR NOT FIREABLE(t104.26) OR FIREABLE(t44.4) OR FIREABLE(t102.51))))
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 ((FIREABLE(t185.5) OR FIREABLE(t135.5) OR NOT FIREABLE(t90.9) OR NOT FIREABLE(t104.26) OR FIREABLE(t44.4) OR FIREABLE(t102.51))))
lola: processed formula length: 139
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t185.5) AND NOT FIREABLE(t135.5) AND FIREABLE(t90.9) AND FIREABLE(t104.26) AND NOT FIREABLE(t44.4) AND NOT FIREABLE(t102.51))
lola: state equation: Generated DNF with 128 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-200-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t116.2) AND NOT FIREABLE(t160.16) AND NOT FIREABLE(t132.6) AND NOT FIREABLE(t168.21) AND (FIREABLE(t99.33) OR NOT FIREABLE(t105.35)))))
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 ((NOT FIREABLE(t116.2) AND NOT FIREABLE(t160.16) AND NOT FIREABLE(t132.6) AND NOT FIREABLE(t168.21) AND (FIREABLE(t99.33) OR NOT FIREABLE(t105.35)))))
lola: processed formula length: 156
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t116.2) AND NOT FIREABLE(t160.16) AND NOT FIREABLE(t132.6) AND NOT FIREABLE(t168.21) AND (FIREABLE(t99.33) OR NOT FIREABLE(t105.35)))
lola: state equation: Generated DNF with 256 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 57 markings, 56 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-0 TRUE 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 (G ((FIREABLE(t40.4) OR FIREABLE(t180.9) OR (FIREABLE(t128.32) AND FIREABLE(t30.15)) OR FIREABLE(t32.2) OR FIREABLE(t24.4) OR FIREABLE(t80.40))))
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 ((FIREABLE(t40.4) OR FIREABLE(t180.9) OR (FIREABLE(t128.32) AND FIREABLE(t30.15)) OR FIREABLE(t32.2) OR FIREABLE(t24.4) OR FIREABLE(t80.40))))
lola: processed formula length: 152
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t40.4) AND NOT FIREABLE(t180.9) AND (NOT FIREABLE(t128.32) OR NOT FIREABLE(t30.15)) AND NOT FIREABLE(t32.2) AND NOT FIREABLE(t24.4) AND NOT FIREABLE(t80.40))
lola: state equation: Generated DNF with 768 literals and 128 conjunctive subformulas

lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-12-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: 73 markings, 72 edges
sara: place or transition ordering is non-deterministic
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t64.16) OR FIREABLE(t54.18) OR NOT FIREABLE(t156.52) OR FIREABLE(t125.25) OR (NOT FIREABLE(t75.5) AND NOT FIREABLE(t36.2) AND FIREABLE(t180.45)))))
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 ((FIREABLE(t64.16) OR FIREABLE(t54.18) OR NOT FIREABLE(t156.52) OR FIREABLE(t125.25) OR (NOT FIREABLE(t75.5) AND NOT FIREABLE(t36.2) AND FIREABLE(t180.45)))))
lola: processed formula length: 167
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t64.16) AND NOT FIREABLE(t54.18) AND FIREABLE(t156.52) AND NOT FIREABLE(t125.25) AND (FIREABLE(t75.5) OR FIREABLE(t36.2) OR NOT FIREABLE(t180.45)))
lola: state equation: Generated DNF with 208 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges

FORMULA Eratosthenes-PT-200-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t176.11) AND FIREABLE(t54.6)) OR (FIREABLE(t128.4) AND FIREABLE(t56.2)) OR (NOT FIREABLE(t60.6) AND (FIREABLE(t155.5) OR FIREABLE(t164.2))))))
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 (((FIREABLE(t176.11) AND FIREABLE(t54.6)) OR (FIREABLE(t128.4) AND FIREABLE(t56.2)) OR (NOT FIREABLE(t60.6) AND (FIREABLE(t155.5) OR FIREABLE(t164.2))))))
lola: processed formula length: 162
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: ((NOT FIREABLE(t176.11) OR NOT FIREABLE(t54.6)) AND (NOT FIREABLE(t128.4) OR NOT FIREABLE(t56.2)) AND (FIREABLE(t60.6) OR (NOT FIREABLE(t155.5) AND NOT FIREABLE(t164.2))))
lola: state equation: Generated DNF with 304 literals and 76 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-200-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 58 markings, 57 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t126.3) AND NOT FIREABLE(t170.2) AND (NOT FIREABLE(t150.50) OR NOT FIREABLE(t54.2)) AND (NOT FIREABLE(t40.5) OR FIREABLE(t76.19) OR ((FIREABLE(t156.39) OR FIREABLE(t81.9)) AND (FIREABLE(t87.3) OR FIREABLE(t93.31)))))))
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 ((NOT FIREABLE(t126.3) AND NOT FIREABLE(t170.2) AND (NOT FIREABLE(t150.50) OR NOT FIREABLE(t54.2)) AND (NOT FIREABLE(t40.5) OR FIREABLE(t76.19) OR ((FIREABLE(t156.39) OR FIREABLE(t81.9)) AND (FIREABLE(t87.3) OR FIREABLE(t93.31)))))))
lola: processed formula length: 243
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-200-ReachabilityFireability.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: (NOT FIREABLE(t126.3) AND NOT FIREABLE(t170.2) AND (NOT FIREABLE(t150.50) OR NOT FIREABLE(t54.2)) AND (NOT FIREABLE(t40.5) OR FIREABLE(t76.19) OR ((FIREABLE(t156.39) OR FIREABLE(t81.9)) AND (FIREABLE(t87.3) OR FIREABLE(t93.31)))))
lola: state equation: Generated DNF with 544 literals and 96 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-200-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA Eratosthenes-PT-200-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no no no yes no no yes yes
lola:
preliminary result: yes no no no no no no no no no no yes no no yes yes
lola: memory consumption: 15432 KB
lola: time consumption: 1 seconds


BK_STOP 1526605987235

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