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 192K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 18K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0003, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900231
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526807167839

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0003 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0003 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ JoinFreeModules-PT-0003 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 41/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 25 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0003-ReachabilityFireability.task
lola: E (F (((FIREABLE(t13) AND FIREABLE(t24) AND FIREABLE(t5) AND FIREABLE(t12)) OR (FIREABLE(t12) AND FIREABLE(t14) AND (FIREABLE(t) OR FIREABLE(t15)) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t18)))))) : E (F ((NOT FIREABLE(t7) AND NOT FIREABLE(t3) AND FIREABLE(t1) AND NOT FIREABLE(t23)))) : E (F (((FIREABLE(t21) AND FIREABLE(t3) AND FIREABLE(t11) AND FIREABLE(t8) AND (NOT FIREABLE(t21) OR FIREABLE(t23))) OR (FIREABLE(t9) AND (NOT FIREABLE(t12) OR FIREABLE(t15)))))) : E (F ((FIREABLE(t17) AND FIREABLE(t20) AND (FIREABLE(t2) OR (FIREABLE(t1) AND FIREABLE(t15)) OR NOT FIREABLE(t20) OR (FIREABLE(t1) AND FIREABLE(t3)))))) : A (G ((FIREABLE(t24) OR FIREABLE(t4) OR NOT FIREABLE(t13) OR (NOT FIREABLE(t9) AND (FIREABLE(t14) OR FIREABLE(t13))) OR NOT FIREABLE(t22) OR FIREABLE(t10)))) : A (G ((FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t13) OR FIREABLE(t) OR NOT FIREABLE(t1) OR NOT FIREABLE(t19) OR FIREABLE(t15)))) : A (G (())) : E (F ((FIREABLE(t) AND FIREABLE(t19)))) : E (F ((FIREABLE(t9) AND FIREABLE(t1) AND NOT FIREABLE(t17)))) : E (F ((FIREABLE(t17) AND FIREABLE(t14)))) : A (G (((NOT FIREABLE(t19) AND NOT FIREABLE(t16)) OR FIREABLE(t4) OR NOT FIREABLE(t10) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t24))))) : E (F ((((FIREABLE(t2) OR (FIREABLE(t5) AND FIREABLE(t21))) AND FIREABLE(t1)) OR (FIREABLE(t17) AND (FIREABLE(t23) OR FIREABLE(t11)) AND (FIREABLE(t5) OR FIREABLE(t3) OR FIREABLE(t11)))))) : E (F ((FIREABLE(t17) AND FIREABLE(t9) AND ((FIREABLE(t11) AND FIREABLE(t20)) OR FIREABLE(t6) OR FIREABLE(t7))))) : E (F ((FIREABLE(t7) AND FIREABLE(t17) AND FIREABLE(t) AND NOT FIREABLE(t19)))) : E (F ((FIREABLE(t11) AND FIREABLE(t) AND FIREABLE(t16)))) : E (F ((FIREABLE(t2) AND (NOT FIREABLE(t2) OR NOT FIREABLE(t18)) AND ((NOT FIREABLE(t4) AND FIREABLE(t)) OR (FIREABLE(t23) AND FIREABLE(t14) AND (FIREABLE(t5) OR FIREABLE(t1)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file JoinFreeModules-PT-0003-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t) AND FIREABLE(t19))))
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(t) AND FIREABLE(t19))))
lola: processed formula length: 39
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t) AND FIREABLE(t19))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 460 markings, 956 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t17) AND FIREABLE(t14))))
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(t17) AND FIREABLE(t14))))
lola: processed formula length: 41
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t17) AND FIREABLE(t14))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola:
FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-9 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(t9) AND FIREABLE(t1) AND NOT FIREABLE(t17))))
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(t9) AND FIREABLE(t1) AND NOT FIREABLE(t17))))
lola: processed formula length: 61
lola: 4 rewrites
lola: sara: try reading problem file JoinFreeModules-PT-0003-ReachabilityFireability-2-0.sara.
closed formula file JoinFreeModules-PT-0003-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(t9) AND FIREABLE(t1) AND NOT FIREABLE(t17))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-3-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11) AND FIREABLE(t) AND FIREABLE(t16))))
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(t11) AND FIREABLE(t) AND FIREABLE(t16))))
lola: processed formula length: 57
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t11) AND FIREABLE(t) AND FIREABLE(t16))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0003-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 460 markings, 956 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-14 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: E (F ((FIREABLE(t7) AND FIREABLE(t17) AND FIREABLE(t) AND NOT FIREABLE(t19))))
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(t7) AND FIREABLE(t17) AND FIREABLE(t) AND NOT FIREABLE(t19))))
lola: processed formula length: 78
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t7) AND FIREABLE(t17) AND FIREABLE(t) AND NOT FIREABLE(t19))
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 628 markings, 1268 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-13 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: E (F ((NOT FIREABLE(t7) AND NOT FIREABLE(t3) AND FIREABLE(t1) AND NOT FIREABLE(t23))))
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(t7) AND NOT FIREABLE(t3) AND FIREABLE(t1) AND NOT FIREABLE(t23))))
lola: processed formula length: 86
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola:
FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-1 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: A (G (((NOT FIREABLE(t19) AND NOT FIREABLE(t16)) OR FIREABLE(t4) OR NOT FIREABLE(t10) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t24)))))
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(t19) AND NOT FIREABLE(t16)) OR FIREABLE(t4) OR NOT FIREABLE(t10) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t24)))))
lola: processed formula length: 135
lola: 5 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t19) OR FIREABLE(t16)) AND NOT FIREABLE(t4) AND FIREABLE(t10) AND (FIREABLE(t4) OR FIREABLE(t24)))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 92 markings, 105 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-10 FALSE 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: E (F ((FIREABLE(t17) AND FIREABLE(t20) AND (FIREABLE(t2) OR (FIREABLE(t1) AND FIREABLE(t15)) OR NOT FIREABLE(t20) OR (FIREABLE(t1) AND FIREABLE(t3))))))
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(t17) AND FIREABLE(t20) AND (FIREABLE(t2) OR (FIREABLE(t1) AND FIREABLE(t15)) OR NOT FIREABLE(t20) OR (FIREABLE(t1) AND FIREABLE(t3))))))
lola: processed formula length: 155
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t17) AND FIREABLE(t20) AND (FIREABLE(t2) OR (FIREABLE(t1) AND FIREABLE(t15)) OR NOT FIREABLE(t20) OR (FIREABLE(t1) AND FIREABLE(t3))))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0003-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 20141 markings, 51636 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-3 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 ((FIREABLE(t17) AND FIREABLE(t9) AND ((FIREABLE(t11) AND FIREABLE(t20)) OR FIREABLE(t6) OR FIREABLE(t7)))))
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(t17) AND FIREABLE(t9) AND ((FIREABLE(t11) AND FIREABLE(t20)) OR FIREABLE(t6) OR FIREABLE(t7)))))
lola: processed formula length: 114
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t17) AND FIREABLE(t9) AND ((FIREABLE(t11) AND FIREABLE(t20)) OR FIREABLE(t6) OR FIREABLE(t7)))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 97 markings, 120 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-12 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(t24) OR FIREABLE(t4) OR NOT FIREABLE(t13) OR (NOT FIREABLE(t9) AND (FIREABLE(t14) OR FIREABLE(t13))) OR NOT FIREABLE(t22) OR FIREABLE(t10))))
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(t24) OR FIREABLE(t4) OR NOT FIREABLE(t13) OR (NOT FIREABLE(t9) AND (FIREABLE(t14) OR FIREABLE(t13))) OR NOT FIREABLE(t22) OR FIREABLE(t10))))
lola: processed formula length: 163
lola: 5 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t24) AND NOT FIREABLE(t4) AND FIREABLE(t13) AND (FIREABLE(t9) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t13))) AND FIREABLE(t22) AND NOT FIREABLE(t10))
lola: state equation: Generated DNF with 13 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0003-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 9412 markings, 20833 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-4 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: A (G ((FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t13) OR FIREABLE(t) OR NOT FIREABLE(t1) OR NOT FIREABLE(t19) OR FIREABLE(t15))))
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(t3) OR FIREABLE(t4) OR FIREABLE(t13) OR FIREABLE(t) OR NOT FIREABLE(t1) OR NOT FIREABLE(t19) OR FIREABLE(t15))))
lola: processed formula length: 134
lola: 5 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t3) AND NOT FIREABLE(t4) AND NOT FIREABLE(t13) AND NOT FIREABLE(t) AND FIREABLE(t1) AND FIREABLE(t19) AND NOT FIREABLE(t15))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 11 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t2) OR (FIREABLE(t5) AND FIREABLE(t21))) AND FIREABLE(t1)) OR (FIREABLE(t17) AND (FIREABLE(t23) OR FIREABLE(t11)) AND (FIREABLE(t5) OR FIREABLE(t3) OR FIREABLE(t11))))))
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(t2) OR (FIREABLE(t5) AND FIREABLE(t21))) AND FIREABLE(t1)) OR (FIREABLE(t17) AND (FIREABLE(t23) OR FIREABLE(t11)) AND (FIREABLE(t5) OR FIREABLE(t3) OR FIREABLE(t11))))))
lola: processed formula length: 192
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t2) OR (FIREABLE(t5) AND FIREABLE(t21))) AND FIREABLE(t1)) OR (FIREABLE(t17) AND (FIREABLE(t23) OR FIREABLE(t11)) AND (FIREABLE(t5) OR FIREABLE(t3) OR FIREABLE(t11))))
lola: state equation: Generated DNF with 23 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges

