About the Execution of LoLA for Dekker-PT-010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
146.510 | 818.00 | 220.00 | 2.50 | TFFTFTTTTFFFFTFF | 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 228K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K 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 63K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Dekker-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936800074
=====================================================================
--------------------
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-010-CTLFireability-00
FORMULA_NAME Dekker-PT-010-CTLFireability-01
FORMULA_NAME Dekker-PT-010-CTLFireability-02
FORMULA_NAME Dekker-PT-010-CTLFireability-03
FORMULA_NAME Dekker-PT-010-CTLFireability-04
FORMULA_NAME Dekker-PT-010-CTLFireability-05
FORMULA_NAME Dekker-PT-010-CTLFireability-06
FORMULA_NAME Dekker-PT-010-CTLFireability-07
FORMULA_NAME Dekker-PT-010-CTLFireability-08
FORMULA_NAME Dekker-PT-010-CTLFireability-09
FORMULA_NAME Dekker-PT-010-CTLFireability-10
FORMULA_NAME Dekker-PT-010-CTLFireability-11
FORMULA_NAME Dekker-PT-010-CTLFireability-12
FORMULA_NAME Dekker-PT-010-CTLFireability-13
FORMULA_NAME Dekker-PT-010-CTLFireability-14
FORMULA_NAME Dekker-PT-010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1526622520158
info: Time: 3600 - MCC
===========================================================================================
prep: translating Dekker-PT-010 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-010 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ Dekker-PT-010 @ 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: 170/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 120 transitions, 20 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 230 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-010-CTLFireability.task
lola: NOT(E (F (A (X ((FIREABLE(withdraw_7_5) AND FIREABLE(withdraw_2_8))))))) : (((A (G (FIREABLE(withdraw_0_7))) AND NOT(E (X (FIREABLE(withdraw_3_7))))) OR (A ((FIREABLE(withdraw_1_2) U FIREABLE(withdraw_7_4))) AND FIREABLE(withdraw_1_5))) OR E (F ((A (X (FIREABLE(withdraw_5_8))) AND (NOT FIREABLE(withdraw_7_3) AND (FIREABLE(withdraw_2_7) OR FIREABLE(withdraw_6_2))))))) : E (F (A (F (A (G (FIREABLE(enter_7))))))) : A (G ((FIREABLE(withdraw_4_7) OR (E (F (FIREABLE(withdraw_0_8))) OR (FIREABLE(withdraw_8_3) OR FIREABLE(withdraw_5_3) OR FIREABLE(withdraw_2_8)))))) : (E (F (A (G (NOT FIREABLE(exit_8))))) OR E ((A (F (FIREABLE(withdraw_3_6))) U (FIREABLE(enter_5) AND FIREABLE(withdraw_9_1) AND FIREABLE(withdraw_6_5))))) : A (G ((NOT(A (X (FIREABLE(withdraw_5_2)))) OR E (X ((FIREABLE(withdraw_0_6) AND FIREABLE(withdraw_4_3))))))) : (((E (F ((FIREABLE(withdraw_6_8) AND FIREABLE(withdraw_5_6)))) OR FIREABLE(try_1)) AND (NOT FIREABLE(withdraw_6_8) AND NOT FIREABLE(withdraw_4_1))) OR FIREABLE(withdraw_0_8)) : E (G (A (F (NOT FIREABLE(exit_1))))) : NOT((E (F (FIREABLE(withdraw_7_3))) AND FIREABLE(withdraw_0_3))) : FIREABLE(withdraw_3_1) : (A (X (FIREABLE(withdraw_9_7))) AND (E (F (A (G (FIREABLE(withdraw_2_6))))) AND ((A (G (FIREABLE(withdraw_6_7))) AND A (X (FIREABLE(exit_5)))) OR ((FIREABLE(exit_9) AND (FIREABLE(enter_6) OR FIREABLE(withdraw_2_6))) OR FIREABLE(withdraw_6_0))))) : FIREABLE(withdraw_0_5) : (FIREABLE(withdraw_6_9) AND (FIREABLE(withdraw_2_1) OR E (F ((FIREABLE(withdraw_4_3) OR FIREABLE(withdraw_8_0) OR FIREABLE(withdraw_0_9) OR FIREABLE(withdraw_0_6)))))) : A (F ((NOT FIREABLE(withdraw_8_5) OR NOT FIREABLE(withdraw_8_2) OR (NOT FIREABLE(withdraw_6_2) AND NOT FIREABLE(try_1)) OR (FIREABLE(withdraw_9_8) AND FIREABLE(enter_3) AND NOT FIREABLE(withdraw_2_7) AND FIREABLE(withdraw_1_5))))) : (FIREABLE(withdraw_7_6) AND A (F (E (X ((FIREABLE(enter_4) OR FIREABLE(exit_2))))))) : FIREABLE(withdraw_7_9)
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_3_1)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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 Dekker-PT-010-CTLFireability-9 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: FIREABLE(withdraw_0_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_0_5)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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 Dekker-PT-010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_7_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_7_9)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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 Dekker-PT-010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((NOT FIREABLE(withdraw_7_5) OR NOT FIREABLE(withdraw_2_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(withdraw_7_5) OR NOT FIREABLE(withdraw_2_8))))))
lola: processed formula length: 83
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6144 markings, 171530 edges
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-0 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: (A (X (FIREABLE(withdraw_9_7))) AND (E (F (A (G (FIREABLE(withdraw_2_6))))) AND ((A (G (FIREABLE(withdraw_6_7))) AND A (X (FIREABLE(exit_5)))) OR ((FIREABLE(exit_9) AND (FIREABLE(enter_6) OR FIREABLE(withdraw_2_6))) OR FIREABLE(withdraw_6_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(withdraw_2_6)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(withdraw_2_6)
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 6144 markings, 171530 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (FIREABLE(withdraw_0_7))) AND A (X (NOT FIREABLE(withdraw_3_7)))) OR ((A ((FIREABLE(withdraw_1_2) U FIREABLE(withdraw_7_4))) AND FIREABLE(withdraw_1_5)) OR E (F ((A (X (FIREABLE(withdraw_5_8))) AND (NOT FIREABLE(withdraw_7_3) AND (FIREABLE(withdraw_2_7) OR FIREABLE(withdraw_6_2))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_1_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_1_5)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(withdraw_0_7)))
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(withdraw_0_7)))
lola: processed formula length: 30
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (FIREABLE(withdraw_5_8))) AND (NOT FIREABLE(withdraw_7_3) AND (FIREABLE(withdraw_2_7) OR FIREABLE(withdraw_6_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (AX(FIREABLE(withdraw_5_8)) AND (NOT FIREABLE(withdraw_7_3) AND (FIREABLE(withdraw_2_7) OR FIREABLE(withdraw_6_2)))))
lola: processed formula length: 127
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6144 markings, 171530 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(withdraw_7_6) AND A (F (E (X ((FIREABLE(enter_4) OR FIREABLE(exit_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_7_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_7_6)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-14 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 ((E (X (NOT FIREABLE(withdraw_5_2))) OR E (X ((FIREABLE(withdraw_0_6) AND FIREABLE(withdraw_4_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(EX(NOT FIREABLE(withdraw_5_2))) AND NOT(EX((FIREABLE(withdraw_0_6) AND FIREABLE(withdraw_4_3)))))))
lola: processed formula length: 117
lola: 22 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6144 markings, 171530 edges
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(enter_7)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(enter_7)
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 6144 markings, 171530 edges
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-2 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: A (F ((NOT FIREABLE(withdraw_8_5) OR NOT FIREABLE(withdraw_8_2) OR (NOT FIREABLE(withdraw_6_2) AND NOT FIREABLE(try_1)) OR (FIREABLE(withdraw_9_8) AND FIREABLE(enter_3) AND NOT FIREABLE(withdraw_2_7) AND FIREABLE(withdraw_1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (FIREABLE(withdraw_8_5) AND FIREABLE(withdraw_8_2) AND (FIREABLE(withdraw_6_2) OR FIREABLE(try_1)) AND (NOT FIREABLE(withdraw_9_8) OR NOT FIREABLE(enter_3) OR FIREABLE(withdraw_2_7) OR NOT FIREABLE(withdraw_1_5)))
lola: processed formula length: 217
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-13 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 (G (A (F (NOT FIREABLE(exit_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(exit_1)))))
lola: processed formula length: 50
lola: 20 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 18 edges
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-7 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: A (G ((FIREABLE(withdraw_4_7) OR (E (F (FIREABLE(withdraw_0_8))) OR (FIREABLE(withdraw_8_3) OR FIREABLE(withdraw_5_3) OR FIREABLE(withdraw_2_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT FIREABLE(withdraw_4_7) AND (NOT(E(TRUE U FIREABLE(withdraw_0_8))) AND (NOT FIREABLE(withdraw_8_3) AND NOT FIREABLE(withdraw_5_3) AND NOT FIREABLE(withdraw_2_8))))))
lola: processed formula length: 182
lola: 24 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6144 markings, 179620 edges
FORMULA Dekker-PT-010-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (NOT FIREABLE(exit_8))))) OR E ((A (F (FIREABLE(withdraw_3_6))) U (FIREABLE(enter_5) AND FIREABLE(withdraw_9_1) AND FIREABLE(withdraw_6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E(TRUE U NOT(E(TRUE U FIREABLE(exit_8)))) OR E(A(TRUE U FIREABLE(withdraw_3_6)) U (FIREABLE(enter_5) AND FIREABLE(withdraw_9_1) AND FIREABLE(withdraw_6_5))))
lola: processed formula length: 158
lola: 23 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6144 markings, 273643 edges
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-4 FALSE 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 (NOT FIREABLE(withdraw_7_3))) OR NOT FIREABLE(withdraw_0_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(withdraw_0_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(withdraw_0_3)
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-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: (((E (F ((FIREABLE(withdraw_6_8) AND FIREABLE(withdraw_5_6)))) OR FIREABLE(try_1)) AND (NOT FIREABLE(withdraw_6_8) AND NOT FIREABLE(withdraw_4_1))) OR FIREABLE(withdraw_0_8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_0_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_0_8)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(withdraw_6_8) AND NOT FIREABLE(withdraw_4_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(withdraw_6_8) AND NOT FIREABLE(withdraw_4_1))
lola: processed formula length: 59
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_6_8) AND FIREABLE(withdraw_5_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(withdraw_6_8) AND FIREABLE(withdraw_5_6))))
lola: processed formula length: 59
lola: 19 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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_6_8) AND FIREABLE(withdraw_5_6))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-010-CTLFireability-17-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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-6 TRUE 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: (FIREABLE(withdraw_6_9) AND (FIREABLE(withdraw_2_1) OR E (F ((FIREABLE(withdraw_4_3) OR FIREABLE(withdraw_8_0) OR FIREABLE(withdraw_0_9) OR FIREABLE(withdraw_0_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_6_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_6_9)
lola: processed formula length: 22
lola: 18 rewrites
lola: closed formula file Dekker-PT-010-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Dekker-PT-010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes yes yes no no no no yes no no
lola:
preliminary result: yes no no yes no yes yes yes yes no no no no yes no no
lola: memory consumption: 14536 KB
lola: time consumption: 0 seconds
BK_STOP 1526622520976
--------------------
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-010"
export BK_EXAMINATION="CTLFireability"
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-010.tgz
mv Dekker-PT-010 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-010, examination is CTLFireability"
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-152649936800074"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 ;