About the Execution of LoLA for Dekker-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1050.020 | 142227.00 | 281886.00 | 67.30 | TTTTTTTTFTTTTTFF | normal |
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 25M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Dekker-PT-200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936800112
=====================================================================
--------------------
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 Dekker-PT-200-ReachabilityFireability-00
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-01
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-02
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-03
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-04
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-05
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-06
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-07
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-08
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-09
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-10
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-11
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-12
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-13
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-14
FORMULA_NAME Dekker-PT-200-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526630450166
info: Time: 3600 - MCC
===========================================================================================
prep: translating Dekker-PT-200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Dekker-PT-200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Dekker-PT-200 @ 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: 41400/65536 symbol table entries, 18535 collisions
lola: preprocessing...
lola: Size of bit vector: 1000
lola: finding significant places
lola: 1000 places, 40400 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80600 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-200-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(withdraw_158_156) AND NOT FIREABLE(withdraw_190_66) AND FIREABLE(withdraw_20_62) AND FIREABLE(withdraw_18_68)))) : E (F ((FIREABLE(withdraw_7_27) OR (FIREABLE(withdraw_74_164) AND FIREABLE(withdraw_60_197) AND FIREABLE(withdraw_25_87) AND (FIREABLE(withdraw_100_9) OR FIREABLE(withdraw_137_16)) AND FIREABLE(withdraw_15_115))))) : E (F (FIREABLE(withdraw_27_155))) : A (G ((NOT FIREABLE(enter_126) OR (NOT FIREABLE(withdraw_3_54) AND NOT FIREABLE(withdraw_54_89)) OR FIREABLE(withdraw_59_74)))) : E (F (FIREABLE(withdraw_162_57))) : E (F ((FIREABLE(withdraw_126_53) AND FIREABLE(withdraw_11_55)))) : E (F (FIREABLE(withdraw_14_57))) : E (F ((FIREABLE(withdraw_112_53) OR (FIREABLE(withdraw_8_95) AND FIREABLE(withdraw_33_51) AND (FIREABLE(withdraw_78_63) OR FIREABLE(withdraw_174_31))) OR FIREABLE(withdraw_90_182)))) : A (G ((NOT FIREABLE(withdraw_50_81) AND NOT FIREABLE(withdraw_176_175)))) : E (F (FIREABLE(withdraw_10_73))) : E (F (FIREABLE(withdraw_188_139))) : E (F (FIREABLE(withdraw_134_46))) : E (F (((FIREABLE(withdraw_126_89) OR FIREABLE(withdraw_149_28)) AND NOT FIREABLE(withdraw_126_125) AND NOT FIREABLE(withdraw_65_194) AND NOT FIREABLE(withdraw_75_130) AND (((FIREABLE(withdraw_101_158) OR FIREABLE(withdraw_175_35)) AND (FIREABLE(withdraw_15_73) OR FIREABLE(withdraw_62_109))) OR FIREABLE(withdraw_45_158))))) : E (F (FIREABLE(withdraw_73_94))) : A (G (((NOT FIREABLE(withdraw_56_123) AND NOT FIREABLE(withdraw_4_88) AND (NOT FIREABLE(withdraw_166_76) OR NOT FIREABLE(withdraw_65_127))) OR NOT FIREABLE(withdraw_144_26)))) : A (G ((NOT FIREABLE(withdraw_96_13) OR NOT FIREABLE(withdraw_13_165) OR FIREABLE(withdraw_137_83) OR FIREABLE(withdraw_23_108))))
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(withdraw_27_155)))
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(withdraw_27_155)))
lola: processed formula length: 33
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_27_155)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-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: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-2 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(withdraw_162_57)))
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(withdraw_162_57)))
lola: processed formula length: 33
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_162_57)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-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: 3 markings, 2 edges
FORMULA Dekker-PT-200-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(withdraw_14_57)))
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(withdraw_14_57)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_14_57)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-2-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: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-6 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(withdraw_10_73)))
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(withdraw_10_73)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_10_73)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-3-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: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-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(withdraw_188_139)))
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(withdraw_188_139)))
lola: processed formula length: 34
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_188_139)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-10 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(withdraw_134_46)))
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(withdraw_134_46)))
lola: processed formula length: 33
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_134_46)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-5-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: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-11 TRUE 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 (FIREABLE(withdraw_73_94)))
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(withdraw_73_94)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(withdraw_73_94)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-13 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(withdraw_126_53) AND FIREABLE(withdraw_11_55))))
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(withdraw_126_53) AND FIREABLE(withdraw_11_55))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(withdraw_126_53) AND FIREABLE(withdraw_11_55))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
FORMULA Dekker-PT-200-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_50_81) AND NOT FIREABLE(withdraw_176_175))))
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(withdraw_50_81) AND NOT FIREABLE(withdraw_176_175))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(withdraw_50_81) OR FIREABLE(withdraw_176_175))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
FORMULA Dekker-PT-200-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(withdraw_158_156) AND NOT FIREABLE(withdraw_190_66) AND FIREABLE(withdraw_20_62) AND FIREABLE(withdraw_18_68))))
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(withdraw_158_156) AND NOT FIREABLE(withdraw_190_66) AND FIREABLE(withdraw_20_62) AND FIREABLE(withdraw_18_68))))
lola: processed formula length: 132
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(withdraw_158_156) AND NOT FIREABLE(withdraw_190_66) AND FIREABLE(withdraw_20_62) AND FIREABLE(withdraw_18_68))
lola: state equation: Generated DNF with 72 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
FORMULA Dekker-PT-200-ReachabilityFireability-0 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 ((NOT FIREABLE(enter_126) OR (NOT FIREABLE(withdraw_3_54) AND NOT FIREABLE(withdraw_54_89)) OR FIREABLE(withdraw_59_74))))
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(enter_126) OR (NOT FIREABLE(withdraw_3_54) AND NOT FIREABLE(withdraw_54_89)) OR FIREABLE(withdraw_59_74))))
lola: processed formula length: 129
lola: 2 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
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(enter_126) AND (FIREABLE(withdraw_3_54) OR FIREABLE(withdraw_54_89)) AND NOT FIREABLE(withdraw_59_74))
lola: state equation: Generated DNF with 1224 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-10-0.sara.
lola: sara is running 0 secs || 584 markings, 1826 edges, 117 markings/sec, 0 secs
lola: sara is running 5 secs || 1202 markings, 3839 edges, 124 markings/sec, 5 secs
lola: sara is running 10 secs || 1835 markings, 6171 edges, 127 markings/sec, 10 secs
lola: sara is running 15 secs || 2475 markings, 8485 edges, 128 markings/sec, 15 secs
lola: sara is running 20 secs || 3075 markings, 10765 edges, 120 markings/sec, 20 secs
lola: sara is running 25 secs || 3700 markings, 13398 edges, 125 markings/sec, 25 secs
lola: sara is running 30 secs || 4336 markings, 16540 edges, 127 markings/sec, 30 secs
lola: sara is running 35 secs || 4968 markings, 19054 edges, 126 markings/sec, 35 secs
lola: sara is running 40 secs || 5514 markings, 21035 edges, 109 markings/sec, 40 secs
lola: sara is running 45 secs || 6122 markings, 23554 edges, 122 markings/sec, 45 secs
lola: sara is running 50 secs || 6735 markings, 26390 edges, 123 markings/sec, 50 secs
lola: sara is running 55 secs || 7349 markings, 29224 edges, 123 markings/sec, 55 secs
lola: sara is running 60 secs || 7885 markings, 31132 edges, 107 markings/sec, 60 secs
lola: sara is running 65 secs || 8446 markings, 33564 edges, 112 markings/sec, 65 secs
lola: sara is running 70 secs || 9066 markings, 36351 edges, 124 markings/sec, 70 secs
lola: sara is running 75 secs || 9684 markings, 39210 edges, 124 markings/sec, 75 secs
lola: sara is running 80 secs || 10287 markings, 42044 edges, 121 markings/sec, 80 secs
lola: sara is running 85 secs || 10852 markings, 44820 edges, 113 markings/sec, 85 secs
lola: sara is running 90 secs || 11466 markings, 47553 edges, 123 markings/sec, 90 secs
lola: sara is running 95 secs || 12084 markings, 50381 edges, 124 markings/sec, 95 secs
lola: sara is running 100 secs || 12698 markings, 53026 edges, 123 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 105 secs || 13283 markings, 56224 edges, 117 markings/sec, 105 secs
lola: sara is running 110 secs || 13869 markings, 59334 edges, 117 markings/sec, 110 secs
lola: sara is running 115 secs || 14455 markings, 61478 edges, 117 markings/sec, 115 secs
lola: sara is running 120 secs || 15069 markings, 64209 edges, 123 markings/sec, 120 secs
lola: sara is running 125 secs || 15685 markings, 67356 edges, 123 markings/sec, 125 secs
lola: sara is running 130 secs || 16303 markings, 70393 edges, 124 markings/sec, 130 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(withdraw_96_13) OR NOT FIREABLE(withdraw_13_165) OR FIREABLE(withdraw_137_83) OR FIREABLE(withdraw_23_108))))
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(withdraw_96_13) OR NOT FIREABLE(withdraw_13_165) OR FIREABLE(withdraw_137_83) OR FIREABLE(withdraw_23_108))))
lola: processed formula length: 132
lola: 2 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(withdraw_96_13) AND FIREABLE(withdraw_13_165) AND NOT FIREABLE(withdraw_137_83) AND NOT FIREABLE(withdraw_23_108))
lola: state equation: Generated DNF with 72 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 857 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(withdraw_56_123) AND NOT FIREABLE(withdraw_4_88) AND (NOT FIREABLE(withdraw_166_76) OR NOT FIREABLE(withdraw_65_127))) OR NOT FIREABLE(withdraw_144_26))))
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(withdraw_56_123) AND NOT FIREABLE(withdraw_4_88) AND (NOT FIREABLE(withdraw_166_76) OR NOT FIREABLE(withdraw_65_127))) OR NOT FIREABLE(withdraw_144_26))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(withdraw_56_123) OR FIREABLE(withdraw_4_88) OR (FIREABLE(withdraw_166_76) AND FIREABLE(withdraw_65_127))) AND FIREABLE(withdraw_144_26))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_112_53) OR (FIREABLE(withdraw_8_95) AND FIREABLE(withdraw_33_51) AND (FIREABLE(withdraw_78_63) OR FIREABLE(withdraw_174_31))) OR FIREABLE(withdraw_90_182))))
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(withdraw_112_53) OR (FIREABLE(withdraw_8_95) AND FIREABLE(withdraw_33_51) AND (FIREABLE(withdraw_78_63) OR FIREABLE(withdraw_174_31))) OR FIREABLE(withdraw_90_182))))
lola: processed formula length: 185
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(withdraw_112_53) OR (FIREABLE(withdraw_8_95) AND FIREABLE(withdraw_33_51) AND (FIREABLE(withdraw_78_63) OR FIREABLE(withdraw_174_31))) OR FIREABLE(withdraw_90_182))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_7_27) OR (FIREABLE(withdraw_74_164) AND FIREABLE(withdraw_60_197) AND FIREABLE(withdraw_25_87) AND (FIREABLE(withdraw_100_9) OR FIREABLE(withdraw_137_16)) AND FIREABLE(withdraw_15_115)))))
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(withdraw_7_27) OR (FIREABLE(withdraw_74_164) AND FIREABLE(withdraw_60_197) AND FIREABLE(withdraw_25_87) AND (FIREABLE(withdraw_100_9) OR FIREABLE(withdraw_137_16)) AND FIREABLE(withdraw_15_115)))))
lola: processed formula length: 215
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(withdraw_7_27) OR (FIREABLE(withdraw_74_164) AND FIREABLE(withdraw_60_197) AND FIREABLE(withdraw_25_87) AND (FIREABLE(withdraw_100_9) OR FIREABLE(withdraw_137_16)) AND FIREABLE(withdraw_15_115)))
lola: state equation: Generated DNF with 33 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA Dekker-PT-200-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(withdraw_126_89) OR FIREABLE(withdraw_149_28)) AND NOT FIREABLE(withdraw_126_125) AND NOT FIREABLE(withdraw_65_194) AND NOT FIREABLE(withdraw_75_130) AND (((FIREABLE(withdraw_101_158) OR FIREABLE(withdraw_175_35)) AND (FIREABLE(withdraw_15_73) OR FIREABLE(withdraw_62_109))) OR FIREABLE(withdraw_45_158)))))
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(withdraw_126_89) OR FIREABLE(withdraw_149_28)) AND NOT FIREABLE(withdraw_126_125) AND NOT FIREABLE(withdraw_65_194) AND NOT FIREABLE(withdraw_75_130) AND (((FIREABLE(withdraw_101_158) OR FIREABLE(withdraw_175_35)) AND (FIREABLE(withdraw_15_73) OR FIREABLE(withdraw_62_109))) OR FIREABLE(withdraw_45_158)))))
lola: processed formula length: 328
lola: 1 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(withdraw_126_89) OR FIREABLE(withdraw_149_28)) AND NOT FIREABLE(withdraw_126_125) AND NOT FIREABLE(withdraw_65_194) AND NOT FIREABLE(withdraw_75_130) AND (((FIREABLE(withdraw_101_158) OR FIREABLE(withdraw_175_35)) AND (FIREABLE(withdraw_15_73) OR FIREABLE(withdraw_62_109))) OR FIREABLE(withdraw_45_158)))
lola: state equation: Generated DNF with 2052 literals and 180 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola:
FORMULA Dekker-PT-200-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes yes yes no yes yes yes yes yes no no
lola:
preliminary result: yes yes yes yes yes yes yes yes no yes yes yes yes yes no no
lola: memory consumption: 280580 KB
lola: time consumption: 141 seconds
BK_STOP 1526630592393
--------------------
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="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is Dekker-PT-200, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r076-blw3-152649936800112"
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 '
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 ;