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 248K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 73K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CircularTrains-PT-096, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357100028
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526478906652

info: Time: 3600 - MCC
===========================================================================================
prep: translating CircularTrains-PT-096 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CircularTrains-PT-096 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ CircularTrains-PT-096 @ 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: 288/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6144
lola: finding significant places
lola: 192 places, 96 transitions, 95 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 192 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-096-ReachabilityFireability.task
lola: E (F ((((NOT FIREABLE(t84_to_85) AND NOT FIREABLE(t91_to_92)) OR (NOT FIREABLE(t6_to_7) AND (FIREABLE(t26_to_27) OR FIREABLE(t30_to_31)))) AND FIREABLE(t17_to_18)))) : E (F (FIREABLE(t5_to_6))) : E (F (((FIREABLE(t65_to_66) AND FIREABLE(t19_to_20) AND (FIREABLE(t79_to_80) OR FIREABLE(t44_to_45)) AND FIREABLE(t64_to_65)) OR FIREABLE(t44_to_45)))) : E (F (FIREABLE(t29_to_30))) : E (F (())) : A (G ((NOT FIREABLE(t53_to_54) OR NOT FIREABLE(t23_to_24) OR (FIREABLE(t58_to_59) AND FIREABLE(t94_to_95) AND (FIREABLE(t12_to_13) OR FIREABLE(t52_to_53))) OR FIREABLE(t30_to_31) OR (NOT FIREABLE(t24_to_25) AND NOT FIREABLE(t58_to_59))))) : E (F ((NOT FIREABLE(t33_to_34) AND FIREABLE(t74_to_75)))) : A (G ((NOT FIREABLE(t59_to_60) OR NOT FIREABLE(t76_to_77) OR FIREABLE(t8_to_9) OR NOT FIREABLE(t47_to_48)))) : A (G ((FIREABLE(t66_to_67) OR FIREABLE(t3_to_4) OR FIREABLE(t14_to_15) OR FIREABLE(t10_to_11) OR NOT FIREABLE(t50_to_51) OR NOT FIREABLE(t48_to_49)))) : A (G ((NOT FIREABLE(t32_to_33) OR (FIREABLE(t33_to_34) AND FIREABLE(t19_to_20)) OR FIREABLE(t24_to_25) OR FIREABLE(t31_to_32)))) : A (G ((NOT FIREABLE(t80_to_81) OR (NOT FIREABLE(t90_to_91) AND NOT FIREABLE(t66_to_67) AND FIREABLE(t35_to_36))))) : E (F ((FIREABLE(t23_to_24) AND NOT FIREABLE(t53_to_54) AND FIREABLE(t78_to_79)))) : E (F ((FIREABLE(t64_to_65) AND FIREABLE(t59_to_60) AND FIREABLE(t40_to_41)))) : E (F ((NOT FIREABLE(t63_to_64) AND NOT FIREABLE(t93_to_94) AND (FIREABLE(t71_to_72) OR FIREABLE(t22_to_23) OR (FIREABLE(t64_to_65) AND FIREABLE(t76_to_77))) AND ((FIREABLE(t31_to_32) AND FIREABLE(t38_to_39) AND (FIREABLE(t61_to_62) OR FIREABLE(t19_to_20))) OR FIREABLE(t7_to_8))))) : E (F ((NOT FIREABLE(t85_to_86) AND FIREABLE(t41_to_42) AND ((NOT FIREABLE(t35_to_36) AND NOT FIREABLE(t17_to_18)) OR FIREABLE(t70_to_71))))) : E (F ((FIREABLE(t52_to_53) AND FIREABLE(t22_to_23) AND FIREABLE(t7_to_8) AND (NOT FIREABLE(t28_to_29) OR NOT FIREABLE(t29_to_30)) AND FIREABLE(t28_to_29))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file CircularTrains-PT-096-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t29_to_30)))
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(t29_to_30)))
lola: processed formula length: 27
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t29_to_30)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-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: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-3 TRUE 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(t5_to_6)))
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(t5_to_6)))
lola: processed formula length: 25
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t5_to_6)
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: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-1 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 ((NOT FIREABLE(t33_to_34) AND FIREABLE(t74_to_75))))
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(t33_to_34) AND FIREABLE(t74_to_75))))
lola: processed formula length: 57
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t33_to_34) AND FIREABLE(t74_to_75))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-6 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(t23_to_24) AND NOT FIREABLE(t53_to_54) AND FIREABLE(t78_to_79))))
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(t23_to_24) AND NOT FIREABLE(t53_to_54) AND FIREABLE(t78_to_79))))
lola: processed formula length: 81
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t23_to_24) AND NOT FIREABLE(t53_to_54) AND FIREABLE(t78_to_79))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola:
FORMULA CircularTrains-PT-096-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t64_to_65) AND FIREABLE(t59_to_60) AND FIREABLE(t40_to_41))))
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(t64_to_65) AND FIREABLE(t59_to_60) AND FIREABLE(t40_to_41))))
lola: processed formula length: 77
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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: sara: try reading problem file CircularTrains-PT-096-ReachabilityFireability-4-0.sara.
state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: formula 0: (FIREABLE(t64_to_65) AND FIREABLE(t59_to_60) AND FIREABLE(t40_to_41))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-5-0.sara