lola: FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-11 TRUE 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: E (F (((FIREABLE(t21) AND FIREABLE(t3) AND FIREABLE(t11) AND FIREABLE(t8) AND (NOT FIREABLE(t21) OR FIREABLE(t23))) OR (FIREABLE(t9) AND (NOT FIREABLE(t12) OR FIREABLE(t15))))))
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(t21) AND FIREABLE(t3) AND FIREABLE(t11) AND FIREABLE(t8) AND (NOT FIREABLE(t21) OR FIREABLE(t23))) OR (FIREABLE(t9) AND (NOT FIREABLE(t12) OR FIREABLE(t15))))))
lola: processed formula length: 180
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t21) AND FIREABLE(t3) AND FIREABLE(t11) AND FIREABLE(t8) AND (NOT FIREABLE(t21) OR FIREABLE(t23))) OR (FIREABLE(t9) AND (NOT FIREABLE(t12) OR FIREABLE(t15))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-13-0.sara

lola: FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2) AND (NOT FIREABLE(t2) OR NOT FIREABLE(t18)) AND ((NOT FIREABLE(t4) AND FIREABLE(t)) OR (FIREABLE(t23) AND FIREABLE(t14) AND (FIREABLE(t5) OR FIREABLE(t1)))))))
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(t2) AND (NOT FIREABLE(t2) OR NOT FIREABLE(t18)) AND ((NOT FIREABLE(t4) AND FIREABLE(t)) OR (FIREABLE(t23) AND FIREABLE(t14) AND (FIREABLE(t5) OR FIREABLE(t1)))))))
lola: processed formula length: 182
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t2) AND (NOT FIREABLE(t2) OR NOT FIREABLE(t18)) AND ((NOT FIREABLE(t4) AND FIREABLE(t)) OR (FIREABLE(t23) AND FIREABLE(t14) AND (FIREABLE(t5) OR FIREABLE(t1)))))
lola: state equation: Generated DNF with 17 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-14-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 110 markings, 131 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-15 TRUE 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 (((FIREABLE(t13) AND FIREABLE(t24) AND FIREABLE(t5) AND FIREABLE(t12)) OR (FIREABLE(t12) AND FIREABLE(t14) AND (FIREABLE(t) OR FIREABLE(t15)) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t18))))))
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(t13) AND FIREABLE(t24) AND FIREABLE(t5) AND FIREABLE(t12)) OR (FIREABLE(t12) AND FIREABLE(t14) AND (FIREABLE(t) OR FIREABLE(t15)) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t18))))))
lola: processed formula length: 198
lola: 4 rewrites
lola: closed formula file JoinFreeModules-PT-0003-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(t13) AND FIREABLE(t24) AND FIREABLE(t5) AND FIREABLE(t12)) OR (FIREABLE(t12) AND FIREABLE(t14) AND (FIREABLE(t) OR FIREABLE(t15)) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t18))))
lola: state equation: Generated DNF with 26 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0003-ReachabilityFireability-15-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: 905 markings, 1326 edges
lola:
========================================FORMULA JoinFreeModules-PT-0003-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes no yes yes no yes yes no no yes
lola:
preliminary result: yes yes yes no yes no yes no yes yes no yes yes no no yes
lola: memory consumption: 14640 KB
lola: time consumption: 0 seconds


BK_TIME_CONFINEMENT_REACHED

--------------------
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="JoinFreeModules-PT-0003"
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/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 JoinFreeModules-PT-0003, 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 r100-smll-152658630900231"
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 ;