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 576K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:49 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 420K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CloudDeployment-PT-7a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357400266
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526633740180

info: Time: 3600 - MCC
===========================================================================================
prep: translating CloudDeployment-PT-7a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating CloudDeployment-PT-7a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ CloudDeployment-PT-7a @ 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: 1438/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 264
lola: finding significant places
lola: 264 places, 1174 transitions, 222 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1029 transition conflict sets
lola: TASK
lola: reading formula from CloudDeployment-PT-7a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t530) AND (FIREABLE(t863) OR FIREABLE(t953)) AND ((FIREABLE(t1031) AND FIREABLE(t863)) OR NOT FIREABLE(t727)) AND NOT FIREABLE(t406)))) : E (F (FIREABLE(t727))) : A (G (NOT FIREABLE(t213))) : E (F ((FIREABLE(t1016) AND NOT FIREABLE(t1081) AND FIREABLE(t798)))) : E (F ((FIREABLE(t303) AND (FIREABLE(t463) OR FIREABLE(t387))))) : E (F (((FIREABLE(t1004) AND FIREABLE(t1081)) OR FIREABLE(t229) OR (FIREABLE(t970) AND FIREABLE(t1138)) OR FIREABLE(t654) OR FIREABLE(t308)))) : E (F ((FIREABLE(t795) AND FIREABLE(t45) AND FIREABLE(t1143)))) : E (F (FIREABLE(t247))) : E (F (((FIREABLE(t207) AND FIREABLE(t538) AND NOT FIREABLE(t402)) OR (NOT FIREABLE(t130) AND FIREABLE(t261)) OR FIREABLE(t63)))) : E (F (FIREABLE(t547))) : E (F ((NOT FIREABLE(t732) AND NOT FIREABLE(t740) AND (NOT FIREABLE(t558) OR NOT FIREABLE(t664)) AND FIREABLE(t770) AND FIREABLE(t227)))) : A (G (((NOT FIREABLE(t580) AND NOT FIREABLE(t149) AND (NOT FIREABLE(t496) OR NOT FIREABLE(t960))) OR ((NOT FIREABLE(t216) OR NOT FIREABLE(t766)) AND (NOT FIREABLE(t622) OR NOT FIREABLE(t710)))))) : E (F (FIREABLE(t1083))) : A (G ((FIREABLE(t1167) OR FIREABLE(t543) OR FIREABLE(t772) OR FIREABLE(t455) OR FIREABLE(t174) OR FIREABLE(t251) OR FIREABLE(t928) OR NOT FIREABLE(t745)))) : E (F ((FIREABLE(t891) AND FIREABLE(t67)))) : E (F ((FIREABLE(t835) AND (FIREABLE(t34) OR FIREABLE(t769)) AND FIREABLE(t493) AND FIREABLE(t878) AND (FIREABLE(t391) OR FIREABLE(t791) OR FIREABLE(t308)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t727)))
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 (FIREABLE(t727)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: FIREABLE(t727)
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t213)))
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(t213)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file CloudDeployment-PT-7a-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(t213)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-2 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: E (F (FIREABLE(t247)))
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 (FIREABLE(t247)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: FIREABLE(t247)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-7 TRUE 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: E (F (FIREABLE(t547)))
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 (FIREABLE(t547)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: FIREABLE(t547)
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-3-0.sara

lola: ========================================
FORMULA CloudDeployment-PT-7a-ReachabilityFireability-9 TRUE 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: E (F (FIREABLE(t1083)))
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 (FIREABLE(t1083)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: FIREABLE(t1083)
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-12 TRUE 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: E (F ((FIREABLE(t891) AND FIREABLE(t67))))
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 ((FIREABLE(t891) AND FIREABLE(t67))))
lola: processed formula length: 42
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: (FIREABLE(t891) AND FIREABLE(t67))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t303) AND (FIREABLE(t463) OR FIREABLE(t387)))))
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 ((FIREABLE(t303) AND (FIREABLE(t463) OR FIREABLE(t387)))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: (FIREABLE(t303) AND (FIREABLE(t463) OR FIREABLE(t387)))
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-6-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: 16 markings, 15 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t795) AND FIREABLE(t45) AND FIREABLE(t1143))))
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 ((FIREABLE(t795) AND FIREABLE(t45) AND FIREABLE(t1143))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: (FIREABLE(t795) AND FIREABLE(t45) AND FIREABLE(t1143))
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-7a-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1016) AND NOT FIREABLE(t1081) AND FIREABLE(t798))))
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 ((FIREABLE(t1016) AND NOT FIREABLE(t1081) AND FIREABLE(t798))))
lola: processed formula length: 68
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: (FIREABLE(t1016) AND NOT FIREABLE(t1081) AND FIREABLE(t798))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-8-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: 10 markings, 9 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t732) AND NOT FIREABLE(t740) AND (NOT FIREABLE(t558) OR NOT FIREABLE(t664)) AND FIREABLE(t770) AND FIREABLE(t227))))
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(t732) AND NOT FIREABLE(t740) AND (NOT FIREABLE(t558) OR NOT FIREABLE(t664)) AND FIREABLE(t770) AND FIREABLE(t227))))
lola: processed formula length: 137
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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(t732) AND NOT FIREABLE(t740) AND (NOT FIREABLE(t558) OR NOT FIREABLE(t664)) AND FIREABLE(t770) AND FIREABLE(t227))
lola: state equation: Generated DNF with 240 literals and 40 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-7a-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t207) AND FIREABLE(t538) AND NOT FIREABLE(t402)) OR (NOT FIREABLE(t130) AND FIREABLE(t261)) OR FIREABLE(t63))))
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 (((FIREABLE(t207) AND FIREABLE(t538) AND NOT FIREABLE(t402)) OR (NOT FIREABLE(t130) AND FIREABLE(t261)) OR FIREABLE(t63))))
lola: processed formula length: 130
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: ((FIREABLE(t207) AND FIREABLE(t538) AND NOT FIREABLE(t402)) OR (NOT FIREABLE(t130) AND FIREABLE(t261)) OR FIREABLE(t63))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-7a-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-8 TRUE 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 ((FIREABLE(t530) AND (FIREABLE(t863) OR FIREABLE(t953)) AND ((FIREABLE(t1031) AND FIREABLE(t863)) OR NOT FIREABLE(t727)) AND NOT FIREABLE(t406))))
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 ((FIREABLE(t530) AND (FIREABLE(t863) OR FIREABLE(t953)) AND ((FIREABLE(t1031) AND FIREABLE(t863)) OR NOT FIREABLE(t727)) AND NOT FIREABLE(t406))))
lola: processed formula length: 153
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: (FIREABLE(t530) AND (FIREABLE(t863) OR FIREABLE(t953)) AND ((FIREABLE(t1031) AND FIREABLE(t863)) OR NOT FIREABLE(t727)) AND NOT FIREABLE(t406))
lola: state equation: Generated DNF with 102 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-11-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: 19 markings, 18 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-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: E (F (((FIREABLE(t1004) AND FIREABLE(t1081)) OR FIREABLE(t229) OR (FIREABLE(t970) AND FIREABLE(t1138)) OR FIREABLE(t654) OR FIREABLE(t308))))
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 (((FIREABLE(t1004) AND FIREABLE(t1081)) OR FIREABLE(t229) OR (FIREABLE(t970) AND FIREABLE(t1138)) OR FIREABLE(t654) OR FIREABLE(t308))))
lola: processed formula length: 145
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: ((FIREABLE(t1004) AND FIREABLE(t1081)) OR FIREABLE(t229) OR (FIREABLE(t970) AND FIREABLE(t1138)) OR FIREABLE(t654) OR FIREABLE(t308))
lola: state equation: Generated DNF with 23 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-7a-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1167) OR FIREABLE(t543) OR FIREABLE(t772) OR FIREABLE(t455) OR FIREABLE(t174) OR FIREABLE(t251) OR FIREABLE(t928) OR NOT FIREABLE(t745))))
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(t1167) OR FIREABLE(t543) OR FIREABLE(t772) OR FIREABLE(t455) OR FIREABLE(t174) OR FIREABLE(t251) OR FIREABLE(t928) OR NOT FIREABLE(t745))))
lola: processed formula length: 162
lola: 2 rewrites
lola: closed formula file CloudDeployment-PT-7a-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(t1167) AND NOT FIREABLE(t543) AND NOT FIREABLE(t772) AND NOT FIREABLE(t455) AND NOT FIREABLE(t174) AND NOT FIREABLE(t251) AND NOT FIREABLE(t928) AND FIREABLE(t745))
lola: state equation: Generated DNF with 2160 literals and 240 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-7a-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 11768 markings, 1775089 edges, 2354 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t580) AND NOT FIREABLE(t149) AND (NOT FIREABLE(t496) OR NOT FIREABLE(t960))) OR ((NOT FIREABLE(t216) OR NOT FIREABLE(t766)) AND (NOT FIREABLE(t622) OR NOT FIREABLE(t710))))))
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(t580) AND NOT FIREABLE(t149) AND (NOT FIREABLE(t496) OR NOT FIREABLE(t960))) OR ((NOT FIREABLE(t216) OR NOT FIREABLE(t766)) AND (NOT FIREABLE(t622) OR NOT FIREABLE(t710))))))
lola: processed formula length: 199
lola: 2 rewrites
lola: closed formula file CloudDeployment-PT-7a-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(t580) OR FIREABLE(t149) OR (FIREABLE(t496) AND FIREABLE(t960))) AND ((FIREABLE(t216) AND FIREABLE(t766)) OR (FIREABLE(t622) AND FIREABLE(t710))))
lola: state equation: Generated DNF with 63 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-7a-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t835) AND (FIREABLE(t34) OR FIREABLE(t769)) AND FIREABLE(t493) AND FIREABLE(t878) AND (FIREABLE(t391) OR FIREABLE(t791) OR FIREABLE(t308)))))
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 ((FIREABLE(t835) AND (FIREABLE(t34) OR FIREABLE(t769)) AND FIREABLE(t493) AND FIREABLE(t878) AND (FIREABLE(t391) OR FIREABLE(t791) OR FIREABLE(t308)))))
lola: processed formula length: 160
lola: 1 rewrites
lola: closed formula file CloudDeployment-PT-7a-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: (FIREABLE(t835) AND (FIREABLE(t34) OR FIREABLE(t769)) AND FIREABLE(t493) AND FIREABLE(t878) AND (FIREABLE(t391) OR FIREABLE(t791) OR FIREABLE(t308)))
lola: state equation: Generated DNF with 87 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-7a-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA CloudDeployment-PT-7a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no yes yes yes no no yes yes yes yes
lola:
preliminary result: yes yes no yes yes yes no yes yes yes no no yes yes yes yes
lola: memory consumption: 16688 KB
lola: time consumption: 8 seconds

BK_STOP 1526633748409

--------------------
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="CloudDeployment-PT-7a"
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/CloudDeployment-PT-7a.tgz
mv CloudDeployment-PT-7a 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 CloudDeployment-PT-7a, 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 r040-smll-152646357400266"
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 ;