FORMULA CircularTrains-PT-096-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t59_to_60) OR NOT FIREABLE(t76_to_77) OR FIREABLE(t8_to_9) OR NOT FIREABLE(t47_to_48))))
lola: ========================================
lola: SUBTASK
lola: sara: place or transition ordering is non-deterministic
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(t59_to_60) OR NOT FIREABLE(t76_to_77) OR FIREABLE(t8_to_9) OR NOT FIREABLE(t47_to_48))))
lola: processed formula length: 111
lola: 5 rewrites
lola: closed formula file CircularTrains-PT-096-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(t59_to_60) AND FIREABLE(t76_to_77) AND NOT FIREABLE(t8_to_9) AND FIREABLE(t47_to_48))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-7 FALSE 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(t80_to_81) OR (NOT FIREABLE(t90_to_91) AND NOT FIREABLE(t66_to_67) AND FIREABLE(t35_to_36)))))
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(t80_to_81) OR (NOT FIREABLE(t90_to_91) AND NOT FIREABLE(t66_to_67) AND FIREABLE(t35_to_36)))))
lola: processed formula length: 115
lola: 5 rewrites
lola: closed formula file CircularTrains-PT-096-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(t80_to_81) AND (FIREABLE(t90_to_91) OR FIREABLE(t66_to_67) OR NOT FIREABLE(t35_to_36)))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-7-0.sara
sara: try reading problem file CircularTrains-PT-096-ReachabilityFireability-6-0.sara.

lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-096-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: A (G ((NOT FIREABLE(t32_to_33) OR (FIREABLE(t33_to_34) AND FIREABLE(t19_to_20)) OR FIREABLE(t24_to_25) OR FIREABLE(t31_to_32))))
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(t32_to_33) OR (FIREABLE(t33_to_34) AND FIREABLE(t19_to_20)) OR FIREABLE(t24_to_25) OR FIREABLE(t31_to_32))))
lola: processed formula length: 131
lola: 5 rewrites
lola: closed formula file CircularTrains-PT-096-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(t32_to_33) AND (NOT FIREABLE(t33_to_34) OR NOT FIREABLE(t19_to_20)) AND NOT FIREABLE(t24_to_25) AND NOT FIREABLE(t31_to_32))
lola: state equation: Generated DNF with 80 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-9 FALSE 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 (((FIREABLE(t65_to_66) AND FIREABLE(t19_to_20) AND (FIREABLE(t79_to_80) OR FIREABLE(t44_to_45)) AND FIREABLE(t64_to_65)) OR FIREABLE(t44_to_45))))
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(t65_to_66) AND FIREABLE(t19_to_20) AND (FIREABLE(t79_to_80) OR FIREABLE(t44_to_45)) AND FIREABLE(t64_to_65)) OR FIREABLE(t44_to_45))))
lola: processed formula length: 153
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t65_to_66) AND FIREABLE(t19_to_20) AND (FIREABLE(t79_to_80) OR FIREABLE(t44_to_45)) AND FIREABLE(t64_to_65)) OR FIREABLE(t44_to_45))
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t85_to_86) AND FIREABLE(t41_to_42) AND ((NOT FIREABLE(t35_to_36) AND NOT FIREABLE(t17_to_18)) OR FIREABLE(t70_to_71)))))
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(t85_to_86) AND FIREABLE(t41_to_42) AND ((NOT FIREABLE(t35_to_36) AND NOT FIREABLE(t17_to_18)) OR FIREABLE(t70_to_71)))))
lola: processed formula length: 141
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t85_to_86) AND FIREABLE(t41_to_42) AND ((NOT FIREABLE(t35_to_36) AND NOT FIREABLE(t17_to_18)) OR FIREABLE(t70_to_71)))
lola: state equation: Generated DNF with 50 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-10-0.sara
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t52_to_53) AND FIREABLE(t22_to_23) AND FIREABLE(t7_to_8) AND (NOT FIREABLE(t28_to_29) OR NOT FIREABLE(t29_to_30)) AND FIREABLE(t28_to_29))))
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(t52_to_53) AND FIREABLE(t22_to_23) AND FIREABLE(t7_to_8) AND (NOT FIREABLE(t28_to_29) OR NOT FIREABLE(t29_to_30)) AND FIREABLE(t28_to_29))))
lola: processed formula length: 157
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t52_to_53) AND FIREABLE(t22_to_23) AND FIREABLE(t7_to_8) AND (NOT FIREABLE(t28_to_29) OR NOT FIREABLE(t29_to_30)) AND FIREABLE(t28_to_29))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-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: 5 markings, 4 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-15 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 ((((NOT FIREABLE(t84_to_85) AND NOT FIREABLE(t91_to_92)) OR (NOT FIREABLE(t6_to_7) AND (FIREABLE(t26_to_27) OR FIREABLE(t30_to_31)))) AND FIREABLE(t17_to_18))))
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(t84_to_85) AND NOT FIREABLE(t91_to_92)) OR (NOT FIREABLE(t6_to_7) AND (FIREABLE(t26_to_27) OR FIREABLE(t30_to_31)))) AND FIREABLE(t17_to_18))))
lola: processed formula length: 167
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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)
sara: place or transition ordering is non-deterministic
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: formula 0: (((NOT FIREABLE(t84_to_85) AND NOT FIREABLE(t91_to_92)) OR (NOT FIREABLE(t6_to_7) AND (FIREABLE(t26_to_27) OR FIREABLE(t30_to_31)))) AND FIREABLE(t17_to_18))
lola: state equation: Generated DNF with 36 literals and 8 conjunctive subformulas
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t66_to_67) OR FIREABLE(t3_to_4) OR FIREABLE(t14_to_15) OR FIREABLE(t10_to_11) OR NOT FIREABLE(t50_to_51) OR NOT FIREABLE(t48_to_49))))
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(t66_to_67) OR FIREABLE(t3_to_4) OR FIREABLE(t14_to_15) OR FIREABLE(t10_to_11) OR NOT FIREABLE(t50_to_51) OR NOT FIREABLE(t48_to_49))))
lola: processed formula length: 155
lola: 5 rewrites
lola: closed formula file CircularTrains-PT-096-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(t66_to_67) AND NOT FIREABLE(t3_to_4) AND NOT FIREABLE(t14_to_15) AND NOT FIREABLE(t10_to_11) AND FIREABLE(t50_to_51) AND FIREABLE(t48_to_49))
lola: state equation: Generated DNF with 128 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 801 markings, 801 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t53_to_54) OR NOT FIREABLE(t23_to_24) OR (FIREABLE(t58_to_59) AND FIREABLE(t94_to_95) AND (FIREABLE(t12_to_13) OR FIREABLE(t52_to_53))) OR FIREABLE(t30_to_31) OR (NOT FIREABLE(t24_to_25) AND NOT FIREABLE(t58_to_59)))))
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(t53_to_54) OR NOT FIREABLE(t23_to_24) OR (FIREABLE(t58_to_59) AND FIREABLE(t94_to_95) AND (FIREABLE(t12_to_13) OR FIREABLE(t52_to_53))) OR FIREABLE(t30_to_31) OR (NOT FIREABLE(t24_to_25) AND NOT FIREABLE(t58_to_59)))))
lola: processed formula length: 243
lola: 5 rewrites
lola: closed formula file CircularTrains-PT-096-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(t53_to_54) AND FIREABLE(t23_to_24) AND (NOT FIREABLE(t58_to_59) OR NOT FIREABLE(t94_to_95) OR (NOT FIREABLE(t12_to_13) AND NOT FIREABLE(t52_to_53))) AND NOT FIREABLE(t30_to_31) AND (FIREABLE(t24_to_25) OR FIREABLE(t58_to_59)))
lola: state equation: Generated DNF with 240 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t63_to_64) AND NOT FIREABLE(t93_to_94) AND (FIREABLE(t71_to_72) OR FIREABLE(t22_to_23) OR (FIREABLE(t64_to_65) AND FIREABLE(t76_to_77))) AND ((FIREABLE(t31_to_32) AND FIREABLE(t38_to_39) AND (FIREABLE(t61_to_62) OR FIREABLE(t19_to_20))) OR FIREABLE(t7_to_8)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t63_to_64) AND NOT FIREABLE(t93_to_94) AND (FIREABLE(t71_to_72) OR FIREABLE(t22_to_23) OR (FIREABLE(t64_to_65) AND FIREABLE(t76_to_77))) AND ((FIREABLE(t31_to_32) AND FIREABLE(t38_to_39) AND (FIREABLE(t61_to_62) OR FIREABLE(t19_to_20))) OR FIREABLE(t7_to_8)))))
lola: processed formula length: 285
lola: 4 rewrites
lola: closed formula file CircularTrains-PT-096-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(t63_to_64) AND NOT FIREABLE(t93_to_94) AND (FIREABLE(t71_to_72) OR FIREABLE(t22_to_23) OR (FIREABLE(t64_to_65) AND FIREABLE(t76_to_77))) AND ((FIREABLE(t31_to_32) AND FIREABLE(t38_to_39) AND (FIREABLE(t61_to_62) OR FIREABLE(t19_to_20))) OR FIREABLE(t7_to_8)))
lola: state equation: Generated DNF with 336 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-096-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA CircularTrains-PT-096-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no yes no yes no no yes yes yes yes yes
lola:
preliminary result: yes yes yes yes no no yes no yes no no yes yes yes yes yes

lola: memory consumption: 14856 KB
lola: time consumption: 0 seconds

BK_STOP 1526478906916

--------------------
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="CircularTrains-PT-096"
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/CircularTrains-PT-096.tgz
mv CircularTrains-PT-096 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 CircularTrains-PT-096, 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-152646357100028"
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 ;